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

conflict-driven clause learninglatticessatisfiability

Mathematics Subject Classification ID

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

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)

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

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)