Implementing logical connectives in constraint programming

DOI10.1016/j.artint.2010.07.001zbMath1210.68103MaRDI 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 programming; constraint satisfaction problems; propagation algorithms; logical connectives

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• Chaff
• MINION

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item