Abstract conflict driven learning

DOI10.1145/2429069.2429087MaRDI QIDQ2931790zbMATH OpenOpenAlexFDO

Authors Vijay D'Silva, Leopold Haller, Daniel Kroening

Publication date 27 November 2014

Published in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2429069.2429087

zbMATH Keywords

latticessatisfiabilityconflict-driven clause learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Lattices (06B99)

Recommendations

• Learning from conflicts in propositional satisfiability
• Conflict-driven conditional termination
• What we can learn from conflicts in propositional satisfiability
• Generalized conflict-clause strengthening for satisfiability solvers
• Abstract satisfaction

Cited in

(11)

• Lifting CDCL to template-based abstract domains for program verification
• On abstract modular inference systems and solvers
• Extending Maximal Completion (Invited Talk)
• Deciding floating-point logic with abstract conflict driven clause learning
• Conflict-driven conditional termination
• raSAT: an SMT solver for polynomial constraints
• Abstract Interpretation as Automated Deduction
• SAT-Based Model Checking
• An approximation framework for solvers and decision procedures
• A Generalized Framework for Conflict Analysis
• Abstract interpretation as automated deduction

This page was built for publication: Abstract conflict driven learning

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