90
Voted
AMAI
2005
Springer
15 years 11 days ago
2005
Springer
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...
70
Voted
AMAI
2005
Springer
15 years 11 days ago
2005
Springer
105
Voted
AMAI
2005
Springer
15 years 11 days ago
2005
Springer
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...
52
Voted
AMAI
2005
Springer
15 years 11 days ago
2005
Springer
87
Voted
AMAI
2005
Springer
15 years 11 days ago
2005
Springer
This paper investigates Walley's concepts of epistemic irrelevance and epistemic independence for imprecise probability models. We study the mathematical properties of irrele...
53
Voted
AMAI
2005
Springer
15 years 11 days ago
2005
Springer
93
Voted
AMAI
2005
Springer
15 years 11 days ago
2005
Springer
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...
50
Voted
AMAI
2005
Springer
15 years 11 days ago
2005
Springer
61
Voted
AMAI
2005
Springer
15 years 11 days ago
2005
Springer
AIS
2005
Springer
15 years 11 days ago
2005
Springer