223 search results - page 15 / 45 » Logic programs with monotone abstract constraint atoms |
158
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
LPNMR
1993
Springer
15 years 1 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
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 ...
86
Voted
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
LPNMR
2001
Springer
15 years 1 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...