Reformulation of non-binary constraints

DOI10.1007/3-540-45622-8_32MaRDI QIDQ4737615zbMATH OpenFDO

Authors Robert Glaubius

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2371/23710335.htm

Mathematics Subject Classification ID

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

Recommendations

• A new approach to partial constraint satisfaction problems
• Reformulating propositional satisfiability as constraint satisfaction
• scientific article; zbMATH DE number 1094771
• scientific article; zbMATH DE number 1234562
• Constraint Processing

Cited in

(8)

• On forward checking for non-binary constraint satisfaction.
• Constraints in non-Boolean contexts
• Practical reformulations with table constraints
• Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
• scientific article; zbMATH DE number 1231545 (Why is no real title available?)
• High-level modelling and reformulation of constraint satisfaction problems
• Reformulating propositional satisfiability as constraint satisfaction
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Reformulation of non-binary constraints

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