A constraint solver based on abstract domains

DOI10.1007/978-3-642-35873-9_26zbMATH Open1426.68159OpenAlexW96833076MaRDI QIDQ2926656FDOQ2926656

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

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

Mathematics Subject Classification ID

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

Cited In (12)

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

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)