Recommendations
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1319354 (Why is no real title available?)
- scientific article; zbMATH DE number 478394 (Why is no real title available?)
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- scientific article; zbMATH DE number 1368932 (Why is no real title available?)
- scientific article; zbMATH DE number 1931692 (Why is no real title available?)
- scientific article; zbMATH DE number 5043340 (Why is no real title available?)
- scientific article; zbMATH DE number 2243388 (Why is no real title available?)
- A backjumping technique for disjunctive logic programming
- A sharp threshold in proof complexity
- AI*IA 2005: Advances in Artificial Intelligence
- ASSAT: computing answer sets of a logic program by SAT solvers
- Abstract Answer Set Solvers
- Answer set programming based on propositional satisfiability
- Conflict-Driven Answer Set Enumeration
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs
- Extending and implementing the stable model semantics
- Generic Tableaux for Answer Set Programming
- Introduction to algorithms
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with stable model semantics as a constraint programming paradigm
- Logics in Artificial Intelligence
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Many hard examples for resolution
- On the complexity of choosing the branching literal in DPLL
- Principles and Practice of Constraint Programming – CP 2003
- Some (in)translatability results for normal logic programs and propositional theories
- Tableau Calculi for Answer Set Programming
- The intractability of resolution
- The nomore + + Approach to Answer Set Solving
- Tight logic programs
Cited in
(22)- Transition systems for model generators -- a unifying approach
- Disjunctive answer set solvers via templates
- Towards a Type Discipline for Answer Set Programming
- On abstract modular inference systems and solvers
- Tableau Calculi for Answer Set Programming
- A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Evaluating ASP and commercial solvers on the CSPLib
- AI*IA 2005: Advances in Artificial Intelligence
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Constraint answer set solver EZCSP and why integration schemas matter
- Conflict-driven answer set solving: from theory to practice
- ASSAT: computing answer sets of a logic program by SAT solvers
- Logic Programming and Nonmonotonic Reasoning
- The Significance of Memory Costs in Answer Set Solver Implementation
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Abstract Answer Set Solvers
- Tableau calculi for logic programs under answer set semantics
- Logic Programming
- System \textsc{aspmt2smt}: computing ASPMT theories by SMT solvers
- Shared aggregate sets in answer set programming
- Query answering in resource-based answer set semantics
This page was built for publication: On the relation among answer set solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028643)
