Sciweavers

2022 search results - page 18 / 405
» Complexity of Non-Monotonic Logics
Sort
View
SAT
2009
Springer
121views Hardware» more  SAT 2009»
15 years 7 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...
ATAL
2006
Springer
15 years 4 months ago
Complexity and succinctness of public announcement logic
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...
Carsten Lutz
75
Voted
AAAI
2007
15 years 2 months ago
Complexity Boundaries for Horn Description Logics
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i....
Markus Krötzsch, Sebastian Rudolph, Pascal Hi...
111
Voted
CADE
2010
Springer
15 years 1 months ago
An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can ...
Yevgeny Kazakov
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 17 days ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari