Conflict-driven answer set solving: from theory to practice
From MaRDI portal
Publication:1761291
DOI10.1016/J.ARTINT.2012.04.001zbMATH Open1251.68060OpenAlexW2049791401MaRDI QIDQ1761291
Torsten Schaub, Martin Gebser, Benjamin Kaufmann
Publication date: 15 November 2012
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2012.04.001
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- BerkMin: A fast and robust SAT-solver
- ASSAT: computing answer sets of a logic program by SAT solvers
- The nomore + + Approach to Answer Set Solving
- Extending and implementing the stable model semantics
- Nested expressions in logic programs
- Logic programming and nonmonotonic reasoning. 8th international conference, LPNMR 2005, Diamante, Italy, September 5--8, 2005. Proceedings.
- The well-founded semantics for general logic programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Constraint Answer Set Solving
- The DLV system for knowledge representation and reasoning
- Semantics and complexity of recursive aggregates in answer set programming
- Logic Programming and Nonmonotonic Reasoning
- Depth-First Search and Linear Graph Algorithms
- Theory and Applications of Satisfiability Testing
- Solution Enumeration for Projected Boolean Search Problems
- On the relation among answer set solvers
- Answer set programming and plan generation
- Logic programs with stable model semantics as a constraint programming paradigm
- Abstract answer set solvers with backjumping and learning
- Solving SAT and SAT Modulo Theories
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- GRASP: a search algorithm for propositional satisfiability
- Tableau Calculi for Answer Set Programming
- Engineering an Incremental ASP Solver
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Optimal speedup of Las Vegas algorithms
- Answer set programming based on propositional satisfiability
- Conflict-Driven Answer Set Enumeration
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Temporal induction by incremental SAT solving
- On the power of clause-learning SAT solvers as resolution engines
- Stable models and difference logic
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Head-Elementary-Set-Free Logic Programs
- Detecting inconsistencies in large biological networks with answer set programming
- Theory and applications of satisfiability testing -- SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12--15, 2008. Proceedings
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Logic programming and knowledge representation---The A-Prolog perspective
- Why are there so many loop formulas?
- The expressive powers of the logic programming semantics
- A transitive closure algorithm
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- Some (in)translatability results for normal logic programs and propositional theories
- Logic programming and nonmonotonic reasoning. 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15--17, 2007. Proceedings
- Enhancing DLV instantiator by backjumping techniques
- Multi-criteria optimization in answer set programming
- The Significance of Memory Costs in Answer Set Solver Implementation
- Local Restarts
- Extended ASP Tableaux and rule redundancy in normal logic programs
- Computing Stable Models via Reductions to Difference Logic
- Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
- Answer Set Programming for Single-Player Games in General Game Playing
- Automatic Composition of Melodic and Harmonic Music by Answer Set Programming
Cited In (only showing first 100 items - show all)
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- Knowledge representation analysis of graph mining
- A model building framework for answer set programming with external computations
- Exploiting Unfounded Sets for HEX-Program Evaluation
- On the relation between SPARQL1.1 and Answer Set Programming
- On the complexity of input/output logic
- Inductive logic programming at 30
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Lpopt: a rule optimization tool for answer set programming
- The Design of the Sixth Answer Set Programming Competition
- Constraint CNF: SAT and CSP Language Under One Roof.
- Efficiently Coupling the I-DLV Grounder with ASP Solvers
- Optimizing Answer Set Computation via Heuristic-Based Decomposition
- $$\#\exists $$ SAT: Projected Model Counting
- SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
- On abstract modular inference systems and solvers
- Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition
- A network model for routing-fault-free wavelength selection in WRONoCs design
- Debugging Non-ground ASP Programs: Technique and Graphical Tools
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- A Model for Phase Transition of Random Answer-Set Programs
- Advances in WASP
- A multiparametric view on answer set programming
- A Formal Theory of Justifications
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- Parallel Logic Programming: A Sequel
- Fuzzy answer set computation via satisfiability modulo theories
- Learning Boolean controls in regulated metabolic networks: a case-study
- An investigation of parametrized difference revision operators
- Revising event calculus theories to recover from unexpected observations
- Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
- Improving the Normalization of Weight Rules in Answer Set Programs
- Answer Set Programming Modulo Acyclicity
- Clingo goes linear constraints over reals and integers
- Backdoors to Normality for Disjunctive Logic Programs
- Progress in clasp Series 3
- aspeed: Solver scheduling via answer set programming
- selp: A Single-Shot Epistemic Logic Program Solver
- Fixed point semantics for stream reasoning
- Inductive Learning of Answer Set Programs
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Multi-shot ASP solving with clingo
- Design and results of the Fifth Answer Set Programming Competition
- Forgetting auxiliary atoms in forks
- A multi-shot ASP encoding for the aircraft routing and maintenance planning problem
- DualGrounder: lazy instantiation via clingo multi-shot framework
- Assessing progress in SAT solvers through the Lens of incremental SAT
- Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning
- A general approach to reasoning with probabilities
- A progression semantics for first-order logic programs
- Title not available (Why is that?)
- Backdoors to tractable answer set programming
- Gelfond-Zhang aggregates as propositional formulas
- The External Interface for Extending WASP
- Capturing Conflict and Confusion in CSP
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- The configurable SAT solver challenge (CSSC)
- Better Paracoherent Answer Sets with Less Resources
- Meta-interpretive learning: application to grammatical inference
- What is answer set programming to propositional satisfiability
- Extended RDF: computability and complexity issues
- Logic Programming with Graded Modality
- Supportedly stable answer sets for logic programs with generalized atoms
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Learning discrete decomposable graphical models via constraint optimization
- Shared aggregate sets in answer set programming
- Complexity and compilation of GZ-aggregates in answer set programming
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Graph-based construction of minimal models
- Boosting Answer Set Optimization with Weighted Comparator Networks
- Hybrid ASP-based Approach to Pattern Mining
- Inlining External Sources in Answer Set Programs
- IASCAR: incremental answer set counting by anytime refinement
- Flexible FOND Planning with Explicit Fairness Assumptions
- On Uniform Equivalence of Epistemic Logic Programs
- Rewriting optimization statements in answer-set programs
- Stepwise debugging of answer-set programs
- The dramatic true story of the frame default
- The power of non-ground rules in Answer Set Programming
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Inconsistency Proofs for ASP: The ASP - DRUPE Format
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
- Title not available (Why is that?)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Incremental maintenance of overgrounded logic programs with tailored simplifications
- Breaking symmetries with high dimensional graph invariants and their combination
- Witnesses for Answer Sets of Logic Programs
- Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- Title not available (Why is that?)
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
- Title not available (Why is that?)
- Many-valued dynamic object-oriented inheritance and approximations
- A Neuro-Symbolic ASP Pipeline for Visual Question Answering
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
- Qualitative reasoning about 2D cardinal directions using answer set programming
Uses Software
This page was built for publication: Conflict-driven answer set solving: from theory to practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761291)
