Sciweavers

2022 search results - page 9 / 405
» Complexity of Non-Monotonic Logics
Sort
View
APAL
2004
81views more  APAL 2004»
14 years 10 months ago
The complexity of first-order and monadic second-order logic revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
Markus Frick, Martin Grohe
CORR
2010
Springer
202views Education» more  CORR 2010»
14 years 10 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...
ECAI
2010
Springer
14 years 11 months ago
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The pa...
Xiaowei Huang, Ron van der Meyden
TARK
2005
Springer
15 years 3 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
CSL
2010
Springer
14 years 10 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe