Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination

DOI10.1007/978-3-031-15707-3_16OpenAlexW4293179553MaRDI QIDQ2694569

Tomi Janhunen, Masood Feyzbakhsh Rankooh

Publication date: 4 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_16

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Uses Software

• ASSAT
• clasp
• WASP
• ASPTools

Cites Work

• Unnamed Item
• Unnamed Item
• Extending and implementing the stable model semantics
• Logic programs with stable model semantics as a constraint programming paradigm
• SAT Modulo Graphs: Acyclicity
• Improving the Normalization of Weight Rules in Answer Set Programs
• Declarative encodings of acyclicity properties
• Advances in WASP
• Progress in clasp Series 3
• Some (in)translatability results for normal logic programs and propositional theories
• Answer Set Programming Modulo Acyclicity*
• The Seventh Answer Set Programming Competition: Design and Results
• Applying Visible Strong Equivalence in Answer-Set Program Transformations
• Computer Aided Verification

This page was built for publication: Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination