Sciweavers

557 search results - page 3 / 112
» Useful Transformations in Answer set programming
Sort
View
LPNMR
2004
Springer
13 years 11 months ago
Using Criticalities as a Heuristic for Answer Set Programming
Abstract. Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic program...
Orkunt Sabuncu, Ferda Nur Alpaslan, Varol Akman
AI
2011
Springer
13 years 24 days ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
DKE
2010
167views more  DKE 2010»
13 years 5 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
LPNMR
2004
Springer
13 years 11 months ago
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
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...
Thomas Eiter, Axel Polleres
IJCAI
2007
13 years 7 months ago
A New Perspective on Stable Models
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz