Bilattices and the semantics of logic programming
Journal of Logic Programming
Possibilistic constraint satisfaction problems or “how to handle soft constraints?”
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Labeling and Partial Local Consistency for Soft Constraint Programming
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orderings. They have been used in Artificial Intelligence in order to model incomplete information. We present a framework for Bilattice-valued Constraint Programming which allows to represent incomplete or conflicting information and to combine constraints with a set of operators. It allows to model a variety of situation such as open constraints and the integration of machine learning into constraint programming, reconciliation of divergent opinions in distributed systems or constraint modules in a software engineering perspective.