Access the full text.
Sign up today, get DeepDyve free for 14 days.
T. Janhunen (2004)
Representing Normal Programs with Clauses
Jianer Chen, Iyad Kanj, Ge Xia (2006)
Improved Parameterized Upper Bounds for Vertex Cover
Thomas Eiter, Michael Fink, H. Tompits, S. Woltran (2004)
On Eliminating Disjunctions in Stable Logic Programming
Francesco Calimeri, Giovambattista Ianni, F. Ricca, Mario Alviano, Annamaria Bria, Gelsomina Catalano, Susanna Cozza, Wolfgang Faber, Onofrio Febbraro, N. Leone, M. Manna, Alessandra Martello, Claudio Panetta, S. Perri, Kristian Reale, M. Santoro, M. Sirianni, G. Terracina, P. Veltri (2011)
The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track
Francesco Calimeri, Giovambattista Ianni, F. Ricca (2012)
The third open answer set programming competitionTheory and Practice of Logic Programming, 14
C. Gomes, Henry Kautz, Ashish Sabharwal, B. Selman
Handbook of Knowledge Representation Edited Satisfiability Solvers
Morris Green (1954)
WHO Technical ReportThe Yale Journal of Biology and Medicine, 26
A. Ayari, D. Basin (2000)
Bounded Model Construction for Monadic Second-Order Logics
(2012)
Backdoors to tractable answerset programming Extended and updated version of a paper that
Florian Lonsing, Armin Biere (2010)
DepQBF: A Dependency-Aware QBF Solver (System Description)
(2006)
Jörg Flum and Martin Grohe. Parameterized Complexity Theory, volume XIV of Theoret
Joohyung Lee (2005)
A Model-Theoretic Counterpart of Loop Formulas
G. Gottlob, Stefan Szeider (2007)
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database ProblemsComput. J., 51
N. Leone, G. Pfeifer, Wolfgang Faber, Thomas Eiter, G. Gottlob, S. Perri, Francesco Scarcello (2002)
The DLV system for knowledge representation and reasoningACM Trans. Comput. Log., 7
J. Siekmann, G. Wrightson (2012)
Automation of reasoning--classical papers on computational logic
Article 7, Publication date: October 2015. Backdoors to Normality for Disjunctive Logic Programs
Clark Barrett, R. Sebastiani, S. Seshia, C. Tinelli (2021)
Handbook of Satisfiability, 336
L. Fortnow, Steven Homer (2009)
Computational Complexity
M. Emden, R. Kowalski (1976)
The Semantics of Predicate Logic as a Programming LanguageJ. ACM, 23
Wolfgang Faber, N. Leone, M. Maratea, F. Ricca (2007)
Look-Back Techniques and Heuristics in DLV : Implementation and Evaluation !
(2006)
Oxford Lecture Series in Mathematics and its Applications
D. Gabbay (2012)
What Is Negation as Failure?
Mikoláš Janota, Joao Marques-Silva (2011)
cmMUS: A Tool for Circumscription-Based MUS Membership Testing
U. Egly, Thomas Eiter, Volker Klotz, H. Tompits, S. Woltran (2001)
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results
K. Apt, V. Marek, M. Truszczynski, D. Warren (2011)
The Logic Programming Paradigm: A 25-Year Perspective
J. Flum, Martin Grohe (2006)
Parameterized Complexity Theory
Son To, Enrico Pontelli, Tran Son (2009)
A Conformant Planner with Explicit Disjunctive Representation of Belief StatesProceedings of the International Conference on Automated Planning and Scheduling
H. Bodlaender, R. Downey, F. Fomin, D. Marx (2012)
The Multivariate Algorithmic Revolution and Beyond, 7370
T. Janhunen, I. Niemelä, P. Simons, Jia-Huai You (2000)
Unfolding partiality and disjunctions in stable model semanticsArXiv, cs.AI/0303009
V. Marek, M. Truszczynski (1991)
Autoepistemic logicJ. ACM, 38
G. Tseitin (1983)
On the Complexity of Derivation in Propositional Calculus
Y. Lierler (2005)
cmodels - SAT-Based Disjunctive Answer Set Solver
K. Apt, V. Marek, M. Truszczynski, D. Warren (1999)
The Logic Programming Paradigm
N. Bidoit, C. Froidevaux (1991)
Negation by Default and Unstratifiable Logic ProgramsTheor. Comput. Sci., 78
(1994)
Artif
Y. Lierler, E. Erdem, V. Lifschitz (2000)
Fages' Theorem and Answer Set ProgrammingArXiv, cs.AI/0003042
M. Gebser, B. Kaufmann, R. Kaminski, M. Ostrowski, Torsten Schaub, M. Lindauer (2011)
Potassco: The Potsdam Answer Set Solving CollectionAI Commun., 24
U. Endriss, Ronald Haan, Stefan Szeider (2015)
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
M. Gebser, B. Kaufmann, Torsten Schaub (2013)
Advanced Conflict-Driven Disjunctive Answer Set Solving
Serge Gaspers, Stefan Szeider (2011)
Backdoors to SatisfactionArXiv, abs/1110.6387
J. Fichte, Stefan Szeider (2011)
Backdoors to Tractable Answer-Set ProgrammingArXiv, abs/1104.2788
Ronald Haan, Stefan Szeider (2014)
Fixed-Parameter Tractable Reductions to SAT
C. Drescher, M. Gebser, T. Grote, B. Kaufmann, A. König, M. Ostrowski, Torsten Schaub (2008)
Conflict-Driven Disjunctive Answer Set Solving
Stefan Brass, J. Dix (1998)
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWAJournal of Automated Reasoning, 20
Stefan Szeider (1998)
Parameterized Complexity
M. Gebser, T. Janhunen, J. Rintanen (2014)
Answer Set Programming as SAT modulo Acyclicity
R. Niedermeier (2006)
Invitation to Fixed-Parameter Algorithms
E. Giunchiglia, Y. Lierler, M. Maratea (2006)
Answer Set Programming Based on Propositional SatisfiabilityJournal of Automated Reasoning, 36
J. Flum, Martin Grohe (2006)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Moshe Vardi (2010)
On P, NP, and computational complexityCommunications of the ACM, 53
S. Malik, Lintao Zhang (2009)
Boolean satisfiability from theoretical hardness to practical successCommunications of the ACM, 52
Alexandra Goultiaeva, M. Seidl, Armin Biere (2013)
Bridging the gap between dual propagation and CNF-based QBF solving2013 Design, Automation & Test in Europe Conference & Exhibition (DATE)
and Scheduling (ICAPS'09)
F. Fages (1992)
Consistency of Clark's completion and existence of stable modelsMethods Log. Comput. Sci., 1
M. Gebser, Torsten Schaub, S. Thiele, B. Usadel, P. Veber
Under Consideration for Publication in Theory and Practice of Logic Programming Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
P. Simons, I. Niemelä, T. Soininen (2000)
Extending and implementing the stable model semanticsArtif. Intell., 138
Fangzhen Lin, Yuting Zhao (2002)
ASSAT: computing answer sets of a logic program by SAT solvers
H. Gallaire, J. Minker (1978)
Logic and Data Bases
A. Pfandler, Stefan Rümmele, Stefan Szeider (2013)
Backdoors to AbductionArXiv, abs/1304.5961
Thomas Eiter, Michael Fink, H. Tompits, S. Woltran (2004)
Simplifying Logic Programs Under Uniform and Strong Equivalence
Armin Biere (2004)
Resolve and Expand
(2012)
Publication Date:
M. Gelfond, Vladimir Lifschitz (1988)
The Stable Model Semantics for Logic Programming
U. Egly, Florian Lonsing, M. Widl (2013)
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving
G. Brewka, Thomas Eiter, M. Truszczynski (2011)
Answer set programming at a glanceCommunications of the ACM, 54
L. Stockmeyer, A. Meyer (1973)
Word problems requiring exponential time(Preliminary Report)Proceedings of the fifth annual ACM symposium on Theory of computing
(2000)
In Computer Aided Verification, LNCS 1855
(1991)
In Proceedings of the 1st International Conference on Logic Programming and Nonmonotonic Reassoning (LPNMR’91)
U. Egly, Thomas Eiter, H. Tompits, S. Woltran (2000)
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
V. Marek, M. Truszczynski (1991)
Computing Intersection of Autoepistemic Expansions
T. Janhunen, I. Niemelä, Mark Sevalnev (2009)
Computing Stable Models via Reductions to Difference Logic
Florian Lonsing, Armin Biere (2010)
DepQBF: A Dependency-Aware QBF SolverJ. Satisf. Boolean Model. Comput., 7
(1999)
editors
Ryan Williams, C. Gomes, B. Selman (2003)
Backdoors To Typical Case Complexity
T. Janhunen (2006)
Some (in)translatability results for normal logic programs and propositional theoriesJournal of Applied Non-Classical Logics, 16
M. Gelfond, V. Lifschitz (1991)
Classical negation in logic programs and disjunctive databasesNew Generation Computing, 9
M. Maratea, F. Ricca, Wolfgang Faber, N. Leone (2008)
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solversJ. Algorithms, 63
M. Truszczynski (2010)
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programsTheory and Practice of Logic Programming, 11
J. Flum, Martin Grohe (2002)
Describing parameterized complexity classesInf. Comput., 187
I. Niemelä (1999)
Logic programs with stable model semantics as a constraint programming paradigmAnnals of Mathematics and Artificial Intelligence, 25
H. Katebi, K. Sakallah, Joao Marques-Silva (2011)
Empirical Study of the Anatomy of Modern Sat Solvers
Armin Biere, Marijn Heule, H. Maaren, T. Walsh (2009)
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
R. Downey, M. Fellows (2013)
Fundamentals of Parameterized Complexity
V. Lifschitz, A. Razborov (2006)
Why are there so many loop formulas?ACM Trans. Comput. Log., 7
N. Nishimura, P. Ragde, Stefan Szeider (2004)
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
M. Golumbic (2002)
Annals of Mathematics and Artificial IntelligenceAnnals of Mathematics and Artificial Intelligence, 36
Robert Kowalski (2014)
Logic Programming
W. Dowling, J. Gallier (1984)
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn FormulaeJ. Log. Program., 1
Hubie Chen, Y. Interian (2005)
A Model for Generating Random Quantified Boolean Formulas
A. Ayari, D. Basin (2002)
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
R. Ben-Eliyahu-Zohary, R. Dechter (1994)
Propositional semantics for disjunctive logic programsAnnals of Mathematics and Artificial Intelligence, 12
Y. Gurevich (1990)
On Finite Model Theory
M. Gebser, Lengning Liu, Gayathri Namasivayam, A. Neumann, Torsten Schaub, M. Truszczynski (2007)
The First Answer Set Programming System Competition
V. Marek, M. Truszczynski (1998)
Stable models and an alternative logic programming paradigm
(2014)
Received September
M. Gebser, B. Kaufmann, A. Neumann, Torsten Schaub (2007)
Conflict-Driven Answer Set Solving
Joohyung Lee, V. Lifschitz (2003)
Loop Formulas for Disjunctive Logic Programs
J. Fichte (2012)
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs
Ronald Haan, Stefan Szeider (2013)
The Parameterized Complexity of Reasoning Problems Beyond NPArXiv, abs/1312.1672
T. Janhunen, Emilia Oikarinen, H. Tompits, S. Woltran (2007)
Modularity Aspects of Disjunctive Stable Models
(1999)
Springer Verlag
J. Fichte, M. Truszczynski, S. Woltran (2015)
Dual-normal logic programs – the forgotten classTheory and Practice of Logic Programming, 15
Thomas Eiter, G. Gottlob (1995)
On the computational cost of disjunctive logic programming: Propositional caseAnnals of Mathematics and Artificial Intelligence, 15
Keith Clark (1987)
Negation as Failure
H. Büning, Theodor Lettman (1999)
Propositional Logic: Deduction and Algorithms
Richard Williams, C. Gomes, B. Selman (2003)
On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search
Backdoors to Normality for Disjunctive Logic Programs JOHANNES K. FICHTE, Vienna University of Technology and University of Potsdam STEFAN SZEIDER, Vienna University of Technology The main reasoning problems for disjunctive logic programs are complete for the second level of the polynomial hierarchy and hence considered harder than the same problems for normal (i.e., disjunction-free) programs, which are on the first level. We propose a new exact method for solving the disjunctive problems which exploits the small distance of a disjunctive programs from being normal. The distance is measured in terms of the size of a smallest "backdoor to normality," which is the smallest number of atoms whose deletion makes the program normal. Our method consists of three phases. In the first phase, a smallest backdoor is computed. We show that this can be done using an efficient algorithm for computing a smallest vertex cover of a graph. In the second phase, the backdoor is used to transform the logic program into a quantified Boolean formula (QBF) where the number of universally quantified variables equals the size of the backdoor and where the total size of the quantified Boolean formula is quasilinear in the size of the given logic
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Nov 14, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.