Solving mixed and conditional constraint satisfaction problems

DOI10.1023/A:1022394531132MaRDI QIDQ1405330zbMATH OpenOpenAlexFDO

Authors Esther Gelle, Boi Faltings

Publication date 25 August 2003

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022394531132, http://infoscience.epfl.ch/record/98184

zbMATH Keywords

constraint satisfactionlocal consistencymixed constraintsnumeric constraintspropagation rulerefine operator

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1234562
• Constraint processing. Proceedings of workshops held in conjunction with the international congress on computer systems and applied mathematics (CSAM '93) in St. Petersburg, Russia and the European conference on artificial intelligence (ECAI '94) held in
• scientific article; zbMATH DE number 1094771
• The logic of constraint satisfaction
• Constraint propagation for ordering, abstraction, and aggregation relations

Cited in

(8)

• Solving quantified constraint satisfaction problems
• Satisfiability on mixed instances
• Heterogeneous constraint solving
• scientific article; zbMATH DE number 4174376 (Why is no real title available?)
• SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
• Principles and Practice of Constraint Programming – CP 2003
• Adaptive spacetime discontinuous Galerkin method for hyperbolic advection-diffusion with a non-negativity constraint
• Constraint solving in uncertain and dynamic environments: A survey

This page was built for publication: Solving mixed and conditional constraint satisfaction problems

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