Symbolic system synthesis using answer set programming

DOI10.1007/978-3-642-40564-8_9MaRDI QIDQ2851234zbMATHOpenAlexFDO

Authors Benjamin Andres, Martin Gebser, Torsten Schaub, Christian Haubelt, Felix Reimann, Michael Glaß

Publication date 10 October 2013

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40564-8_9

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical problems of computer architecture (68M07)

Recommendations

• Design-as-satisfiability: A new approach to automated synthesis
• Improving coordinated SMT-based system synthesis by utilizing domain-specific heuristics
• Theory and Applications of Satisfiability Testing
• Designing an Efficient Hardware Implication Accelerator for SAT Solving
• SAT-Based Synthesis Methods for Safety Specs

Cited in

(6)

• Improving coordinated SMT-based system synthesis by utilizing domain-specific heuristics
• Synthesizing Imperative Code from Answer Set Programming Specifications
• Abstract symbol systems (an exercise of the bottom-up approach in artificial intelligence)
• Design-as-satisfiability: A new approach to automated synthesis
• Computing Diverse Optimal Stable Models
• Accurate computation of sensitizable paths using answer set programming

Describes a project that uses

Uses Software

• Gringo
• clasp
• Clingo

This page was built for publication: Symbolic system synthesis using answer set programming

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