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

DOI10.1007/978-3-031-15707-3_16MaRDI QIDQ2694569zbMATH OpenOpenAlexFDO

Authors Masood Feyzbakhsh Rankooh, Tomi Janhunen

Publication date 4 April 2023

Copyright license Creative Commons Attribution 4.0 International

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)

Cites work

• Advances in WASP
• Answer set programming modulo acyclicity
• Applying visible strong equivalence in answer-set program transformations
• Computer Aided Verification
• Declarative encodings of acyclicity properties
• Extending and implementing the stable model semantics
• scientific article; zbMATH DE number 3593613 (Why is no real title available?)
• scientific article; zbMATH DE number 3313427 (Why is no real title available?)
• Improving the normalization of weight rules in answer set programs
• Logic programs with stable model semantics as a constraint programming paradigm
• Progress in clasp series 3
• SAT modulo graphs: acyclicity
• Some (in)translatability results for normal logic programs and propositional theories
• The Seventh Answer Set Programming Competition: Design and Results

Cited in

(3)

• scientific article; zbMATH DE number 6747915 (Why is no real title available?)
• Formal Methods in Computer-Aided Design
• Capturing (optimal) relaxed plans with stable and supported models of logic programs

Describes a project that uses

Uses Software

• WASP
• clasp
• ASSAT
• ASPTools

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

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