On the relation among answer set solvers

DOI10.1007/s10472-009-9113-1zbMath1165.68333OpenAlexW2018172994MaRDI QIDQ1028643

Enrico Giunchiglia, Marco Maratea, Nicola Leone

Publication date: 6 July 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-009-9113-1

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items

On abstract modular inference systems and solvers, Shared aggregate sets in answer set programming, Cautious reasoning in ASP via minimal models and unsatisfiable cores, Disjunctive answer set solvers via templates, Query answering in resource-based answer set semantics, Constraint answer set solver EZCSP and why integration schemas matter, Abstract Solvers for Computing Cautious Consequences of ASP programs, Conflict-driven answer set solving: from theory to practice, Transition systems for model generators—A unifying approach, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search

Uses Software

• ASSAT
• Cmodels
• Chaff
• nomore++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• The intractability of resolution
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Extending and implementing the stable model semantics
• Logic programs with stable model semantics as a constraint programming paradigm
• On the complexity of choosing the branching literal in DPLL
• Many hard examples for resolution
• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
• Generic Tableaux for Answer Set Programming
• Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs
• Some (in)translatability results for normal logic programs and propositional theories
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Tight logic programs
• A sharp threshold in proof complexity
• The nomore + + Approach to Answer Set Solving
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Conflict-Driven Answer Set Enumeration
• Tableau Calculi for Answer Set Programming
• Logic Programming and Nonmonotonic Reasoning
• AI*IA 2005: Advances in Artificial Intelligence
• Logic Programming
• Abstract Answer Set Solvers
• Principles and Practice of Constraint Programming – CP 2003