Sciweavers

557 search results - page 2 / 112
» Useful Transformations in Answer set programming
Sort
View
AGP
2003
IEEE
13 years 10 months ago
An Ordered Choice Logic Programming Front-End for Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives without the burden of any form of negation. This complete ab...
Marina De Vos
AGP
2003
IEEE
13 years 10 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
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” nature ...
Thomas Eiter, Axel Polleres
ICLP
2007
Springer
13 years 9 months ago
Computing Fuzzy Answer Sets Using dlvhex
Fuzzy answer set programming has been introduced as a framework that successfully combines the concepts of answer set programming and fuzzy logic. In this paper, we show how the fu...
Davy Van Nieuwenborgh, Martine De Cock, Dirk Verme...
LPNMR
2007
Springer
13 years 11 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
ECAI
2006
Springer
13 years 9 months ago
On the Existence of Answer Sets in Normal Extended Logic Programs
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...
Martin Caminada, Chiaki Sakama