Sciweavers

291 search results - page 9 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
SAT
2009
Springer
121views Hardware» more  SAT 2009»
14 years 2 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
TARK
2005
Springer
14 years 1 months ago
Complexity results for logics of local reasoning and inconsistent belief
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
Martin Allen
JANCL
2002
77views more  JANCL 2002»
13 years 7 months ago
Axiomatizing Distance Logics
In [8, 6] we introduced a family of `modal' languages intended for talking about distances. These languages are interpreted in `distance spaces' which satisfy some (or a...
Oliver Kutz, Holger Sturm, Nobu-Yuki Suzuki, Frank...
CSL
2009
Springer
14 years 2 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
KI
2008
Springer
13 years 7 months ago
Shallow Models for Non-iterative Modal Logics
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 ...
Lutz Schröder, Dirk Pattinson