A constraint solver based on abstract domains

DOI10.1007/978-3-642-35873-9_26MaRDI QIDQ2926656zbMATH OpenOpenAlexFDO

Authors Marie Pelleau, Antoine Miné, Charlotte Truchet, Frédéric Benhamou

Publication date 3 November 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35873-9_26

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 512885
• Precise goal-independent abstract interpretation of constraint logic programs
• scientific article; zbMATH DE number 2084751
• scientific article; zbMATH DE number 2080331
• Generalized semantics and abstract interpretation for constraint logic programs

Cited in

(12)

• A certified constraint solver over finite domains
• A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
• scientific article; zbMATH DE number 1975612 (Why is no real title available?)
• Revisiting polyhedral analysis for hybrid systems
• A global constraint for over-approximation of real-time streams
• scientific article; zbMATH DE number 2084751 (Why is no real title available?)
• Sharpening constraint programming approaches for bit-vector theory
• scientific article; zbMATH DE number 1696595 (Why is no real title available?)
• Incrementally closing octagons
• Modular constraint solver cooperation via abstract interpretation
• Abstracting numeric constraints with Boolean functions
• An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming

Describes a project that uses

Uses Software

• Octagon

This page was built for publication: A constraint solver based on abstract domains

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