2022 search results - page 23 / 405 » Complexity of Non-Monotonic Logics |
AIML
2004
15 years 1 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
95
Voted
IJCAI
2003
15 years 1 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
100
Voted
CIE
2009
Springer
15 years 7 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
115
click to vote
DLOG
1998
15 years 1 months ago
1998
This paper introduces YAYA1, a Description Logic system focused towards learning complex interrelations among objects. YAYA Concept Language (YCL) is quite restricted; although it...
84
Voted
CORR
2010
Springer
15 years 18 days ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...