Sciweavers

330 search results - page 6 / 66
» Algorithms for Propositional Model Counting
Sort
View
81
Voted
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
15 years 9 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
IPPS
2007
IEEE
15 years 3 months ago
Performance Analysis of a Family of WHT Algorithms
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
Michael Andrews, Jeremy Johnson
DAM
1999
100views more  DAM 1999»
14 years 9 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
LFCS
2009
Springer
15 years 4 months ago
Temporalization of Probabilistic Propositional Logic
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
Pedro Baltazar, Paulo Mateus
ATAL
2004
Springer
15 years 2 months ago
Mapping Mental States into Propositional Planning
Most BDI agent architectures rely on plan libraries in order to ensure bounded time for means-ends reasoning. Nevertheless, the usage of fast planning algorithms to provide the ag...
Felipe Rech Meneguzzi, Avelino F. Zorzo, Michael C...