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

DOI10.1007/978-3-642-20832-4_8zbMATH Open1326.68058OpenAlexW89328955MaRDI QIDQ3001916FDOQ3001916

Ilkka Niemelä, Tomi Janhunen

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)

Cited In (14)

• IASCAR: incremental answer set counting by anytime refinement
• Aspmc: new frontiers of algebraic answer set counting
• Applying Visible Strong Equivalence in Answer-Set Program Transformations
• A multiparametric view on answer set programming
• The Seventh Answer Set Programming Competition: Design and Results
• Improving the Normalization of Weight Rules in Answer Set Programs
• Title not available (Why is that?)
• Conflict-driven answer set solving: from theory to practice
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Design and results of the Fifth Answer Set Programming Competition
• Propositional SAT Solving
• A progression semantics for first-order logic programs
• First-order stable model semantics with intensional functions
• 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

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