150 search results - page 4 / 30 » The Stable Models of a Predicate Logic Program |
PODS
1990
ACM
15 years 1 months ago
1990
ACM
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable m...
118
click to vote
ICLP
2003
Springer
15 years 2 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
ASP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
106
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
104
click to vote
ASP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...