Accurate computation of sensitizable paths using answer set programming

DOI10.1007/978-3-642-40564-8_10zbMATH Open1405.68038OpenAlexW157209229MaRDI QIDQ2851235FDOQ2851235

Authors Benjamin Andres, M. Sauer, Martin Gebser, Tobias Schubert, Bernd Becker, Torsten Schaub

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_10

Mathematics Subject Classification ID

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

Recommendations

• Symbolic system synthesis using answer set programming
• scientific article; zbMATH DE number 3912415
• scientific article; zbMATH DE number 51958
• On the number of tests to detect all path delay faults in combinational logic circuits
• Analyzing pathways using ASP-based approaches

Describes a project that uses

Uses Software

• Gringo
• clasp
• Clingo

This page was built for publication: Accurate computation of sensitizable paths using answer set programming

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