36 search results - page 5 / 8 » On Eliminating Disjunctions in Stable Logic Programming |
LPNMR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
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...
95
Voted
KR
2004
Springer
15 years 2 months ago
2004
Springer
The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal ...
LPNMR
2004
Springer
15 years 2 months ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
LPNMR
1999
Springer
15 years 1 months ago
1999
Springer
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...