2022 search results - page 25 / 405 » Complexity of Non-Monotonic Logics |
162
click to vote
JACM
2002
15 years 5 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
159
click to vote
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
181
click to vote
AAAI
2006
15 years 7 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
192
click to vote
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
160
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract-- Complex robots with many interacting components in their control architectures are subject to component failures from which neither the control architecture nor the impl...