378 search results - page 22 / 76 » Higher-order transformation of logic programs |
LOPSTR
2009
Springer
14 years 3 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
IJCAI
1993
13 years 9 months ago
1993
Gelfond and Lifschitz introduce a declarative language A for describing effects of actions and define a translation of theories in this language into extended logic programs(ELP, ...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
LOPSTR
1999
Springer
14 years 22 days ago
1999
Springer
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...