70 search results - page 1 / 14 » A Framework for Compiling Preferences in Logic Programs |
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
JELIA
2000
Springer
13 years 8 months ago
2000
Springer
In previous work, we developed a framework for expressing general preference information in default logic and logic programming. Here we show that the approach of Brewka and Eiter ...
LPNMR
2001
Springer
13 years 9 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...
ECAI
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
ESOP
2007
Springer
13 years 10 months ago
2007
Springer
We give an overview of a proof-producing compiler which translates recursion equations, defined in higher order logic, to assembly language. The compiler is implemented and valida...