Abstract conflict driven learning
From MaRDI portal
Publication:2931790
DOI10.1145/2429069.2429087zbMath1301.68156MaRDI QIDQ2931790
Daniel Kroening, Leopold Haller, Vijay D'Silva
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
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
68Q60: Specification and verification (program logics, model checking, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
06B99: Lattices
Related Items
Extending Maximal Completion (Invited Talk), On abstract modular inference systems and solvers, Deciding floating-point logic with abstract conflict driven clause learning, raSAT: an SMT solver for polynomial constraints, Abstract interpretation as automated deduction, An approximation framework for solvers and decision procedures, SAT-Based Model Checking, Abstract Interpretation as Automated Deduction