247 search results - page 1 / 50 » Stable models and an alternative logic programming paradigm |
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 ...
AMAI
1999
Springer
13 years 4 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
ICLP
2001
Springer
13 years 9 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
JELIA
2000
Springer
13 years 8 months ago
2000
Springer
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Order...
PODS
1990
ACM
13 years 9 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...