Which Soft Constraints do you Prefer?

DOI10.1016/j.entcs.2009.05.020zbMath1347.68197OpenAlexW2029080363MaRDI QIDQ5179139

Max Meier, Matthias Hoelzl, Martin Wirsing

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.020

zbMATH Keywords

soft constraintsrewriting logic

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42)

Related Items (5)

Twenty years of rewriting logic ⋮ A Homage to Martin Wirsing ⋮ Ode to the PST ⋮ Partial Valuation Structures for Qualitative Soft Constraints ⋮ Abstract Constraint Data Types

Uses Software

• PAGODA
• Cassowary

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fourier elimination for compiling constraint hierarchies
• A Rewriting Logic Framework for Soft Constraints
• Bipolar Preference Problems: Framework, Properties and Solving Techniques
• Operators and Laws for Combining Preference Relations
• Semiring-based constraint satisfaction and optimization
• Soft concurrent constraint programming

This page was built for publication: Which Soft Constraints do you Prefer?