Sciweavers

23 search results - page 4 / 5
» A Tractable First-Order Probabilistic Logic
Sort
View
DLOG
2011
12 years 9 months ago
The Complexity of Probabilistic EL
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
Jean Christoph Jung, Víctor Gutiérre...
SEMWEB
2005
Springer
13 years 11 months ago
Statistical Reasoning - A Foundation for Semantic Web Reasoning
There has been considerable debate as to the merits and the applicability of probabilistic or statistical reasoning to Semantic Web. Much of this debate seems to have centered on ...
Shashi Kant, Evangelos Mamas
DMIN
2006
83views Data Mining» more  DMIN 2006»
13 years 7 months ago
On Novelty Evaluation of Potentially Useful Patterns
- As is generally accepted, the most important feature that a Knowledge Discovery in Database (KDD) system must possess is, to be able to discover patterns that are "novel&quo...
Ying Xie, Manmathasivaram Nagarajan, Vijay V. Ragh...
JMLR
2010
137views more  JMLR 2010»
13 years 17 days ago
HOP-MAP: Efficient Message Passing with High Order Potentials
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
Daniel Tarlow, Inmar Givoni, Richard S. Zemel
JAIR
2008
148views more  JAIR 2008»
13 years 5 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang