Sciweavers

351 search results - page 1 / 71
» Logic Programs with Compiled Preferences
Sort
View
CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 7 months ago
A Framework for Compiling Preferences in Logic Programs
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...
James P. Delgrande, Torsten Schaub, Hans Tompits
ECAI
2000
Springer
13 years 11 months ago
Logic Programs with Compiled Preferences
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...
James P. Delgrande, Torsten Schaub, Hans Tompits
LPNMR
2001
Springer
13 years 12 months ago
plp: A Generic Compiler for Ordered Logic Programs
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...
James P. Delgrande, Torsten Schaub, Hans Tompits
JELIA
2000
Springer
13 years 11 months ago
A Compilation of Brewka and Eiter's Approach to Prioritization
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 ...
James P. Delgrande, Torsten Schaub, Hans Tompits
KR
2004
Springer
14 years 25 days ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka