Optimal stopping methods for finding high quality solutions to satisfiability problems with preferences

Authors:
Emanuele Di Rosa;Enrico Giunchiglia;Barry O'Sullivan
Affiliations:
University of Genoa, Genoa, Italy;University of Genoa, Genoa, Italy;University College Cork, Cork, Ireland
Venue:
Proceedings of the 2011 ACM Symposium on Applied Computing
Year:
2011

Citing 5
Cited 2

A dynamic topological sort algorithm for directed acyclic graphs

Journal of Experimental Algorithmics (JEA)
The Secretary Problem with a Hazard Rate Condition

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
A new Approach for Solving Satisfiability Problems with Qualitative Preferences

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
From soft constraints to bipolar preferences: modelling framework and solving issues

Journal of Experimental & Theoretical Artificial Intelligence
Solving satisfiability problems with preferences

Constraints

Algorithms for solving satisfiability problems with qualitative preferences

Correct Reasoning
Combining approaches for solving satisfiability problems with qualitative preferences

AI Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract