Soft constraint propagation and solving in CHRs

Authors:
Stefano Bistarelli;Thom Frühwirth;Michael Marte
Affiliations:
C.N.R. - Istituto per le, Applicazioni Telematiche, Pisa, Italy;LMU München, Institut für Informatik, Munich, Germany;LMU München, Institut für Informatik, Munich, Germany
Venue:
Proceedings of the 2002 ACM symposium on Applied computing
Year:
2002

Citing 5
Cited 9

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
Concurrent constraint programming

Concurrent constraint programming
Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Search and strategies in OPL

ACM Transactions on Computational Logic (TOCL)

Soft constraint programming to analysing security protocols

Theory and Practice of Logic Programming
A logic of soft constraints based on partially ordered preferences

Journal of Heuristics
Semiring-Based Soft Constraints

Concurrency, Graphs and Models
SCLP for Trust Propagation in Small-World Networks

Recent Advances in Constraints
Which Soft Constraints do you Prefer?

Electronic Notes in Theoretical Computer Science (ENTCS)
Unicast and multicast QoS routing with soft-constraint logic programming

ACM Transactions on Computational Logic (TOCL)
Constraint logic programming

A 25-year perspective on logic programming
A formal framework for trust policy negotiation in autonomic systems: abduction with soft constraints

ATC'10 Proceedings of the 7th international conference on Autonomic and trusted computing
A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are combined according to combinators which express the desired optimization criteria. Constraint Handling Rules (CHRs) constitute a high-level natural formalism to specify constraint solvers and propagation algorithms. In this paper we present a framework to design and specify soft constraint solvers by using CHRs. In this way, we extend the range of applicability of CHRs to soft constraints rather than just classical ones, and we provide a straightforward implementation for soft constraint solvers.