387 search results - page 10 / 78 » Hyperequivalence of Logic Programs with Respect to Supported... |
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
JAIR
2007
13 years 7 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
PODS
1990
ACM
13 years 11 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...
SIGSOFT
2009
ACM
14 years 8 months ago
2009
ACM
Modern development environments often involve models with complex consistency relations. Some of the relations can be automatically established through "fixing procedures&quo...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...