ASSAT: computing answer sets of a logic program by SAT solvers

&
Artificial Intelligence 157 (1-2):115-137 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2004.04.004

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Computing definite logic programs by partial instantiation.Vadim Kagan, Anil Nerode & V. S. Subrahmanian - 1994 - Annals of Pure and Applied Logic 67 (1-3):161-182.
Program Verification and Functioning of Operative Computing Revisited: How about Mathematics Engineering? [REVIEW]Uri Pincas - 2011 - Minds and Machines 21 (2):337-359.
Safe beliefs for propositional theories.Mauricio Osorio, Juan Pérez & José Arrazola - 2005 - Annals of Pure and Applied Logic 134 (1):63-82.
Safe beliefs for propositional theories.Mauricio Osorio, Juan Antonio Navarro Pérez & José Arrazola - 2005 - Annals of Pure and Applied Logic 134 (1):63-82.
Model-based recasting in answer-set programming.Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits & Stefan Woltran - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):75-104.
Algorithmic entropy of sets.J. T. Schwartz - unknown
The Mechanism and Freedom of Logic.Granville C. Henry - 1993 - Upa.
Definitions in Answer Set Programming.Vladimir Lifschitz - unknown
Answer Sets and Qualitative Decision Making.Gerhard Brewka - 2005 - Synthese 146 (1-2):171-187.
What is answer set programming?Vladimir Lifschitz - unknown
Fuzzy logic and applications: 5th international workshop, WILF 2003, Naples, Italy, October 9-11, 2003: revised selected papers.V. Di Gesù, F. Masulli & Alfredo Petrosino (eds.) - 2006 - New York: Springer.
Answer-set programming encodings for argumentation frameworks.Uwe Egly, Sarah Alice Gaggl & Stefan Woltran - 2010 - Argument and Computation 1 (2):147-177.
Computational logic. Vol. 1: Classical deductive computing with classical logic. 2nd ed.Luis M. Augusto - 2022 - London: College Publications.
Random closed sets viewed as random recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.
Effective Domination and the Bounded Jump.Keng Meng Ng & Hongyuan Yu - 2020 - Notre Dame Journal of Formal Logic 61 (2):203-225.

Analytics

Added to PP
2020-12-22

Downloads
17 (#843,162)

6 months
14 (#170,850)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

View all 19 citations / Add more citations

References found in this work

Loop formulas for circumscription.Joohyung Lee & Fangzhen Lin - 2006 - Artificial Intelligence 170 (2):160-185.

Add more references