A logic of soft constraints based on partially ordered preferences

DOI10.1007/s10732-006-6347-5zbMath1100.68110MaRDI QIDQ2506231

Nic Wilson

Publication date: 28 September 2006

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-006-6347-5

zbMATH Keywords

Soft constraints; Preferences; Possibilistic logic; Semiring-based CSPs

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

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

Related Items

Enabling local computation for partially ordered preferences, A probabilistic logic based on the acceptability of gambles, Subexponential concurrent constraint programming, Extending uncertainty formalisms to linear constraints and other complex formalisms, A Proof Theoretic Study of Soft Concurrent Constraint Programming

Uses Software

• CP-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning with partially ordered information in a possibilistic logic framework
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Semirings for constraint solving and programming.
• Bucket elimination: A unifying framework for reasoning
• Nonserial dynamic programming
• Mini-buckets
• Semiring-based constraint satisfaction and optimization