Sciweavers

1407 search results - page 95 / 282
» Join-Graph Propagation Algorithms
Sort
View
AAAI
1994
13 years 10 months ago
Temporal Reasoning with Constraints on Fluents and Events
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...
Eddie Schwalb, Kalev Kask, Rina Dechter
ICML
2003
IEEE
14 years 9 months ago
Link-based Classification
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...
Qing Lu, Lise Getoor
SEMWEB
2007
Springer
14 years 3 months ago
Using the Dempster-Shafer Theory of Evidence to Resolve ABox Inconsistencies
Abstract. Automated ontology population using information extraction algorithms can produce inconsistent knowledge bases. Confidence values assigned by the extraction algorithms m...
Andriy Nikolov, Victoria S. Uren, Enrico Motta, An...
LOPSTR
2004
Springer
14 years 2 months ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...
AAAI
2010
13 years 10 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek