Computing All Optimal Solutions in Satisfiability Problems with Preferences

Authors:
Emanuele Rosa;Enrico Giunchiglia;Marco Maratea
Affiliations:
DIST, Università di Genova, Genova, Italy 16145;DIST, Università di Genova, Genova, Italy 16145;DIST, Università di Genova, Genova, Italy 16145
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 6
Cited 1

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
A machine program for theorem-proving

Communications of the ACM
Unrestricted vs restricted cut in a tableau method for Boolean circuits

Annals of Mathematics and Artificial Intelligence
Solving Optimization Problems with DLL

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Planning as satisfiability with preferences

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research

Solving satisfiability problems with preferences

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding an optimal solution in a constraint satisfaction problem with preferences has attracted a lot of researchers in Artificial Intelligence in general, and in the constraint programming community in particular. As a consequence, several approaches for expressing and reasoning about satisfiability problems with preferences have been proposed, and viable solutions exist for finding one optimal solution. However, in many cases, it is not desirable to find just one solution. Indeed, it might be desirable to be able to compute more, and possibly all, optimal solutions, e.g., for comparatively evaluate them on the basis of other criteria not captured by the preferences.In this paper we present a procedure for computing all optimal solutions of a satisfiability problem with preferences. The procedure is guaranteed to compute all and only the optimal solutions, i.e., models which are not optimal are not even computed.