Conflict-driven answer set solving: From theory to practice

We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capt...

Full description

Saved in:

Bibliographic Details
Published in:	Artificial intelligence Vol. 187-188; pp. 52 - 89
Main Authors:	Gebser, Martin, Kaufmann, Benjamin, Schaub, Torsten
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 01.08.2012 Elsevier
Subjects:	Algorithms Answer set programming Applied sciences Artificial intelligence Computation Computer science; control theory; systems Exact sciences and technology Expert systems Learning and adaptive systems Logic programming Logical, boolean and switching functions Nonmonotonic reasoning Programming Solvers Theoretical computing Versatility Answer set programming Nonmonotonic reasoning Logic programming Conflict resolution Competitiveness Knowledge representation Algorithmics Constraint satisfaction Inference Logical programming Circumscription Set theory Satisfiability
ISSN:	0004-3702, 1872-7921
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply advanced solving techniques from the area of SAT. As a result, we present the first full-fledged algorithmic framework for native conflict-driven ASP solving. Our approach is implemented in the ASP solver clasp that has demonstrated its competitiveness and versatility by winning first places at various solver contests.
AbstractList	We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply advanced solving techniques from the area of SAT. As a result, we present the first full-fledged algorithmic framework for native conflict-driven ASP solving. Our approach is implemented in the ASP solver clasp that has demonstrated its competitiveness and versatility by winning first places at various solver contests.
Author	Gebser, Martin Kaufmann, Benjamin Schaub, Torsten
Author_xml	– sequence: 1 givenname: Martin surname: Gebser fullname: Gebser, Martin email: gebser@cs.uni-potsdam.de – sequence: 2 givenname: Benjamin surname: Kaufmann fullname: Kaufmann, Benjamin email: kaufmann@cs.uni-potsdam.de – sequence: 3 givenname: Torsten surname: Schaub fullname: Schaub, Torsten email: torsten@cs.uni-potsdam.de
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25986965$$DView record in Pascal Francis
BookMark	eNqFkMFKAzEURYNUsFX_wMVsBDczJplM0lQQpFgVBDe6Ds_MG02ZJjVJK_69IxUXLnT1eHDO5XInZOSDR0JOGK0YZfJ8WUHMzueKU8YrKipK2R4Zs6nipdKcjciYUirKWlF-QCYpLYe31pqNycU8-K53NpdtdFv0Bfj0jrFImIsU-q3zL7NiEcOqyK8Y4keRQ7GOYLOzeET2O-gTHn_fQ_K0uH6c35b3Dzd386v70oq6ySVQBppLkEo1LW2Z7IRqrcJGg3pGpQDklAsrJQitLQjKO075VA8dmWp1Vx-Ss13uOoa3DaZsVi5Z7HvwGDbJMKlYLVjT1AN6-o1CstB3Ebx1yayjW0H8MLzRU6llM3Bix9kYUorY_SCMmq9NzdLsNjVfmxoqzNBm0Ga_NOsyZBd8juD6_-TLnYzDVluH0STr0FtsXUSbTRvc3wGfTWSVpw
CODEN	AINTBB
CitedBy_id	crossref_primary_10_1017_S1471068418000558 crossref_primary_10_1017_S1471068422000047 crossref_primary_10_1016_j_eswa_2022_118022 crossref_primary_10_1016_j_artint_2014_12_001 crossref_primary_10_1017_S1471068424000073 crossref_primary_10_1145_2926791 crossref_primary_10_1007_s10994_018_5708_2 crossref_primary_10_1016_j_eswa_2020_114297 crossref_primary_10_3233_SW_180330 crossref_primary_10_1016_j_artint_2018_10_007 crossref_primary_10_1007_s11222_015_9611_4 crossref_primary_10_1016_j_eswa_2017_06_013 crossref_primary_10_4204_EPTCS_416_25 crossref_primary_10_1016_j_entcs_2020_10_004 crossref_primary_10_1017_S1471068417000217 crossref_primary_10_1016_j_artint_2019_04_004 crossref_primary_10_1017_S1471068416000429 crossref_primary_10_1371_journal_pone_0313962 crossref_primary_10_1017_S1471068421000508 crossref_primary_10_1007_s10994_017_5683_z crossref_primary_10_1007_s13218_018_0536_x crossref_primary_10_1017_S1471068417000291 crossref_primary_10_1145_3704849 crossref_primary_10_4204_EPTCS_416_34 crossref_primary_10_1145_3571200 crossref_primary_10_1016_j_artint_2022_103697 crossref_primary_10_1016_j_artint_2020_103370 crossref_primary_10_1017_S1471068418000133 crossref_primary_10_1017_S1471068422000308 crossref_primary_10_1017_S1471068424000255 crossref_primary_10_1007_s13748_024_00342_z crossref_primary_10_1002_jcd_21876 crossref_primary_10_1017_S1471068423000030 crossref_primary_10_1007_s13218_018_0548_6 crossref_primary_10_3233_IA_240024 crossref_primary_10_1017_S1471068415000228 crossref_primary_10_1007_s10994_021_06089_1 crossref_primary_10_1007_s13278_020_00662_7 crossref_primary_10_1017_S1471068418000145 crossref_primary_10_1109_TG_2021_3076368 crossref_primary_10_1017_S1471068418000546 crossref_primary_10_1017_S1471068418000261 crossref_primary_10_1017_S1471068417000278 crossref_primary_10_1016_j_artint_2015_01_002 crossref_primary_10_1017_S1471068416000569 crossref_primary_10_1080_0952813X_2018_1456793 crossref_primary_10_1109_TSE_2021_3113920 crossref_primary_10_1007_s10951_022_00737_7 crossref_primary_10_1017_S147106841300032X crossref_primary_10_1016_j_artint_2016_03_004 crossref_primary_10_1016_j_artint_2022_103754 crossref_primary_10_1017_S1471068425100124 crossref_primary_10_1016_j_endm_2018_02_003 crossref_primary_10_1017_S1471068416000338 crossref_primary_10_1109_TETCI_2021_3084290 crossref_primary_10_1017_S1471068415000241 crossref_primary_10_1017_S1471068424000036 crossref_primary_10_1093_logcom_exad035 crossref_primary_10_1371_journal_pcbi_1005276 crossref_primary_10_1007_s13218_018_0545_9 crossref_primary_10_1017_S1471068416000211 crossref_primary_10_1017_S147106841500023X crossref_primary_10_1049_iet_cdt_2018_5073 crossref_primary_10_1017_S1471068419000036 crossref_primary_10_1007_s10601_020_09318_x crossref_primary_10_1007_s10207_022_00629_z crossref_primary_10_1016_j_artint_2024_104276 crossref_primary_10_1017_S1471068415000113 crossref_primary_10_1109_ACCESS_2016_2541999 crossref_primary_10_1017_S1471068414000325 crossref_primary_10_1017_S1471068422000096 crossref_primary_10_1007_s13218_018_0550_z crossref_primary_10_1007_s10601_016_9257_7 crossref_primary_10_1017_S147106841800056X crossref_primary_10_3233_AAC_170031 crossref_primary_10_1016_j_artint_2023_103931 crossref_primary_10_1017_S1471068417000242 crossref_primary_10_1007_s10951_021_00701_x crossref_primary_10_1016_j_artint_2019_07_005 crossref_primary_10_1017_S1471068421000090 crossref_primary_10_1016_j_artint_2015_09_008 crossref_primary_10_1016_j_artint_2016_09_006 crossref_primary_10_1145_3412854 crossref_primary_10_1093_logcom_exad017 crossref_primary_10_3390_electronics11121888 crossref_primary_10_1016_j_eswa_2022_117599 crossref_primary_10_1093_logcom_exad014 crossref_primary_10_3233_IA_170030 crossref_primary_10_1017_S1471068414000015 crossref_primary_10_1007_s13278_017_0425_6 crossref_primary_10_1017_S1471068421000363 crossref_primary_10_1093_logcom_exae041 crossref_primary_10_1016_j_jss_2014_09_001 crossref_primary_10_1093_logcom_exae042 crossref_primary_10_1017_S1471068422000114 crossref_primary_10_3233_IA_180119 crossref_primary_10_3390_pr8121649 crossref_primary_10_1017_S147106842000040X crossref_primary_10_3389_fdata_2019_00015 crossref_primary_10_1609_aimag_v37i3_2672 crossref_primary_10_1609_aimag_v37i3_2675 crossref_primary_10_3390_app10217700
Cites_doi	10.1023/A:1018978005636 10.1155/2009/863630 10.1016/j.artint.2004.04.004 10.1017/S1471068410000578 10.1007/BF01940892 10.1007/978-3-540-72788-0_27 10.1016/0304-3975(92)90019-C 10.1007/s10472-009-9113-1 10.1007/BF03037169 10.1137/0201010 10.1145/321033.321034 10.1016/S0004-3702(02)00187-X 10.1093/logcom/exn038 10.1016/0743-1066(84)90014-1 10.1007/978-3-642-04238-6_75 10.1007/978-3-642-02846-5_22 10.1016/j.artint.2010.10.002 10.1007/978-3-642-04238-6_50 10.1007/978-3-642-20895-9_42 10.1007/978-3-642-20895-9_39 10.1007/11546207_10 10.3166/jancl.16.35-86 10.1016/S0004-3702(02)00186-8 10.1145/1131313.1131316 10.3233/SAT190039 10.1007/978-3-540-89982-2_21 10.1016/S1571-0661(05)82542-3 10.3233/AIC-2011-0491 10.1007/978-3-642-02846-5_15 10.1109/12.769433 10.1613/jair.1410 10.1016/j.artint.2010.04.002 10.1007/978-3-642-20895-9_40 10.1007/978-3-642-02846-5_23 10.1007/978-3-642-04238-6_14 10.1007/978-3-540-24605-3_37 10.1007/978-3-642-02846-5_28 10.1017/S1471068408003578 10.1145/1149114.1149117 10.1145/1217856.1217859 10.1017/S1471068410000554 10.1145/368273.368557 10.1145/116825.116838 10.1016/S0004-3702(02)00207-2 10.1006/jcss.1995.1053 10.1007/s10472-008-9090-9 10.1007/978-3-642-04238-6_47 10.3233/SAT190014 10.1007/978-3-540-89982-2_23 10.1016/0020-0190(93)90029-9 10.1006/inco.1997.2630 10.1007/978-3-540-89982-2_20 10.1007/11546207_5 10.1007/s10817-006-9033-2 10.1007/s10472-009-9118-9 10.1023/A:1018930122475
ContentType	Journal Article
Copyright	2012 Elsevier B.V. 2015 INIST-CNRS
Copyright_xml	– notice: 2012 Elsevier B.V. – notice: 2015 INIST-CNRS
DBID	6I. AAFTH AAYXX CITATION IQODW 7SC 8FD F28 FR3 JQ2 L7M L~C L~D
DOI	10.1016/j.artint.2012.04.001
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1872-7921
EndPage	89
ExternalDocumentID	25986965 10_1016_j_artint_2012_04_001 S0004370212000409
GroupedDBID	--K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6I. 6J9 6TJ 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACWUS ACZNC ADBBV ADEZE ADMUD AEBSH AECPX AEFWE AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 E3Z EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM KQ8 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL VQA WH7 WUQ XFK XJE XJT XPP XSW ZMT ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD F28 FR3 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c435t-a01a926a6775d0d16f47dc7e59a7be77aa6824c66a499ca402f2028900017d9f3
ISICitedReferencesCount	244
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000305598200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0004-3702
IngestDate	Thu Oct 02 11:33:46 EDT 2025 Mon Jul 21 09:16:05 EDT 2025 Tue Nov 18 20:00:29 EST 2025 Sat Nov 29 06:08:07 EST 2025 Fri Feb 23 02:31:58 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Keywords	Answer set programming Nonmonotonic reasoning Logic programming Conflict resolution Competitiveness Knowledge representation Algorithmics Constraint satisfaction Inference Logical programming Circumscription Set theory Satisfiability
Language	English
License	http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c435t-a01a926a6775d0d16f47dc7e59a7be77aa6824c66a499ca402f2028900017d9f3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23
OpenAccessLink	https://dx.doi.org/10.1016/j.artint.2012.04.001
PQID	1671341553
PQPubID	23500
PageCount	38
ParticipantIDs	proquest_miscellaneous_1671341553 pascalfrancis_primary_25986965 crossref_primary_10_1016_j_artint_2012_04_001 crossref_citationtrail_10_1016_j_artint_2012_04_001 elsevier_sciencedirect_doi_10_1016_j_artint_2012_04_001
PublicationCentury	2000
PublicationDate	2012-08-01
PublicationDateYYYYMMDD	2012-08-01
PublicationDate_xml	– month: 08 year: 2012 text: 2012-08-01 day: 01
PublicationDecade	2010
PublicationPlace	Oxford
PublicationPlace_xml	– name: Oxford
PublicationTitle	Artificial intelligence
PublicationYear	2012
Publisher	Elsevier B.V Elsevier
Publisher_xml	– name: Elsevier B.V – name: Elsevier
References	J. Huang, The effect of restarts on the efficiency of clause learning, in Veloso (2007) K. Pipatsrisawat, A. Darwiche, A lightweight component caching scheme for satisfiability solvers, in Marques-Silva and Sakallah (2007) Niemelä (br1020) 1999; 25 Z. Lin, Y. Zhang, H. Hernandez, Fast SAT-based answer set solver, in Gil and Mooney (2006) Apt, Blair, Walker (br0030) 1987 Pipatsrisawat, Darwiche (br1090) 2011; 175 Baral (br0060) 2003 Marques-Silva, Sakallah (br0970) 1999; 48 M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, S. Thiele, Engineering an incremental ASP solver, in Garcia de la Banda and Pontelli (2008) (br1250) 2007 C. Anger, M. Gebser, T. Schaub, Approaching the core of unfounded sets, in: J. Dix, A. Hunter (Eds.), Proceedings of the Eleventh International Workshop on Nonmonotonic Reasoning (NMRʼ06), number IFI-06-04, Institute for Informatics, Clausthal University of Technology, Technical Report Series, 2006, pp. 58–66. Simons, Niemelä, Soininen (br1190) 2002; 138 (br0380) 2009; vol. 5753 Gebser, Schaub (br0630) 2006; vol. 4079 M. Gebser, B. Kaufmann, A. Neumann, T. Schaub, Conflict-driven answer set solving, in Veloso (2007) (br0690) 2006 Perri, Scarcello, Catalano, Leone (br1050) 2007; 51 Anger, Gebser, Linke, Neumann, Schaub (br0010) 2005; vol. 3835 E. Ellguth, M. Gebser, M. Gusowski, R. Kaminski, B. Kaufmann, S. Liske, T. Schaub, L. Schneidenbach, B. Schnor, A simple distributed conflict-driven answer set solver, in Erdem et al. (2009) L. Zhang, C. Madigan, M. Moskewicz, S. Malik, Efficient conflict driven learning in a Boolean satisfiability solver, in: Proceedings of the International Conference on Computer-Aided Design (ICCADʼ01), 2001, pp. 279–285. Babovich, Lifschitz (br0050) 2003 Fages (br0400) 1994; 1 Marques-Silva, Lynce, Malik (br0960) 2009; vol. 185 Lifschitz, Tang, Turner (br0890) 1999; 25 N. Eén, N. Sörensson, An extensible SAT-solver, in: Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SATʼ03), 2003, pp. 502–518. Pearce (br1060) 1996; vol. 1216 Järvisalo, Oikarinen (br0790) 2008; 8 M. Gebser, J. Lee, Y. Lierler, Head-elementary-set-free logic programs, in Baral et al. (2007) Clark (br0210) 1978 , . Dowling, Gallier (br0300) 1984; 1 Lee (br0820) 2005 Syrjänen (br1200) Pipatsrisawat, Darwiche (br1080) 2008 Tseitin (br1230) 1970 Gebser, Kaminski, Kaufmann, Schaub (br0480) 2011; vol. 11 Ishebabi, Mahr, Bobda, Gebser, Schaub (br0750) 2009 (br0430) 2008; vol. 5366 M. Gebser, T. Schaub, Characterizing ASP inferences by unit propagation, in: E. Giunchiglia, V. Marek, D. Mitchell, E. Ternovska (Eds.), Proceedings of the First International Workshop on Search and Logic: Answer Set Programming and SAT (LaShʼ06), 2006, pp. 41–56. Brain, De Vos (br0150) 2009; 19 M. Mariën, J. Wittocx, M. Denecker, M. Bruynooghe, SAT(ID): Satisfiability of propositional logic extended with inductive definitions, in Kleine Büning and Zhao (2008) X. Chen, J. Ji, F. Lin, Computing loops with at most one external support rule for disjunctive logic programs, in Erdem et al. (2009) G. Boenn, M. Brain, M. De Vos, J. Fitch, Automatic composition of melodic and harmonic music by answer set programming, in Garcia de la Banda and Pontelli (2008) Janhunen, Niemelä (br0770) 2011; vol. 6565 Barrett, Sebastiani, Seshia, Tinelli (br0100) 2009; vol. 185 Beame, Kautz, Sabharwal (br0090) 2004; 22 Giunchiglia, Leone, Maratea (br0700) 2008; 53 P. Ferraris, Answer sets for propositional theories, in Baral et al. (2005) V. Ryvchin, O. Strichman, Local restarts, in Kleine Büning and Zhao (2008) (br0270) 2011; vol. 6645 M. Gebser, T. Schaub, Loops: Relevant or redundant?, in Baral et al. (2005) G. Audemard, L. Simon, Predicting learnt clauses quality in modern SAT solvers, in Boutilier (2009) Schlipf (br1170) 1995; 51 Darwiche, Pipatsrisawat (br0230) 2009; vol. 185 C. Drescher, M. Gebser, B. Kaufmann, T. Schaub, Heuristics in conflict resolution, in: M. Pagnucco, M. Thielscher (Eds.), Proceedings of the Twelfth International Workshop on Nonmonotonic Reasoning (NMRʼ08), number UNSW-CSE-TR-0819, School of Computer Science and Engineering, The University of New South Wales, Technical Report Series, 2008, pp. 141–149. M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, B. Schnor, Cluster-based ASP solving with M. Gebser, R. Kaminski, A. König, T. Schaub, Advances in Eén, Sörensson (br0340) 2003; 89 series 3, in Delgrande and Faber (2011) (br0810) 2008; vol. 4996 Marek, Truszczyński (br0940) 1999 Ward, Schlipf (br1260) 2004; vol. 2923 Faber, Pfeifer, Leone (br0390) 2011; 175 L. Ryan, Efficient algorithms for clause-learning SAT solvers, Masterʼs thesis, Simon Fraser University, 2004. Leone, Rullo, Scarcello (br0840) 1997; 135 M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, M. Schneider, S. Ziller, A portfolio solver for answer set programming: Preliminary report, in Delgrande and Faber (2011) Goldberg, Novikov (br0720) 2002 Davis, Logemann, Loveland (br0240) 1962; 5 Biere (br0110) 2008; 4 M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, S. Thiele, A userʼs guide to N. Dershowitz, Z. Hanna, A. Nadel, Towards a better understanding of the functionality of a conflict-driven SAT solver, in Marques-Silva and Sakallah (2007) M. Gebser, B. Kaufmann, A. Neumann, T. Schaub, clasp: A conflict-driven answer set solver, in Baral et al. (2007) Li, Manyà (br0850) 2009; vol. 185 Gebser, Kaminski, Kaufmann, Ostrowski, Schaub, Schneider (br0440) 2011; 24 Janhunen (br0760) 2006; 16 J. Freeman, Improvements to propositional satisfiability search algorithms, PhD thesis, University of Pennsylvania, 1995. Ricca, Faber, Leone (br1120) 2006; 19 br0220 M. Denecker, J. Vennekens, S. Bond, M. Gebser, M. Truszczyński, The second answer set programming competition, in Erdem et al. (2009) M. Gebser, B. Kaufmann, A. Neumann, T. Schaub, Conflict-driven answer set enumeration, in Baral et al. (2007) Schneidenbach, Schnor, Gebser, Kaminski, Kaufmann, Schaub (br1180) 2009; vol. 5759 A. Mileo, D. Merico, R. Bisiani, A logic programming approach to home monitoring for risk prevention in assisted living, in Garcia de la Banda and Pontelli (2008) Van Gelder, Ross, Schlipf (br1240) 1991; 38 M. Gebser, B. Kaufmann, T. Schaub, The conflict-driven answer set solver clasp: Progress report, in Erdem et al. (2009) (br0120) 2009; vol. 185 Gebser, Kaufmann, Schaub (br0570) 2009; vol. 5547 T. Janhunen, I. Niemelä, M. Sevalnev, Computing stable models via reductions to difference logic, in Erdem et al. (2009) M. Gebser, J. Lee, Y. Lierler, Elementary sets for logic programs, in Gil and Mooney (2006) Leone, Pfeifer, Faber, Eiter, Gottlob, Perri, Scarcello (br0830) 2006; 7 Gelfond, Lifschitz (br0670) 1988 Gelfond, Leone (br0660) 2002; 138 (br0980) 2007; vol. 4501 Gelfond, Lifschitz (br0680) 1991; 9 Eén, Biere (br0330) 2005; vol. 3569 C. Drescher, M. Gebser, T. Grote, B. Kaufmann, A. König, M. Ostrowski, T. Schaub, Conflict-driven disjunctive answer set solving, in Brewka and Lang (2008) K. Claessen, N. Sörensson, New techniques that improve MACE-style finite model finding, in: P. Baumgartner, C. Fermüller (Eds.), Proceedings of the Workshop on Model Computation — Principles, Algorithms, Applications (MODELʼ03), 2003. Luby, Sinclair, Zuckerman (br0920) 1993; 47 Purdom (br1110) 1970; 10 (br0140) 2009 Moskewicz, Madigan, Zhao, Zhang, Malik (br1010) 2001 X. Chen, J. Ji, F. Lin, Computing loops with at most one external support rule, in Brewka and Lang (2008) (br0160) 2008 M. Gebser, M. Ostrowski, T. Schaub, Constraint answer set solving, in Hill and Warren (2009) Dechter (br0260) 2003 (br1130) 2006 Marek, Subrahmanian (br0930) 1992; 103 M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, On the implementation of weight constraint rules in conflict-driven ASP solvers, in Hill and Warren (2009) Gebser, Schaub, Thiele, Veber (br0640) 2011; 11 (br0080) 2005; vol. 3662 Zhang, Malik (br1280) 2003 Tarjan (br1210) 1972; 1 Lin, Zhao (br0900) 2004; 157 and Giunchiglia, Lierler, Maratea (br0710) 2006; 36 available at in Delgrande and Faber (2011) (br0730) 2009; vol. 5649 (br0070) 2007; vol. 4483 Lifschitz (br0870) 2002; 138 Nieuwenhuis, Oliveras, Tinelli (br1040) 2006; 53 Niemelä (br1030) 2008; 53 M. Thielscher, Answer set programming for single-player games in general game playing, in Hill and Warren (2009) Davis, Putnam (br0250) 1960; 7 Gelfond (br0650) 2008 Mitchell (br1000) 2005; 85 Lierler (br0860) 2011; 11 Calimeri, Faber, Pfeifer, Leone (br0170) 2006; 71 Eén, Sörensson (br0360) 2006; 2 Roussel, Manquinho (br1140) 2009; vol. 185 Potassco (br1100) Gebser, Kaufmann, Neumann, Schaub (br0550) 2008 Lifschitz, Razborov (br0880) 2006; 7 T. Kim, J. Lee, R. Palla, Circumscriptive event calculus as answer set programming, in Boutilier (2009) Gelfond (10.1016/j.artint.2012.04.001_br0670) 1988 Li (10.1016/j.artint.2012.04.001_br0850) 2009; vol. 185 Apt (10.1016/j.artint.2012.04.001_br0030) 1987 Lifschitz (10.1016/j.artint.2012.04.001_br0890) 1999; 25 Baral (10.1016/j.artint.2012.04.001_br0060) 2003 10.1016/j.artint.2012.04.001_br0800 10.1016/j.artint.2012.04.001_br0530 Nieuwenhuis (10.1016/j.artint.2012.04.001_br1040) 2006; 53 10.1016/j.artint.2012.04.001_br0410 (10.1016/j.artint.2012.04.001_br0080) 2005; vol. 3662 10.1016/j.artint.2012.04.001_br0130 10.1016/j.artint.2012.04.001_br1220 Marek (10.1016/j.artint.2012.04.001_br0930) 1992; 103 10.1016/j.artint.2012.04.001_br0370 Darwiche (10.1016/j.artint.2012.04.001_br0230) 2009; vol. 185 10.1016/j.artint.2012.04.001_br0490 (10.1016/j.artint.2012.04.001_br0690) 2006 (10.1016/j.artint.2012.04.001_br0730) 2009; vol. 5649 Calimeri (10.1016/j.artint.2012.04.001_br0170) 2006; 71 Gebser (10.1016/j.artint.2012.04.001_br0630) 2006; vol. 4079 Gebser (10.1016/j.artint.2012.04.001_br0480) 2011; vol. 11 Purdom (10.1016/j.artint.2012.04.001_br1110) 1970; 10 Dowling (10.1016/j.artint.2012.04.001_br0300) 1984; 1 Zhang (10.1016/j.artint.2012.04.001_br1280) 2003 (10.1016/j.artint.2012.04.001_br1250) 2007 10.1016/j.artint.2012.04.001_br0910 Järvisalo (10.1016/j.artint.2012.04.001_br0790) 2008; 8 (10.1016/j.artint.2012.04.001_br0980) 2007; vol. 4501 10.1016/j.artint.2012.04.001_br0520 Lee (10.1016/j.artint.2012.04.001_br0820) 2005 Niemelä (10.1016/j.artint.2012.04.001_br1030) 2008; 53 Van Gelder (10.1016/j.artint.2012.04.001_br1240) 1991; 38 Janhunen (10.1016/j.artint.2012.04.001_br0760) 2006; 16 Pearce (10.1016/j.artint.2012.04.001_br1060) 1996; vol. 1216 (10.1016/j.artint.2012.04.001_br0430) 2008; vol. 5366 Syrjänen (10.1016/j.artint.2012.04.001_br1200) Giunchiglia (10.1016/j.artint.2012.04.001_br0700) 2008; 53 Moskewicz (10.1016/j.artint.2012.04.001_br1010) 2001 Giunchiglia (10.1016/j.artint.2012.04.001_br0710) 2006; 36 Lifschitz (10.1016/j.artint.2012.04.001_br0870) 2002; 138 Clark (10.1016/j.artint.2012.04.001_br0210) 1978 Gebser (10.1016/j.artint.2012.04.001_br0550) 2008 10.1016/j.artint.2012.04.001_br0500 Marques-Silva (10.1016/j.artint.2012.04.001_br0970) 1999; 48 10.1016/j.artint.2012.04.001_br0510 10.1016/j.artint.2012.04.001_br0350 10.1016/j.artint.2012.04.001_br0470 10.1016/j.artint.2012.04.001_br0990 Davis (10.1016/j.artint.2012.04.001_br0250) 1960; 7 10.1016/j.artint.2012.04.001_br1160 Roussel (10.1016/j.artint.2012.04.001_br1140) 2009; vol. 185 10.1016/j.artint.2012.04.001_br0590 10.1016/j.artint.2012.04.001_br0190 Gebser (10.1016/j.artint.2012.04.001_br0440) 2011; 24 Eén (10.1016/j.artint.2012.04.001_br0330) 2005; vol. 3569 (10.1016/j.artint.2012.04.001_br0810) 2008; vol. 4996 Lin (10.1016/j.artint.2012.04.001_br0900) 2004; 157 10.1016/j.artint.2012.04.001_br0610 10.1016/j.artint.2012.04.001_br0620 Janhunen (10.1016/j.artint.2012.04.001_br0770) 2011; vol. 6565 10.1016/j.artint.2012.04.001_br0740 10.1016/j.artint.2012.04.001_br0460 10.1016/j.artint.2012.04.001_br0580 10.1016/j.artint.2012.04.001_br1270 10.1016/j.artint.2012.04.001_br0180 Fages (10.1016/j.artint.2012.04.001_br0400) 1994; 1 Pipatsrisawat (10.1016/j.artint.2012.04.001_br1080) 2008 10.1016/j.artint.2012.04.001_br1150 Ward (10.1016/j.artint.2012.04.001_br1260) 2004; vol. 2923 Gelfond (10.1016/j.artint.2012.04.001_br0660) 2002; 138 Pipatsrisawat (10.1016/j.artint.2012.04.001_br1090) 2011; 175 Eén (10.1016/j.artint.2012.04.001_br0360) 2006; 2 Gebser (10.1016/j.artint.2012.04.001_br0640) 2011; 11 10.1016/j.artint.2012.04.001_br0600 Goldberg (10.1016/j.artint.2012.04.001_br0720) 2002 Babovich (10.1016/j.artint.2012.04.001_br0050) Leone (10.1016/j.artint.2012.04.001_br0830) 2006; 7 10.1016/j.artint.2012.04.001_br0450 10.1016/j.artint.2012.04.001_br0290 (10.1016/j.artint.2012.04.001_br0270) 2011; vol. 6645 Potassco (10.1016/j.artint.2012.04.001_br1100) Eén (10.1016/j.artint.2012.04.001_br0340) 2003; 89 Lierler (10.1016/j.artint.2012.04.001_br0860) 2011; 11 Ricca (10.1016/j.artint.2012.04.001_br1120) 2006; 19 Leone (10.1016/j.artint.2012.04.001_br0840) 1997; 135 (10.1016/j.artint.2012.04.001_br0380) 2009; vol. 5753 10.1016/j.artint.2012.04.001_br0200 (10.1016/j.artint.2012.04.001_br0160) 2008 10.1016/j.artint.2012.04.001_br0320 (10.1016/j.artint.2012.04.001_br0140) 2009 Schlipf (10.1016/j.artint.2012.04.001_br1170) 1995; 51 10.1016/j.artint.2012.04.001_br0560 Gelfond (10.1016/j.artint.2012.04.001_br0680) 1991; 9 10.1016/j.artint.2012.04.001_br0280 10.1016/j.artint.2012.04.001_br0040 Lifschitz (10.1016/j.artint.2012.04.001_br0880) 2006; 7 Davis (10.1016/j.artint.2012.04.001_br0240) 1962; 5 (10.1016/j.artint.2012.04.001_br0120) 2009; vol. 185 Marques-Silva (10.1016/j.artint.2012.04.001_br0960) 2009; vol. 185 Perri (10.1016/j.artint.2012.04.001_br1050) 2007; 51 Ishebabi (10.1016/j.artint.2012.04.001_br0750) 2009 Dechter (10.1016/j.artint.2012.04.001_br0260) 2003 10.1016/j.artint.2012.04.001_br0310 Luby (10.1016/j.artint.2012.04.001_br0920) 1993; 47 10.1016/j.artint.2012.04.001_br0950 Niemelä (10.1016/j.artint.2012.04.001_br1020) 1999; 25 Brain (10.1016/j.artint.2012.04.001_br0150) 2009; 19 Tarjan (10.1016/j.artint.2012.04.001_br1210) 1972; 1 Gebser (10.1016/j.artint.2012.04.001_br0570) 2009; vol. 5547 Gelfond (10.1016/j.artint.2012.04.001_br0650) 2008 Barrett (10.1016/j.artint.2012.04.001_br0100) 2009; vol. 185 Mitchell (10.1016/j.artint.2012.04.001_br1000) 2005; 85 Biere (10.1016/j.artint.2012.04.001_br0110) 2008; 4 Anger (10.1016/j.artint.2012.04.001_br0010) 2005; vol. 3835 (10.1016/j.artint.2012.04.001_br1130) 2006 Schneidenbach (10.1016/j.artint.2012.04.001_br1180) 2009; vol. 5759 Marek (10.1016/j.artint.2012.04.001_br0940) 1999 10.1016/j.artint.2012.04.001_br0420 10.1016/j.artint.2012.04.001_br0540 (10.1016/j.artint.2012.04.001_br0070) 2007; vol. 4483 10.1016/j.artint.2012.04.001_br0020 Beame (10.1016/j.artint.2012.04.001_br0090) 2004; 22 Simons (10.1016/j.artint.2012.04.001_br1190) 2002; 138 10.1016/j.artint.2012.04.001_br0780 Faber (10.1016/j.artint.2012.04.001_br0390) 2011; 175 Tseitin (10.1016/j.artint.2012.04.001_br1230) 1970 10.1016/j.artint.2012.04.001_br1070
References_xml	– reference: M. Gebser, J. Lee, Y. Lierler, Head-elementary-set-free logic programs, in Baral et al. (2007) – reference: J. Freeman, Improvements to propositional satisfiability search algorithms, PhD thesis, University of Pennsylvania, 1995. – reference: M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, M. Schneider, S. Ziller, A portfolio solver for answer set programming: Preliminary report, in Delgrande and Faber (2011) – volume: 10 start-page: 76 year: 1970 end-page: 94 ident: br1110 article-title: A transitive closure algorithm publication-title: BIT Numerical Mathematics – reference: C. Drescher, M. Gebser, B. Kaufmann, T. Schaub, Heuristics in conflict resolution, in: M. Pagnucco, M. Thielscher (Eds.), Proceedings of the Twelfth International Workshop on Nonmonotonic Reasoning (NMRʼ08), number UNSW-CSE-TR-0819, School of Computer Science and Engineering, The University of New South Wales, Technical Report Series, 2008, pp. 141–149. – reference: C. Drescher, M. Gebser, T. Grote, B. Kaufmann, A. König, M. Ostrowski, T. Schaub, Conflict-driven disjunctive answer set solving, in Brewka and Lang (2008) – volume: 48 start-page: 506 year: 1999 end-page: 521 ident: br0970 article-title: GRASP: A search algorithm for propositional satisfiability publication-title: IEEE Transactions on Computers – year: 2003 ident: br0060 article-title: Knowledge Representation, Reasoning and Declarative Problem Solving – reference: series 3, in Delgrande and Faber (2011) – reference: , and – volume: vol. 3569 start-page: 61 year: 2005 end-page: 75 ident: br0330 article-title: Effective preprocessing in SAT through variable and clause elimination publication-title: Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SATʼ05) – reference: M. Mariën, J. Wittocx, M. Denecker, M. Bruynooghe, SAT(ID): Satisfiability of propositional logic extended with inductive definitions, in Kleine Büning and Zhao (2008) – reference: M. Gebser, B. Kaufmann, A. Neumann, T. Schaub, Conflict-driven answer set enumeration, in Baral et al. (2007) – volume: 135 start-page: 69 year: 1997 end-page: 112 ident: br0840 article-title: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation publication-title: Information and Computation – volume: 22 start-page: 319 year: 2004 end-page: 351 ident: br0090 article-title: Towards understanding and harnessing the potential of clause learning publication-title: Journal of Artificial Intelligence Research – start-page: 285 year: 2008 end-page: 316 ident: br0650 article-title: Answer sets publication-title: Handbook of Knowledge Representation – volume: 19 start-page: 155 year: 2006 end-page: 172 ident: br1120 article-title: A backjumping technique for disjunctive logic programming publication-title: AI Communications – volume: 53 start-page: 169 year: 2008 end-page: 204 ident: br0700 article-title: On the relation among answer set solvers publication-title: Annals of Mathematics and Artificial Intelligence – volume: 7 start-page: 201 year: 1960 end-page: 215 ident: br0250 article-title: A computing procedure for quantification theory publication-title: Journal of the ACM – volume: vol. 5759 start-page: 64 year: 2009 end-page: 72 ident: br1180 article-title: Experiences running a parallel answer set solver on Blue Gene publication-title: Proceedings of the Sixteenth European PVM/MPI Usersʼ Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (PVM/MPIʼ09) – volume: 11 start-page: 323 year: 2011 end-page: 360 ident: br0640 article-title: Detecting inconsistencies in large biological networks with answer set programming publication-title: Theory and Practice of Logic Programming – volume: 8 start-page: 691 year: 2008 end-page: 716 ident: br0790 article-title: Extended ASP tableaux and rule redundancy in normal logic programs publication-title: Theory and Practice of Logic Programming – volume: vol. 3662 year: 2005 ident: br0080 publication-title: Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMRʼ05) – reference: M. Gebser, M. Ostrowski, T. Schaub, Constraint answer set solving, in Hill and Warren (2009) – start-page: 1481 year: 2008 end-page: 1484 ident: br1080 article-title: A new clause learning scheme for efficient unsatisfiability proofs publication-title: Proceedings of the Twenty-Third National Conference on Artificial Intelligence (AAAIʼ08) – reference: M. Gebser, T. Schaub, Characterizing ASP inferences by unit propagation, in: E. Giunchiglia, V. Marek, D. Mitchell, E. Ternovska (Eds.), Proceedings of the First International Workshop on Search and Logic: Answer Set Programming and SAT (LaShʼ06), 2006, pp. 41–56. – year: 2003 ident: br0260 article-title: Constraint Processing – ident: br1200 article-title: Lparse 1.0 userʼs manual – reference: M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, B. Schnor, Cluster-based ASP solving with – volume: vol. 4501 year: 2007 ident: br0980 publication-title: Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SATʼ07) – start-page: 293 year: 1978 end-page: 322 ident: br0210 article-title: Negation as failure publication-title: Logic and Data Bases – ident: br0220 article-title: clasp – volume: 53 start-page: 313 year: 2008 end-page: 329 ident: br1030 article-title: Stable models and difference logic publication-title: Annals of Mathematics and Artificial Intelligence – volume: 89 year: 2003 ident: br0340 article-title: Temporal induction by incremental SAT solving publication-title: Electronic Notes in Theoretical Computer Science – reference: , – volume: 7 start-page: 261 year: 2006 end-page: 268 ident: br0880 article-title: Why are there so many loop formulas? publication-title: ACM Transactions on Computational Logic – start-page: 142 year: 2002 end-page: 149 ident: br0720 article-title: BerkMin: A fast and robust SAT solver publication-title: Proceedings of the Fifth Conference on Design, Automation and Test in Europe (DATEʼ02) – reference: Z. Lin, Y. Zhang, H. Hernandez, Fast SAT-based answer set solver, in Gil and Mooney (2006) – reference: M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, On the implementation of weight constraint rules in conflict-driven ASP solvers, in Hill and Warren (2009) – start-page: 530 year: 2001 end-page: 535 ident: br1010 article-title: Chaff: Engineering an efficient SAT solver publication-title: Proceedings of the Thirty-Eighth Conference on Design Automation (DACʼ01) – volume: 157 start-page: 115 year: 2004 end-page: 137 ident: br0900 article-title: ASSAT: Computing answer sets of a logic program by SAT solvers publication-title: Artificial Intelligence – volume: 4 start-page: 75 year: 2008 end-page: 97 ident: br0110 article-title: PicoSAT essentials publication-title: Journal on Satisfiability, Boolean Modeling and Computation – reference: G. Boenn, M. Brain, M. De Vos, J. Fitch, Automatic composition of melodic and harmonic music by answer set programming, in Garcia de la Banda and Pontelli (2008) – reference: C. Anger, M. Gebser, T. Schaub, Approaching the core of unfounded sets, in: J. Dix, A. Hunter (Eds.), Proceedings of the Eleventh International Workshop on Nonmonotonic Reasoning (NMRʼ06), number IFI-06-04, Institute for Informatics, Clausthal University of Technology, Technical Report Series, 2006, pp. 58–66. – volume: 138 start-page: 39 year: 2002 end-page: 54 ident: br0870 article-title: Answer set programming and plan generation publication-title: Artificial Intelligence – volume: 36 start-page: 345 year: 2006 end-page: 377 ident: br0710 article-title: Answer set programming based on propositional satisfiability publication-title: Journal of Automated Reasoning – volume: 16 start-page: 35 year: 2006 end-page: 86 ident: br0760 article-title: Some (in)translatability results for normal logic programs and propositional theories publication-title: Journal of Applied Non-Classical Logics – reference: , in Delgrande and Faber (2011) – volume: 138 start-page: 3 year: 2002 end-page: 38 ident: br0660 article-title: Logic programming and knowledge representation — The A-Prolog perspective publication-title: Artificial Intelligence – reference: K. Pipatsrisawat, A. Darwiche, A lightweight component caching scheme for satisfiability solvers, in Marques-Silva and Sakallah (2007) – reference: M. Denecker, J. Vennekens, S. Bond, M. Gebser, M. Truszczyński, The second answer set programming competition, in Erdem et al. (2009) – volume: vol. 4483 year: 2007 ident: br0070 publication-title: Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMRʼ07) – reference: M. Gebser, R. Kaminski, A. König, T. Schaub, Advances in – volume: 38 start-page: 620 year: 1991 end-page: 650 ident: br1240 article-title: The well-founded semantics for general logic programs publication-title: Journal of the ACM – volume: vol. 2923 start-page: 302 year: 2004 end-page: 313 ident: br1260 article-title: Answer set programming with clause learning publication-title: Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMRʼ04) – reference: M. Thielscher, Answer set programming for single-player games in general game playing, in Hill and Warren (2009) – volume: vol. 5649 year: 2009 ident: br0730 publication-title: Proceedings of the Twenty-Fifth International Conference on Logic Programming (ICLPʼ09) – reference: L. Ryan, Efficient algorithms for clause-learning SAT solvers, Masterʼs thesis, Simon Fraser University, 2004. – volume: vol. 185 start-page: 613 year: 2009 end-page: 631 ident: br0850 article-title: MaxSAT publication-title: Handbook of Satisfiability – reference: L. Zhang, C. Madigan, M. Moskewicz, S. Malik, Efficient conflict driven learning in a Boolean satisfiability solver, in: Proceedings of the International Conference on Computer-Aided Design (ICCADʼ01), 2001, pp. 279–285. – volume: 7 start-page: 499 year: 2006 end-page: 562 ident: br0830 article-title: The DLV system for knowledge representation and reasoning publication-title: ACM Transactions on Computational Logic – start-page: 89 year: 1987 end-page: 148 ident: br0030 article-title: Towards a theory of declarative knowledge publication-title: Foundations of Deductive Databases and Logic Programming – reference: M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, S. Thiele, Engineering an incremental ASP solver, in Garcia de la Banda and Pontelli (2008) – start-page: 503 year: 2005 end-page: 508 ident: br0820 article-title: A model-theoretic counterpart of loop formulas publication-title: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAIʼ05) – start-page: 115 year: 1970 end-page: 125 ident: br1230 article-title: On the complexity of derivation in propositional calculus publication-title: Structures in Constructive Mathematics and Mathematical Logic, part 2 – volume: vol. 6645 year: 2011 ident: br0270 publication-title: Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMRʼ11) – volume: vol. 11 start-page: 1 year: 2011 end-page: 10 ident: br0480 article-title: Multi-criteria optimization in answer set programming publication-title: Technical Communications of the Twenty-Seventh International Conference on Logic Programming (ICLPʼ11) – volume: vol. 3835 start-page: 95 year: 2005 end-page: 109 ident: br0010 article-title: The nomore++ approach to answer set solving publication-title: Proceedings of the Twelfth International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPARʼ05) – volume: 71 start-page: 183 year: 2006 end-page: 214 ident: br0170 article-title: Pruning operators for disjunctive logic programming systems publication-title: Fundamenta Informaticae – reference: X. Chen, J. Ji, F. Lin, Computing loops with at most one external support rule for disjunctive logic programs, in Erdem et al. (2009) – volume: vol. 185 start-page: 825 year: 2009 end-page: 885 ident: br0100 article-title: Satisfiability modulo theories publication-title: Handbook of Satisfiability – year: 2006 ident: br1130 publication-title: Handbook of Constraint Programming – volume: vol. 185 start-page: 695 year: 2009 end-page: 733 ident: br1140 article-title: Pseudo-Boolean and cardinality constraints publication-title: Handbook of Satisfiability – volume: vol. 4996 year: 2008 ident: br0810 publication-title: Proceedings of the Eleventh International Conference on Theory and Applications of Satisfiability Testing (SATʼ08) – volume: vol. 1216 start-page: 57 year: 1996 end-page: 70 ident: br1060 article-title: A new logical characterisation of stable models and answer sets publication-title: Proceedings of the Sixth Workshop on Non-Monotonic Extensions of Logic Programming (NMELPʼ96) – start-page: 1070 year: 1988 end-page: 1080 ident: br0670 article-title: The stable model semantics for logic programming publication-title: Proceedings of the Fifth International Conference and Symposium on Logic Programming (ICLPʼ88) – volume: 103 start-page: 365 year: 1992 end-page: 386 ident: br0930 article-title: The relationship between stable, supported, default and autoepistemic semantics for general logic programs publication-title: Theoretical Computer Science – year: 2009 ident: br0750 article-title: Answer set vs integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs publication-title: Journal of Reconfigurable Computing – volume: 175 start-page: 278 year: 2011 end-page: 298 ident: br0390 article-title: Semantics and complexity of recursive aggregates in answer set programming publication-title: Artificial Intelligence – volume: 9 start-page: 365 year: 1991 end-page: 385 ident: br0680 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Generation Computing – year: 2006 ident: br0690 publication-title: Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAIʼ06) – volume: 25 start-page: 369 year: 1999 end-page: 389 ident: br0890 article-title: Nested expressions in logic programs publication-title: Annals of Mathematics and Artificial Intelligence – reference: K. Claessen, N. Sörensson, New techniques that improve MACE-style finite model finding, in: P. Baumgartner, C. Fermüller (Eds.), Proceedings of the Workshop on Model Computation — Principles, Algorithms, Applications (MODELʼ03), 2003. – volume: 53 start-page: 937 year: 2006 end-page: 977 ident: br1040 article-title: Solving SAT and SAT modulo theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T) publication-title: Journal of the ACM – volume: 5 start-page: 394 year: 1962 end-page: 397 ident: br0240 article-title: A machine program for theorem-proving publication-title: Communications of the ACM – reference: M. Gebser, J. Lee, Y. Lierler, Elementary sets for logic programs, in Gil and Mooney (2006) – reference: T. Janhunen, I. Niemelä, M. Sevalnev, Computing stable models via reductions to difference logic, in Erdem et al. (2009) – volume: vol. 5547 start-page: 71 year: 2009 end-page: 86 ident: br0570 article-title: Solution enumeration for projected Boolean search problems publication-title: Proceedings of the Sixth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIORʼ09) – year: 2007 ident: br1250 publication-title: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAIʼ07) – volume: 138 start-page: 181 year: 2002 end-page: 234 ident: br1190 article-title: Extending and implementing the stable model semantics publication-title: Artificial Intelligence – reference: T. Kim, J. Lee, R. Palla, Circumscriptive event calculus as answer set programming, in Boutilier (2009) – volume: vol. 6565 start-page: 111 year: 2011 end-page: 130 ident: br0770 article-title: Compact translations of non-disjunctive answer set programs to propositional clauses publication-title: Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday – volume: 25 start-page: 241 year: 1999 end-page: 273 ident: br1020 article-title: Logic programs with stable model semantics as a constraint programming paradigm publication-title: Annals of Mathematics and Artificial Intelligence – volume: 85 start-page: 112 year: 2005 end-page: 133 ident: br1000 article-title: A SAT solver primer publication-title: Bulletin of the European Association for Theoretical Computer Science – reference: M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, S. Thiele, A userʼs guide to – start-page: 10880 year: 2003 end-page: 10885 ident: br1280 article-title: Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications publication-title: Proceedings of the Sixth Conference on Design, Automation and Test in Europe (DATEʼ03) – volume: 24 start-page: 105 year: 2011 end-page: 124 ident: br0440 article-title: Potassco: The Potsdam answer set solving collection publication-title: AI Communications – reference: J. Huang, The effect of restarts on the efficiency of clause learning, in Veloso (2007) – volume: 2 start-page: 1 year: 2006 end-page: 26 ident: br0360 article-title: Translating pseudo-Boolean constraints into SAT publication-title: Journal on Satisfiability, Boolean Modeling and Computation – volume: 1 start-page: 146 year: 1972 end-page: 160 ident: br1210 article-title: Depth-first search and linear graph algorithms publication-title: SIAM Journal on Computing – reference: X. Chen, J. Ji, F. Lin, Computing loops with at most one external support rule, in Brewka and Lang (2008) – reference: V. Ryvchin, O. Strichman, Local restarts, in Kleine Büning and Zhao (2008) – year: 2009 ident: br0140 publication-title: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAIʼ09) – volume: vol. 185 start-page: 131 year: 2009 end-page: 153 ident: br0960 article-title: Conflict-driven clause learning SAT solvers publication-title: Handbook of Satisfiability – volume: vol. 185 start-page: 99 year: 2009 end-page: 130 ident: br0230 article-title: Complete algorithms publication-title: Handbook of Satisfiability – volume: 47 start-page: 173 year: 1993 end-page: 180 ident: br0920 article-title: Optimal speedup of Las Vegas algorithms publication-title: Information Processing Letters – volume: 1 start-page: 267 year: 1984 end-page: 284 ident: br0300 article-title: Linear-time algorithms for testing the satisfiability of propositional Horn formulae publication-title: Journal of Logic Programming – volume: 11 start-page: 135 year: 2011 end-page: 169 ident: br0860 article-title: Abstract answer set solvers with learning publication-title: Theory and Practice of Logic Programming – reference: A. Mileo, D. Merico, R. Bisiani, A logic programming approach to home monitoring for risk prevention in assisted living, in Garcia de la Banda and Pontelli (2008) – volume: 51 start-page: 64 year: 1995 end-page: 86 ident: br1170 article-title: The expressive powers of the logic programming semantics publication-title: Journal of Computer and System Sciences – volume: vol. 4079 start-page: 11 year: 2006 end-page: 25 ident: br0630 article-title: Tableau calculi for answer set programming publication-title: Proceedings of the Twenty-Second International Conference on Logic Programming (ICLPʼ06) – volume: 1 start-page: 51 year: 1994 end-page: 60 ident: br0400 article-title: Consistency of Clarkʼs completion and the existence of stable models publication-title: Journal of Methods of Logic in Computer Science – reference: M. Gebser, B. Kaufmann, A. Neumann, T. Schaub, clasp: A conflict-driven answer set solver, in Baral et al. (2007) – volume: vol. 185 year: 2009 ident: br0120 publication-title: Handbook of Satisfiability – reference: N. Eén, N. Sörensson, An extensible SAT-solver, in: Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SATʼ03), 2003, pp. 502–518. – volume: 175 start-page: 512 year: 2011 end-page: 525 ident: br1090 article-title: On the power of clause-learning SAT solvers as resolution engines publication-title: Artificial Intelligence – reference: N. Dershowitz, Z. Hanna, A. Nadel, Towards a better understanding of the functionality of a conflict-driven SAT solver, in Marques-Silva and Sakallah (2007) – ident: br1100 – reference: G. Audemard, L. Simon, Predicting learnt clauses quality in modern SAT solvers, in Boutilier (2009) – volume: vol. 5753 year: 2009 ident: br0380 publication-title: Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMRʼ09) – reference: M. Gebser, B. Kaufmann, A. Neumann, T. Schaub, Conflict-driven answer set solving, in Veloso (2007) – reference: , available at: – reference: P. Ferraris, Answer sets for propositional theories, in Baral et al. (2005) – start-page: 15 year: 2008 end-page: 19 ident: br0550 article-title: Advanced preprocessing for answer set solving publication-title: Proceedings of the Eighteenth European Conference on Artificial Intelligence (ECAIʼ08) – reference: . – reference: M. Gebser, B. Kaufmann, T. Schaub, The conflict-driven answer set solver clasp: Progress report, in Erdem et al. (2009) – reference: M. Gebser, T. Schaub, Loops: Relevant or redundant?, in Baral et al. (2005) – volume: 51 start-page: 195 year: 2007 end-page: 228 ident: br1050 article-title: Enhancing DLV instantiator by backjumping techniques publication-title: Annals of Mathematics and Artificial Intelligence – year: 2003 ident: br0050 article-title: Computing answer sets using program completion – volume: vol. 5366 year: 2008 ident: br0430 publication-title: Proceedings of the Twenty-Fourth International Conference on Logic Programming (ICLPʼ08) – year: 2008 ident: br0160 publication-title: Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KRʼ08) – reference: E. Ellguth, M. Gebser, M. Gusowski, R. Kaminski, B. Kaufmann, S. Liske, T. Schaub, L. Schneidenbach, B. Schnor, A simple distributed conflict-driven answer set solver, in Erdem et al. (2009) – start-page: 375 year: 1999 end-page: 398 ident: br0940 article-title: Stable models and an alternative logic programming paradigm publication-title: The Logic Programming Paradigm: A 25-Year Perspective – volume: 19 start-page: 615 year: 2009 end-page: 641 ident: br0150 article-title: The significance of memory costs in answer set solver implementation publication-title: Journal of Logic and Computation – ident: 10.1016/j.artint.2012.04.001_br0620 – ident: 10.1016/j.artint.2012.04.001_br0540 – volume: 25 start-page: 369 issue: 3–4 year: 1999 ident: 10.1016/j.artint.2012.04.001_br0890 article-title: Nested expressions in logic programs publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1023/A:1018978005636 – volume: vol. 3835 start-page: 95 year: 2005 ident: 10.1016/j.artint.2012.04.001_br0010 article-title: The nomore++ approach to answer set solving – ident: 10.1016/j.artint.2012.04.001_br1270 – year: 2009 ident: 10.1016/j.artint.2012.04.001_br0750 article-title: Answer set vs integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs publication-title: Journal of Reconfigurable Computing doi: 10.1155/2009/863630 – ident: 10.1016/j.artint.2012.04.001_br0520 – volume: vol. 4501 year: 2007 ident: 10.1016/j.artint.2012.04.001_br0980 – start-page: 10880 year: 2003 ident: 10.1016/j.artint.2012.04.001_br1280 article-title: Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications – volume: 157 start-page: 115 issue: 1–2 year: 2004 ident: 10.1016/j.artint.2012.04.001_br0900 article-title: ASSAT: Computing answer sets of a logic program by SAT solvers publication-title: Artificial Intelligence doi: 10.1016/j.artint.2004.04.004 – volume: 11 start-page: 135 issue: 2–3 year: 2011 ident: 10.1016/j.artint.2012.04.001_br0860 article-title: Abstract answer set solvers with learning publication-title: Theory and Practice of Logic Programming doi: 10.1017/S1471068410000578 – volume: 10 start-page: 76 year: 1970 ident: 10.1016/j.artint.2012.04.001_br1110 article-title: A transitive closure algorithm publication-title: BIT Numerical Mathematics doi: 10.1007/BF01940892 – year: 2006 ident: 10.1016/j.artint.2012.04.001_br1130 – ident: 10.1016/j.artint.2012.04.001_br0290 doi: 10.1007/978-3-540-72788-0_27 – volume: 103 start-page: 365 issue: 2 year: 1992 ident: 10.1016/j.artint.2012.04.001_br0930 article-title: The relationship between stable, supported, default and autoepistemic semantics for general logic programs publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(92)90019-C – volume: 53 start-page: 169 issue: 1–4 year: 2008 ident: 10.1016/j.artint.2012.04.001_br0700 article-title: On the relation among answer set solvers publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1007/s10472-009-9113-1 – volume: vol. 185 start-page: 613 year: 2009 ident: 10.1016/j.artint.2012.04.001_br0850 article-title: MaxSAT – ident: 10.1016/j.artint.2012.04.001_br0420 – volume: 9 start-page: 365 year: 1991 ident: 10.1016/j.artint.2012.04.001_br0680 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Generation Computing doi: 10.1007/BF03037169 – volume: 1 start-page: 146 issue: 2 year: 1972 ident: 10.1016/j.artint.2012.04.001_br1210 article-title: Depth-first search and linear graph algorithms publication-title: SIAM Journal on Computing doi: 10.1137/0201010 – volume: vol. 185 start-page: 695 year: 2009 ident: 10.1016/j.artint.2012.04.001_br1140 article-title: Pseudo-Boolean and cardinality constraints – volume: vol. 11 start-page: 1 year: 2011 ident: 10.1016/j.artint.2012.04.001_br0480 article-title: Multi-criteria optimization in answer set programming – volume: vol. 4996 year: 2008 ident: 10.1016/j.artint.2012.04.001_br0810 – volume: vol. 4079 start-page: 11 year: 2006 ident: 10.1016/j.artint.2012.04.001_br0630 article-title: Tableau calculi for answer set programming – volume: vol. 5759 start-page: 64 year: 2009 ident: 10.1016/j.artint.2012.04.001_br1180 article-title: Experiences running a parallel answer set solver on Blue Gene – volume: 7 start-page: 201 year: 1960 ident: 10.1016/j.artint.2012.04.001_br0250 article-title: A computing procedure for quantification theory publication-title: Journal of the ACM doi: 10.1145/321033.321034 – volume: vol. 185 start-page: 99 year: 2009 ident: 10.1016/j.artint.2012.04.001_br0230 article-title: Complete algorithms – volume: vol. 3569 start-page: 61 year: 2005 ident: 10.1016/j.artint.2012.04.001_br0330 article-title: Effective preprocessing in SAT through variable and clause elimination – volume: 138 start-page: 181 issue: 1–2 year: 2002 ident: 10.1016/j.artint.2012.04.001_br1190 article-title: Extending and implementing the stable model semantics publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(02)00187-X – volume: 19 start-page: 615 issue: 4 year: 2009 ident: 10.1016/j.artint.2012.04.001_br0150 article-title: The significance of memory costs in answer set solver implementation publication-title: Journal of Logic and Computation doi: 10.1093/logcom/exn038 – volume: vol. 5649 year: 2009 ident: 10.1016/j.artint.2012.04.001_br0730 – year: 2009 ident: 10.1016/j.artint.2012.04.001_br0140 – volume: vol. 185 year: 2009 ident: 10.1016/j.artint.2012.04.001_br0120 – volume: 1 start-page: 267 year: 1984 ident: 10.1016/j.artint.2012.04.001_br0300 article-title: Linear-time algorithms for testing the satisfiability of propositional Horn formulae publication-title: Journal of Logic Programming doi: 10.1016/0743-1066(84)90014-1 – ident: 10.1016/j.artint.2012.04.001_br0280 doi: 10.1007/978-3-642-04238-6_75 – volume: vol. 3662 year: 2005 ident: 10.1016/j.artint.2012.04.001_br0080 – ident: 10.1016/j.artint.2012.04.001_br0310 – ident: 10.1016/j.artint.2012.04.001_br0740 – ident: 10.1016/j.artint.2012.04.001_br0910 – start-page: 285 year: 2008 ident: 10.1016/j.artint.2012.04.001_br0650 article-title: Answer sets – start-page: 1481 year: 2008 ident: 10.1016/j.artint.2012.04.001_br1080 article-title: A new clause learning scheme for efficient unsatisfiability proofs – volume: vol. 6565 start-page: 111 year: 2011 ident: 10.1016/j.artint.2012.04.001_br0770 article-title: Compact translations of non-disjunctive answer set programs to propositional clauses – ident: 10.1016/j.artint.2012.04.001_br0600 doi: 10.1007/978-3-642-02846-5_22 – volume: 175 start-page: 512 issue: 2 year: 2011 ident: 10.1016/j.artint.2012.04.001_br1090 article-title: On the power of clause-learning SAT solvers as resolution engines publication-title: Artificial Intelligence doi: 10.1016/j.artint.2010.10.002 – volume: vol. 5366 year: 2008 ident: 10.1016/j.artint.2012.04.001_br0430 – start-page: 142 year: 2002 ident: 10.1016/j.artint.2012.04.001_br0720 article-title: BerkMin: A fast and robust SAT solver – volume: vol. 5753 year: 2009 ident: 10.1016/j.artint.2012.04.001_br0380 – start-page: 15 year: 2008 ident: 10.1016/j.artint.2012.04.001_br0550 article-title: Advanced preprocessing for answer set solving – ident: 10.1016/j.artint.2012.04.001_br0560 doi: 10.1007/978-3-642-04238-6_50 – ident: 10.1016/j.artint.2012.04.001_br0500 doi: 10.1007/978-3-642-20895-9_42 – ident: 10.1016/j.artint.2012.04.001_br0510 doi: 10.1007/978-3-642-20895-9_39 – ident: 10.1016/j.artint.2012.04.001_br0410 doi: 10.1007/11546207_10 – volume: 16 start-page: 35 issue: 1–2 year: 2006 ident: 10.1016/j.artint.2012.04.001_br0760 article-title: Some (in)translatability results for normal logic programs and propositional theories publication-title: Journal of Applied Non-Classical Logics doi: 10.3166/jancl.16.35-86 – volume: 138 start-page: 39 issue: 1–2 year: 2002 ident: 10.1016/j.artint.2012.04.001_br0870 article-title: Answer set programming and plan generation publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(02)00186-8 – ident: 10.1016/j.artint.2012.04.001_br0950 – start-page: 89 year: 1987 ident: 10.1016/j.artint.2012.04.001_br0030 article-title: Towards a theory of declarative knowledge – ident: 10.1016/j.artint.2012.04.001_br0800 – volume: 7 start-page: 261 issue: 2 year: 2006 ident: 10.1016/j.artint.2012.04.001_br0880 article-title: Why are there so many loop formulas? publication-title: ACM Transactions on Computational Logic doi: 10.1145/1131313.1131316 – year: 2003 ident: 10.1016/j.artint.2012.04.001_br0060 – volume: vol. 1216 start-page: 57 year: 1996 ident: 10.1016/j.artint.2012.04.001_br1060 article-title: A new logical characterisation of stable models and answer sets – volume: 4 start-page: 75 year: 2008 ident: 10.1016/j.artint.2012.04.001_br0110 article-title: PicoSAT essentials publication-title: Journal on Satisfiability, Boolean Modeling and Computation doi: 10.3233/SAT190039 – ident: 10.1016/j.artint.2012.04.001_br0130 doi: 10.1007/978-3-540-89982-2_21 – volume: 71 start-page: 183 issue: 2–3 year: 2006 ident: 10.1016/j.artint.2012.04.001_br0170 article-title: Pruning operators for disjunctive logic programming systems publication-title: Fundamenta Informaticae – ident: 10.1016/j.artint.2012.04.001_br0590 – ident: 10.1016/j.artint.2012.04.001_br0200 – volume: 89 issue: 4 year: 2003 ident: 10.1016/j.artint.2012.04.001_br0340 article-title: Temporal induction by incremental SAT solving publication-title: Electronic Notes in Theoretical Computer Science doi: 10.1016/S1571-0661(05)82542-3 – year: 2003 ident: 10.1016/j.artint.2012.04.001_br0260 – ident: 10.1016/j.artint.2012.04.001_br0020 – volume: 24 start-page: 105 issue: 2 year: 2011 ident: 10.1016/j.artint.2012.04.001_br0440 article-title: Potassco: The Potsdam answer set solving collection publication-title: AI Communications doi: 10.3233/AIC-2011-0491 – year: 2008 ident: 10.1016/j.artint.2012.04.001_br0160 – ident: 10.1016/j.artint.2012.04.001_br0180 doi: 10.1007/978-3-642-02846-5_15 – ident: 10.1016/j.artint.2012.04.001_br0450 – volume: 48 start-page: 506 issue: 5 year: 1999 ident: 10.1016/j.artint.2012.04.001_br0970 article-title: GRASP: A search algorithm for propositional satisfiability publication-title: IEEE Transactions on Computers doi: 10.1109/12.769433 – start-page: 1070 year: 1988 ident: 10.1016/j.artint.2012.04.001_br0670 article-title: The stable model semantics for logic programming – volume: 22 start-page: 319 year: 2004 ident: 10.1016/j.artint.2012.04.001_br0090 article-title: Towards understanding and harnessing the potential of clause learning publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.1410 – volume: 175 start-page: 278 issue: 1 year: 2011 ident: 10.1016/j.artint.2012.04.001_br0390 article-title: Semantics and complexity of recursive aggregates in answer set programming publication-title: Artificial Intelligence doi: 10.1016/j.artint.2010.04.002 – ident: 10.1016/j.artint.2012.04.001_br0530 – volume: vol. 185 start-page: 825 year: 2009 ident: 10.1016/j.artint.2012.04.001_br0100 article-title: Satisfiability modulo theories – ident: 10.1016/j.artint.2012.04.001_br0490 doi: 10.1007/978-3-642-20895-9_40 – volume: vol. 185 start-page: 131 year: 2009 ident: 10.1016/j.artint.2012.04.001_br0960 article-title: Conflict-driven clause learning SAT solvers – year: 2006 ident: 10.1016/j.artint.2012.04.001_br0690 – start-page: 375 year: 1999 ident: 10.1016/j.artint.2012.04.001_br0940 article-title: Stable models and an alternative logic programming paradigm – ident: 10.1016/j.artint.2012.04.001_br0470 doi: 10.1007/978-3-642-02846-5_23 – volume: 19 start-page: 155 issue: 2 year: 2006 ident: 10.1016/j.artint.2012.04.001_br1120 article-title: A backjumping technique for disjunctive logic programming publication-title: AI Communications – ident: 10.1016/j.artint.2012.04.001_br0780 doi: 10.1007/978-3-642-04238-6_14 – ident: 10.1016/j.artint.2012.04.001_br0350 doi: 10.1007/978-3-540-24605-3_37 – ident: 10.1016/j.artint.2012.04.001_br1160 – ident: 10.1016/j.artint.2012.04.001_br1100 – ident: 10.1016/j.artint.2012.04.001_br1220 doi: 10.1007/978-3-642-02846-5_28 – volume: 8 start-page: 691 issue: 5–6 year: 2008 ident: 10.1016/j.artint.2012.04.001_br0790 article-title: Extended ASP tableaux and rule redundancy in normal logic programs publication-title: Theory and Practice of Logic Programming doi: 10.1017/S1471068408003578 – volume: 7 start-page: 499 issue: 3 year: 2006 ident: 10.1016/j.artint.2012.04.001_br0830 article-title: The DLV system for knowledge representation and reasoning publication-title: ACM Transactions on Computational Logic doi: 10.1145/1149114.1149117 – start-page: 115 year: 1970 ident: 10.1016/j.artint.2012.04.001_br1230 article-title: On the complexity of derivation in propositional calculus – volume: 53 start-page: 937 issue: 6 year: 2006 ident: 10.1016/j.artint.2012.04.001_br1040 article-title: Solving SAT and SAT modulo theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T) publication-title: Journal of the ACM doi: 10.1145/1217856.1217859 – year: 2007 ident: 10.1016/j.artint.2012.04.001_br1250 – volume: 11 start-page: 323 issue: 2–3 year: 2011 ident: 10.1016/j.artint.2012.04.001_br0640 article-title: Detecting inconsistencies in large biological networks with answer set programming publication-title: Theory and Practice of Logic Programming doi: 10.1017/S1471068410000554 – volume: 5 start-page: 394 year: 1962 ident: 10.1016/j.artint.2012.04.001_br0240 article-title: A machine program for theorem-proving publication-title: Communications of the ACM doi: 10.1145/368273.368557 – volume: vol. 2923 start-page: 302 year: 2004 ident: 10.1016/j.artint.2012.04.001_br1260 article-title: Answer set programming with clause learning – start-page: 503 year: 2005 ident: 10.1016/j.artint.2012.04.001_br0820 article-title: A model-theoretic counterpart of loop formulas – ident: 10.1016/j.artint.2012.04.001_br0190 doi: 10.1007/978-3-642-02846-5_15 – ident: 10.1016/j.artint.2012.04.001_br0580 – volume: vol. 6645 year: 2011 ident: 10.1016/j.artint.2012.04.001_br0270 – start-page: 530 year: 2001 ident: 10.1016/j.artint.2012.04.001_br1010 article-title: Chaff: Engineering an efficient SAT solver – volume: vol. 5547 start-page: 71 year: 2009 ident: 10.1016/j.artint.2012.04.001_br0570 article-title: Solution enumeration for projected Boolean search problems – volume: 38 start-page: 620 issue: 3 year: 1991 ident: 10.1016/j.artint.2012.04.001_br1240 article-title: The well-founded semantics for general logic programs publication-title: Journal of the ACM doi: 10.1145/116825.116838 – ident: 10.1016/j.artint.2012.04.001_br0320 – start-page: 293 year: 1978 ident: 10.1016/j.artint.2012.04.001_br0210 article-title: Negation as failure – volume: 138 start-page: 3 issue: 1–2 year: 2002 ident: 10.1016/j.artint.2012.04.001_br0660 article-title: Logic programming and knowledge representation — The A-Prolog perspective publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(02)00207-2 – volume: 85 start-page: 112 year: 2005 ident: 10.1016/j.artint.2012.04.001_br1000 article-title: A SAT solver primer publication-title: Bulletin of the European Association for Theoretical Computer Science – volume: 51 start-page: 64 year: 1995 ident: 10.1016/j.artint.2012.04.001_br1170 article-title: The expressive powers of the logic programming semantics publication-title: Journal of Computer and System Sciences doi: 10.1006/jcss.1995.1053 – volume: 51 start-page: 195 issue: 2–4 year: 2007 ident: 10.1016/j.artint.2012.04.001_br1050 article-title: Enhancing DLV instantiator by backjumping techniques publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1007/s10472-008-9090-9 – ident: 10.1016/j.artint.2012.04.001_br0370 doi: 10.1007/978-3-642-04238-6_47 – volume: 1 start-page: 51 year: 1994 ident: 10.1016/j.artint.2012.04.001_br0400 article-title: Consistency of Clarkʼs completion and the existence of stable models publication-title: Journal of Methods of Logic in Computer Science – volume: 2 start-page: 1 year: 2006 ident: 10.1016/j.artint.2012.04.001_br0360 article-title: Translating pseudo-Boolean constraints into SAT publication-title: Journal on Satisfiability, Boolean Modeling and Computation doi: 10.3233/SAT190014 – ident: 10.1016/j.artint.2012.04.001_br0050 – ident: 10.1016/j.artint.2012.04.001_br1150 – ident: 10.1016/j.artint.2012.04.001_br1070 – volume: vol. 4483 year: 2007 ident: 10.1016/j.artint.2012.04.001_br0070 – ident: 10.1016/j.artint.2012.04.001_br0460 doi: 10.1007/978-3-540-89982-2_23 – volume: 47 start-page: 173 issue: 4 year: 1993 ident: 10.1016/j.artint.2012.04.001_br0920 article-title: Optimal speedup of Las Vegas algorithms publication-title: Information Processing Letters doi: 10.1016/0020-0190(93)90029-9 – ident: 10.1016/j.artint.2012.04.001_br0040 – volume: 135 start-page: 69 issue: 2 year: 1997 ident: 10.1016/j.artint.2012.04.001_br0840 article-title: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation publication-title: Information and Computation doi: 10.1006/inco.1997.2630 – ident: 10.1016/j.artint.2012.04.001_br0990 doi: 10.1007/978-3-540-89982-2_20 – ident: 10.1016/j.artint.2012.04.001_br0610 doi: 10.1007/11546207_5 – volume: 36 start-page: 345 issue: 4 year: 2006 ident: 10.1016/j.artint.2012.04.001_br0710 article-title: Answer set programming based on propositional satisfiability publication-title: Journal of Automated Reasoning doi: 10.1007/s10817-006-9033-2 – volume: 53 start-page: 313 issue: 1–4 year: 2008 ident: 10.1016/j.artint.2012.04.001_br1030 article-title: Stable models and difference logic publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1007/s10472-009-9118-9 – volume: 25 start-page: 241 issue: 3–4 year: 1999 ident: 10.1016/j.artint.2012.04.001_br1020 article-title: Logic programs with stable model semantics as a constraint programming paradigm publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1023/A:1018930122475 – ident: 10.1016/j.artint.2012.04.001_br1200
SSID	ssj0003991
Score	2.547955
Snippet	We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to...
SourceID	proquest pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	52
SubjectTerms	Algorithms Answer set programming Applied sciences Artificial intelligence Computation Computer science; control theory; systems Exact sciences and technology Expert systems Learning and adaptive systems Logic programming Logical, boolean and switching functions Nonmonotonic reasoning Programming Solvers Theoretical computing Versatility
Title	Conflict-driven answer set solving: From theory to practice
URI	https://dx.doi.org/10.1016/j.artint.2012.04.001 https://www.proquest.com/docview/1671341553
Volume	187-188
WOSCitedRecordID	wos000305598200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: ScienceDirect customDbUrl: eissn: 1872-7921 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLag4wFp4o4ol8lIiJfJKEkd24GnMrUCNBUkMqlvlhM7GhVLuyad9vM5ju10bKCNB16iNk3qyOfknM8-lw-hN0IUZUorQXg5igjVWpFCME0qHcewkEsirR3ZBJ_NxHyeffMcm01HJ8DrWpyfZ6v_Kmo4B8K2pbP_IO7-T-EEfAahwxHEDscbCf7AF3oQvbaWbB98kU2Eb0y7DwOf-QLnqS8rsSF2gJ-hWOoiVh2vuzyijtXjQuPOPmPHFI2Tt2tF0JtutalOPPXyR1Mv1Mn2t-_lsdp0EaB8CbDTl6H5TQebvSHCpkMwpBRsU3TJkHISO5I-bw5dc9rgWLM_mmy3e7B41z2qzW61u7O2pXm8dVEhLD_7KqdHh4cyn8zzt6tTYsnDbJDdM6ncRjsJTzMxQDvjz5P5l94lAwrz1InuqUMNZZfod3Xgv2GU3ZVq4M2pHOXJFe_dQZL8Abrn1xJ47HTgIbpl6kfofuDpwN5sP0YfLqkEdiqBQSWwV4n32CoEdgqB2yUOCvEEHU0n-cEn4kkzSAnItyUqilWWMMU4T3WkY1ZRrktu0kzxwnCuFBMJLRlTsNYtFY2SKumizRav6KwaPUWDelmbZwinvEioYEwXNKN6JIqC8YjCNy5SAJ56iEZhmmTpO8pbYpOfMqQOLqSbXGknV0bUZlAOEenvWrmOKtdcz4MEpEeFDu1J0KBr7tz7TWD9cIklJchYOkSvgwQlWFUbKlO1WW4aGTNbY205tZ7f4JoX6O72JXmJBu16Y16hO-VZ-6NZ73ll_AVHFpoq
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Conflict-driven+answer+set+solving%3A+From+theory+to+practice&rft.jtitle=Artificial+intelligence&rft.au=Gebser%2C+Martin&rft.au=Kaufmann%2C+Benjamin&rft.au=Schaub%2C+Torsten&rft.date=2012-08-01&rft.issn=0004-3702&rft.volume=187-188&rft.spage=52&rft.epage=89&rft_id=info:doi/10.1016%2Fj.artint.2012.04.001&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon