Sciweavers

119 search results - page 5 / 24
» Normal Forms for Knowledge Compilation
Sort
View
JSAT
2006
126views more  JSAT 2006»
13 years 7 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...
IJCAI
2007
13 years 9 months ago
Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi...
Shin-ichi Minato, Ken Satoh, Taisuke Sato
ICTAI
2008
IEEE
14 years 2 months ago
Layer Compression in Decision Diagrams
A number of compact representation forms that are investigated in the knowledge compilation community are utilized in interactive product configuration and other forms of decisio...
Tarik Hadzic, Esben Rune Hansen, Barry O'Sullivan
VLDB
1993
ACM
121views Database» more  VLDB 1993»
13 years 12 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis
IFL
2004
Springer
14 years 1 months ago
Shrinking Reductions in SML.NET
One performance-critical phase in the SML.NET compiler involves rewriting intermediate terms to monadic normal form and performing non-duplicating β-reductions. We present an impe...
Nick Benton, Andrew Kennedy, Sam Lindley, Claudio ...