Open constraint programming

DOI10.1016/j.artint.2004.10.005zbMath1132.68699OpenAlexW2129262855MaRDI QIDQ2457706

Santiago Macho-Gonzalez, B. V. Faltings

Publication date: 23 October 2007

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

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

zbMATH Keywords

constraint satisfactionmulti-agent systemsdistributed AI

Mathematics Subject Classification ID

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

Related Items (11)

Towards more expressive ontology languages: the query answering problem ⋮ Interleaving solving and elicitation of constraint satisfaction problems based on expected cost ⋮ Interval-valued soft constraint problems ⋮ Contractibility for open global constraints ⋮ Dealing with Incomplete Preferences in Soft Constraint Problems ⋮ A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs ⋮ Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies ⋮ Deconstructing <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">R</mml:mi><mml:mi mathvariant="sans-serif">eo</mml:mi></mml:math> ⋮ Robust Solutions in Unstable Optimization Problems ⋮ Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts ⋮ Constraint solving in uncertain and dynamic environments: A survey

Cites Work

• Depth-first iterative-deepening: An optimal admissible tree search
• Flexible and scalable cost-based query planning in mediators: A transformational approach
• Semiring-based constraint satisfaction and optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: Open constraint programming