Skip to main content
    • Aa
    • Aa

Anytime Computation of Cautious Consequences in Answer Set Programming


Query answering in Answer Set Programming (ASP) is usually solved by computing (a subset of) the cautious consequences of a logic program. This task is computationally very hard, and there are programs for which computing cautious consequences is not viable in reasonable time. However, current ASP solvers produce the (whole) set of cautious consequences only at the end of their computation. This paper reports on strategies for computing cautious consequences, also introducing anytime algorithms able to produce sound answers during the computation.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

M. Arenas , L. E. Bertossi , and J. Chomicki 2003. Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming 3, 4–5, 393424.

C. Baral 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.

M. Davis , G. Logemann , and D. Loveland 1962. A machine program for theorem proving. Commun. ACM 5, 394397.

N. Eén and N. Sörensson 2003b. Temporal induction by incremental sat solving. Electr. Notes Theor. Comput. Sci. 89, 4, 543560.

T. Eiter , G. Ianni , T. Lukasiewicz , R. Schindlauer , and H. Tompits 2008. Combining answer set programming with description logics for the semantic web. Artif. Intell. 172, 12–13, 14951539.

M. Gebser , B. Kaufmann , and T. Schaub 2012b. Multi-threaded ASP solving with clasp. Theory and Practice of Logic Programming 12, 45, 525545.

M. Gelfond and Y. Kahl 2014. Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach. Cambridge University Press.

M. Gelfond and V. Lifschitz 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365385.

S. Greco 2003. Binding propagation techniques for the optimization of bound disjunctive queries. IEEE Transactions on Knowledge and Data Engineering 15, 2 (March/April), 368385.

N. Leone , G. Pfeifer , W. Faber , T. Eiter , G. Gottlob , S. Perri , and F. Scarcello 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7, 3 (July), 499562.

V. Lifschitz 2002. Answer set programming and plan generation. Artificial Intelligence 138, 3954.

M. Luby , A. Sinclair , and D. Zuckerman 1993. Optimal speedup of Las Vegas algorithms. Inf. Process. Lett. 47, 173180.

M. Maratea , F. Ricca , W. Faber , and N. Leone 2008. Look-back techniques and heuristics in dlv: Implementation, evaluation, and comparison to qbf solvers. J. Algorithms 63, 1–3, 7089.

V. W. Marek and M. Truszczyński 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm – A 25-Year Perspective, K. R. Apt , V. W. Marek , M. Truszczyński , and D. S. Warren , Eds. Springer Verlag, 375398.

I. Niemelä 1999. Logic programming with stable model semantics as constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3–4, 241273.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Type Description Title
Supplementary Materials

ALVIANO et al.
Anytime Computation of Cautious Consequences in Answer Set Programming

 PDF (84 KB)
84 KB


Full text views

Total number of HTML views: 0
Total number of PDF views: 7 *
Loading metrics...

Abstract views

Total abstract views: 43 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th June 2017. This data will be updated every 24 hours.