Sciweavers

148 search results - page 8 / 30
» On the Complexity of Elementary Modal Logics
Sort
View
TARK
2009
Springer
15 years 6 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
ECAI
1992
Springer
15 years 3 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
AIML
2008
15 years 1 months ago
Topology, connectedness, and modal logic
This paper presents a survey of topological spatial logics, taking as its point of departure the interpretation of the modal logic S4 due to McKinsey and Tarski. We consider the ef...
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter...
ICLP
1997
Springer
15 years 3 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
CORR
2006
Springer
130views Education» more  CORR 2006»
14 years 11 months ago
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...
Joseph Y. Halpern, Leandro Chaves Rêgo