A Revised Concept of Safety for General Answer Set Programs

DOI10.1007/978-3-642-04238-6_8MaRDI QIDQ3643106zbMATH OpenOpenAlexFDO

Authors

Publication date 10 November 2009

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-04238-6_8

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Safety, domain independence and generalized quantification
• An abstract interpretation-based model for safety semantics
• scientific article; zbMATH DE number 7047282
• SAT-Based Synthesis Methods for Safety Specs
• Using integer programming to verify general safety and liveness properties
• Proving Safety Properties of Rewrite Theories
• Safe inductions and their applications in knowledge representation
• Verifying relative safety, accuracy, and termination for program approximations
• Anytime computation of cautious consequences in answer set programming

Cited in

(7)

• Safe beliefs for propositional theories
• Domain expansion for ASP-programs with external sources
• Safety, domain independence and generalized quantification
• Temporal logic programs with variables
• Stability, supportedness, minimality and Kleene answer set programs
• Intelligent Instantiation and Supersafe Rules
• Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic

This page was built for publication: A Revised Concept of Safety for General Answer Set Programs

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