Solving satisfiability problems with preferences
- 3 July 2010
- journal article
- Published by Springer Nature in Constraints
- Vol. 15 (4) , 485-515
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- Telecommunications Feature Subscription as a Partial Order Constraint ProblemLecture Notes in Computer Science, 2008
- Logic programming with satisfiabilityTheory and Practice of Logic Programming, 2008
- Comparing arguments using preference orderings for argument-based reasoning2005
- Preference‐Based Constrained Optimization with CP‐NetsComputational Intelligence, 2004
- CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference StatementsJournal of Artificial Intelligence Research, 2004
- The complexity of resolution refinements2003
- Efficient CNF Encoding of Boolean Cardinality Constraints2003
- Generic ILP versus specialized 0-1 ILP2006 IEEE/ACM International Conference on Computer Aided Design, 2002
- Symbolic Model Checking without BDDs1999
- A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT ProblemsJournal of Combinatorial Optimization, 1998