86 search results - page 2 / 18 » A Default Approach to Semantics of Logic Programs with Const... |
AAAI
2004
13 years 6 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
ICLP
2009
Springer
14 years 6 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 (...
POPL
1995
ACM
13 years 9 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
LPNMR
2001
Springer
13 years 10 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
AMAST
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...