881 search results - page 16 / 177 » Solving satisfiability problems with preferences |
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
AAAI
2004
13 years 10 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
The purpose of this project is to develop a program that solves a bi-objective diet problem to propose the user a “healthy” daily meal according to some parameters specified b...
INFFUS
2006
13 years 8 months ago
2006
The bipolar view in preference modeling distinguishes between negative and positive preferences. Negative preferences correspond to what is rejected, considered unacceptable, whil...
AUSAI
2007
Springer
14 years 19 days ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...