42 search results - page 1 / 9 » Algorithms for computing backbones of propositional formulae |
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
C3S2E
2010
ACM
13 years 10 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
JAR
2006
13 years 9 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
DNA
2001
Springer
14 years 2 months ago
2001
Springer
A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This re...
DALT
2009
Springer
14 years 1 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...