Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses

DOI10.1007/978-3-642-20832-4_8zbMath1326.68058OpenAlexW89328955MaRDI QIDQ3001916

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

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

Related Items (12)

Applying Visible Strong Equivalence in Answer-Set Program Transformations ⋮ Propositional SAT Solving ⋮ Improving the Normalization of Weight Rules in Answer Set Programs ⋮ A progression semantics for first-order logic programs ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ Unnamed Item ⋮ Conflict-driven answer set solving: from theory to practice ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ 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

Uses Software

• ASSAT
• Cmodels

This page was built for publication: Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses