Sciweavers

98 search results - page 5 / 20
» Trichotomy Results on the Complexity of Reasoning with Disju...
Sort
View
ICLP
2010
Springer
13 years 11 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano
MICAI
2000
Springer
13 years 11 months ago
Knowledge Representation Using High-Level Non-monotonic Reasoning
We introduce the new paradigm of High-Level Non-Monotonic reasoning (HLNM). This paradigm is the consolidation of our recent results on disjunctions, sets, explicit and implicit ne...
Mauricio Osorio, Juan Carlos Nieves, Fernando Zaca...
LPNMR
2009
Springer
14 years 1 months ago
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
Jörg Pührer, Hans Tompits
LPNMR
1999
Springer
13 years 11 months ago
On the Role of Negation in Choice Logic Programs
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
Marina De Vos, Dirk Vermeir
LPNMR
2009
Springer
14 years 1 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans