13 search results - page 2 / 3 » Eliminating Disjunction from Propositional Logic Programs un... |
NMR
2004
Springer
13 years 10 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
LPNMR
2009
Springer
13 years 11 months ago
2009
Springer
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...
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
SCCC
2005
IEEE
13 years 10 months ago
2005
IEEE
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...