Compact translations of non-disjunctive answer set programs to propositional clauses

DOI10.1007/978-3-642-20832-4_8MaRDI QIDQ3001916zbMATH OpenOpenAlexFDO

Authors Tomi Janhunen, Ilkka Niemelä

Publication date 19 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20832-4_8

Mathematics Subject Classification ID

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

Recommendations

• ASSAT: computing answer sets of a logic program by SAT solvers
• Computing Stable Models via Reductions to Difference Logic
• Answer set programming based on propositional satisfiability
• scientific article; zbMATH DE number 1882048
• scientific article; zbMATH DE number 2088041

Cited in

(20)

• A progression semantics for first-order logic programs
• Conflict-driven answer set solving: from theory to practice
• A multiparametric view on answer set programming
• First-order stable model semantics with intensional functions
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Backdoors to tractable answer set programming
• Applying visible strong equivalence in answer-set program transformations
• Improving the normalization of weight rules in answer set programs
• Propositional SAT solving
• Computing Stable Models via Reductions to Difference Logic
• scientific article; zbMATH DE number 1882048 (Why is no real title available?)
• The Seventh Answer Set Programming Competition: Design and Results
• scientific article; zbMATH DE number 7455719 (Why is no real title available?)
• Aspmc: new frontiers of algebraic answer set counting
• IASCAR: incremental answer set counting by anytime refinement
• A fast and accurate ASP counting based network reliability estimator
• Aggregate semantics for propositional answer set programs
• How to build your own ASP-based system?!
• ASSAT: computing answer sets of a logic program by SAT solvers
• Design and results of the Fifth Answer Set Programming Competition

Describes a project that uses

Uses Software

• ASSAT
• Cmodels

This page was built for publication: Compact translations of non-disjunctive answer set programs to propositional clauses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3001916)