Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Fixpoint semantics for logic programming a survey
Theoretical Computer Science
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Resolution for Skeptical Stable Model Semantics
Journal of Automated Reasoning
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Computing Well-founded Semantics Faster
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
A Tableau Calculus for Equilibrium Entailment
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Unrestricted vs restricted cut in a tableau method for Boolean circuits
Annals of Mathematics and Artificial Intelligence
Graphs and colorings for answer set programming
Theory and Practice of Logic Programming
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Twelve Definitions of a Stable Model
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Design and implementation of aggregate functions in the dlv system*
Theory and Practice of Logic Programming
Extended asp tableaux and rule redundancy in normal logic programs1
Theory and Practice of Logic Programming
On the relation among answer set solvers
Annals of Mathematics and Artificial Intelligence
Stable models and difference logic
Annals of Mathematics and Artificial Intelligence
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Advanced Preprocessing for Answer Set Solving
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Fast SAT-based answer set solver
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Computing Stable Models via Reductions to Difference Logic
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Properties and applications of programs with monotone and convex constraints
Journal of Artificial Intelligence Research
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A model-theoretic counterpart of loop formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Head-elementary-set-free logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Generic tableaux for answer set programming
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
On the power of clause-learning SAT solvers as resolution engines
Artificial Intelligence
Abstract answer set solvers with backjumping and learning
Theory and Practice of Logic Programming
Compact translations of non-disjunctive answer set programs to propositional clauses
Logic programming, knowledge representation, and nonmonotonic reasoning
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
On the relation between answer set and sat procedures (or, between cmodels and smodels)
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Unfounded sets for disjunctive logic programs with arbitrary aggregates
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The nomore++ approach to answer set solving
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Tableau calculi for answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Hi-index | 0.00 |
We introduce formal proof systems based on tableau methods for analyzing computations in Answer Set Programming (ASP). Our approach furnishes fine-grained instruments for characterizing operations as well as strategies of ASP solvers. The granularity is detailed enough to capture a variety of propagation and choice methods of algorithms used for ASP solving, also incorporating SAT-based and conflict-driven learning approaches to some extent. This provides us with a uniform setting for identifying and comparing fundamental properties of ASP solving approaches. In particular, we investigate their proof complexities and show that the run-times of best-case computations can vary exponentially between different existing ASP solvers. Apart from providing a framework for comparing ASP solving approaches, our characterizations also contribute to their understanding by pinning down the constitutive atomic operations. Furthermore, our framework is flexible enough to integrate new inference patterns, and so to study their relation to existing ones. To this end, we generalize our approach and provide an extensible basis aiming at a modular incorporation of additional language constructs. This is exemplified by augmenting our basic tableau methods with cardinality constraints and disjunctions.