Implementing logical connectives in constraint programming

DOI10.1016/j.artint.2010.07.001zbMath1210.68103OpenAlexW2055043227MaRDI QIDQ622127

Karen E. Petrie, Neil Moore, Christopher Jefferson, Peter W. Nightingale

Publication date: 31 January 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.07.001

zbMATH Keywords

constraint programmingconstraint satisfaction problemspropagation algorithmslogical connectives

Mathematics Subject Classification ID

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

Related Items (5)

SAT solving for termination proofs with recursive path orders and dependency pairs ⋮ Automatically improving constraint models in Savile Row ⋮ How efficient is a global constraint in practice? A fair experimental framework ⋮ Domain consistency with forbidden values ⋮ On the reification of global constraints

Uses Software

• Chaff
• MINION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Phylogenetic supertrees. Combining information to reveal the tree of life
• Generalised arc consistency for the AllDifferent constraint: an empirical survey
• The complexity of reasoning with global constraints
• Modelling and solving English peg solitaire
• Watched Literals for Constraint Propagation in Minion
• Principles of Constraint Programming
• Design, implementation, and evaluation of the constraint language cc(FD)
• Towards “Propagation = Logic + Control”
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: Implementing logical connectives in constraint programming