Sciweavers

583 search results - page 6 / 117
» Preferences in Answer Set Programming
Sort
View
LPNMR
2001
Springer
14 years 3 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
ASP
2003
Springer
14 years 4 months ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos
FUIN
2010
137views more  FUIN 2010»
13 years 8 months ago
Extending and Implementing RASP
In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and...
Stefania Costantini, Andrea Formisano, Davide Pett...
KR
2010
Springer
13 years 8 months ago
On the Progression Semantics and Boundedness of Answer Set Programs
In this paper, we propose a progression semantics for firstorder answer set programs. Based on this new semantics, we are able to define the notion of boundedness for answer set p...
Yan Zhang, Yi Zhou
CI
2004
125views more  CI 2004»
13 years 10 months ago
Reasoning about Actions and Planning with Preferences Using Prioritized Default Theory
This paper shows how action theories, expressed in an extended version of the language B, can be naturally encoded using Prioritized Default Theory. We also show how prioritized d...
Tran Cao Son, Enrico Pontelli