Modular Constraint Solver Cooperation via Abstract Interpretation

DOI10.1017/S1471068420000162zbMath1468.68208arXiv2008.01415MaRDI QIDQ5140021

Charlotte Truchet, Pierre Talbot, Eric Monfroy

Publication date: 13 December 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.01415

zbMATH Keywords

constraint programmingmodularityabstract domainssolver cooperation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Uses Software

• Gecode

Cites Work

• The octagon abstract domain
• Job-shop scheduling with multi-purpose machines
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• The essence of constraint propagation
• Propagation via lazy clause generation
• A Constraint Solver Based on Abstract Domains
• On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
• Encodings of the Sequence Constraint
• Simplification by Cooperating Decision Procedures
• Theories, solvers and static analysis by abstract interpretation
• Abstract satisfaction

This page was built for publication: Modular Constraint Solver Cooperation via Abstract Interpretation