Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Rostamigiv, Maryam"'
Unification in the Description Logic (DL) FL₀ is known to be ExpTimecomplete, and of unification type zero. We investigate in this paper whether a lower complexity of the unification problem can be achieved by either syntactically restricting the r
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A79629
https://tud.qucosa.de/api/qucosa%3A79629/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A79629/attachment/ATT-0/
The unification problem in a propositional logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unifier of F. When a unifiable formula has minimal complete sets of unifi
Externí odkaz:
http://arxiv.org/abs/2004.07904
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Rostamigiv, Maryam
Publikováno v:
Logic in Computer Science [cs.LO]. Université Toulouse III-Paul Sabatier, 2020. English
In this thesis, we shall investigate the unification problem in ordinary modal logics, fusions of two modal logics, and multi-modal epistemic logics. With respect to a propositional logic L, given a formula A, we have to find substitutions s such tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e73603412d73ae1aa26ac20d5c54a93b
https://theses.hal.science/tel-03341556
https://theses.hal.science/tel-03341556
The unification problem in a propositional logic is to determine, given a formula ϕ, whether there exists a substitution σ such that σ(ϕ) is in that logic. In that case, σ is a unifier of ϕ. When a unifiable formula has minimal complete sets of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::046aa8802076d32f866fb7fad4eeb4ff
https://hal.science/hal-03762105
https://hal.science/hal-03762105
Publikováno v:
Journal of Applied Logics-IfCoLoG Journal of Logics and their Applications
Journal of Applied Logics-IfCoLoG Journal of Logics and their Applications, College Publications, In press
Journal of Applied Logics-IfCoLoG Journal of Logics and their Applications, College Publications, In press
International audience; In a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ) is in L. When unifiable formulas have no minimal complete sets of unifiers, they are nullary. Otherwise, they are either infinitary, or finita
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::35b579c754a05650ac1529f99a92caa6
https://hal.science/hal-02936464
https://hal.science/hal-02936464
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
UNIF
UNIF, Jun 2020, Paris, France
UNIF, Jun 2020, Paris, France
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5e87d0fe3626089df9757deaa8637435
https://hal.archives-ouvertes.fr/hal-02936473/file/UNIF_2020_paper_1.pdf
https://hal.archives-ouvertes.fr/hal-02936473/file/UNIF_2020_paper_1.pdf
Publikováno v:
Annals of Mathematics & Artificial Intelligence; May2022, Vol. 90 Issue 5, p481-497, 17p
Publikováno v:
Actes des JIAF2019 : Journées de l’Intelligence Artificielle Fondamentale @ PFIA 2019
13èmes Journées d’Intelligence Artificielle Fondamentale (JIAF 2019)
13èmes Journées d’Intelligence Artificielle Fondamentale (JIAF 2019), Jul 2019, Toulouse, France
13èmes Journées d’Intelligence Artificielle Fondamentale (JIAF 2019)
13èmes Journées d’Intelligence Artificielle Fondamentale (JIAF 2019), Jul 2019, Toulouse, France
International audience; Unification in propositional logics is an active research area. In this paper, we introduce the results we have obtained within the context of modal logics and epistemic logics and we present some of the open problems whose so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8789be7302d2e5068112a5dd54ecc53e
https://hal.archives-ouvertes.fr/hal-02301934/document
https://hal.archives-ouvertes.fr/hal-02301934/document