Sciweavers

AMAI
2005
Springer
13 years 11 months ago
Resolution cannot polynomially simulate compressed-BFS
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov
AMAI
2005
Springer
13 years 11 months ago
Toward leaner binary-clause reasoning in a satisfiability solver
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...
Allen Van Gelder
AMAI
2005
Springer
13 years 11 months ago
Graphoid properties of epistemic irrelevance and independence
This paper investigates Walley's concepts of epistemic irrelevance and epistemic independence for imprecise probability models. We study the mathematical properties of irrele...
Fabio Gagliardi Cozman, Peter Walley
AMAI
2005
Springer
13 years 11 months ago
Bargaining with incomplete information
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
AMAI
2005
Springer
13 years 11 months ago
Logic programming with infinite sets
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about t...
Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Ma...
AIS
2005
Springer
13 years 11 months ago
A conceptual framework for society-oriented decision support
Yingjie Yang, David Gillingwater, Chris J. Hinde