144 search results - page 3 / 29 » Complexity Results for Modal Dependence Logic |
KI
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), ...
KRDB
2001
13 years 8 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
AIML
2004
13 years 8 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We present a translation from a logic of access control with a "says" operator to the classical modal logic S4. We prove that the translation is sound and complete. We al...