Using Criticalities as a Heuristic for Answer Set Programming
Orkunt Sabuncu,Ferda Nur Alpaslan,Varol Akman +2 more
- 06 Jan 2004
- Vol. 2923, pp 234-246
TL;DR: The main component of answer set programming is a system that finds the answer sets of logic programs by utilizing some heuristics to choose new literals at the choice points.
read more
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 programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key factors for the performance of the system.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Using Criticalities as a Heuristic for Answer Set Programming
Orkunt Sabuncu,Ferda Nur Alpaslan,Varol Akman +2 more
- 06 Jan 2004
TL;DR: The main component of answer set programming is a system that finds the answer sets of logic programs by utilizing some heuristics to choose new literals at the choice points.
Using Criticalities as a Heuristics for Answer Set Programming.
Orkunt Sabuncu,Ferda Nur Alpaslan,Varol Akman +2 more
- 01 Jan 2003
TL;DR: A new heuristic for answer set programming has been developed that is inspired by hierarchical planning and the notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic.
References
Negation as failure
Keith L. Clark
- 01 Oct 1987
TL;DR: It is shown that when the clause data base and the queries satisfy certain constraints, which still leaves us with a data base more general than a conventional relational data base, the query evaluation process will find every answer that is a logical consequence of the completed data base.
2.3K
The well-founded semantics for general logic programs
TL;DR: It is shown that the class of programs possessing a total well-founded model properly includes previously studied classes of "stratified" and "locally stratified" programs, and is compared with other proposals in the literature.
Extending and implementing the stable model semantics
TL;DR: A novel logic program like language, weight constraint rules, is developed for answer set programming purposes which offers a competitive implementation of the stable model semantics for normal programs and attractive performance for problems where the new types of rules provide a compact representation.
1K
Automatically generating abstractions for planning
TL;DR: A completely automated approach to generating abstractions for planning using a tractable, domain-independent algorithm whose only input is the definition of a problem to be solved and whose output is an abstraction hierarchy that is tailored to the particular problem.
388
Answer set planning
Vladimir Lifschitz
- 29 Nov 1999
TL;DR: In this paper, answer sets are represented as stable models, and solutions to a problem are represented by answer sets, not by answer substitutions produced in response to a query, as in conventional logic programming instead of Prolog.
336
Related Papers (5)
Christian Drescher,Toby Walsh +1 more
- 16 Jul 2011
Erez Karpas,Carmel Domshlak +1 more
- 25 Jun 2012
Ying Zhu,Miroslaw Truszczynski +1 more
- 15 Sep 2013