Sciweavers

57 search results - page 1 / 12
» Compiling propositional weighted bases
Sort
View
AI
2004
Springer
13 years 4 months ago
Compiling propositional weighted bases
In this paper, we investigate the extent to which knowledge compilation can be used to improve model checking and inference from propositional weighted bases. We first focus on th...
Adnan Darwiche, Pierre Marquis
JETAI
2008
86views more  JETAI 2008»
13 years 4 months ago
Weighting strategy for non-clausal resolution
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...
Zbigniew Stachniak, Anton Belov
IJPRAI
2000
108views more  IJPRAI 2000»
13 years 4 months ago
Knowledge Base Reformation: Preparing First-Order Theories for Efficient Propositional Reasoning
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since...
Helmut Prendinger, Mitsuru Ishizuka, Gerhard Schur...
JSAT
2006
126views more  JSAT 2006»
13 years 4 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
AAAI
2008
13 years 7 months ago
New Compilation Languages Based on Structured Decomposability
We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to repr...
Knot Pipatsrisawat, Adnan Darwiche