Sciweavers

SYNTHESE
2010
88views more  SYNTHESE 2010»
12 years 11 months ago
Proposition-valued random variables as information
The notion of a proposition as a set of possible worlds or states occupies central stage in probability theory, semantics and epistemology, where it serves as the fundamental unit...
Richard Bradley
KBS
2011
81views more  KBS 2011»
12 years 11 months ago
Existential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (c...
Ken Kaneiwa
CORR
2011
Springer
151views Education» more  CORR 2011»
12 years 11 months ago
Temporal Probabilistic Logic Programs: State and Revision
There are numerous applications where we have to deal with temporal uncertainty associated with events. The Temporal Probabilistic (TP) Logic Programs should provide support for v...
Zoran Majkic
PVLDB
2010
126views more  PVLDB 2010»
13 years 2 months ago
Set Similarity Join on Probabilistic Data
Set similarity join has played an important role in many real-world applications such as data cleaning, near duplication detection, data integration, and so on. In these applicati...
Xiang Lian, Lei Chen 0002
TCS
2008
13 years 4 months ago
Absolute versus probabilistic classification in a logical setting
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
Sanjay Jain, Eric Martin, Frank Stephan
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 4 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 4 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
AAAI
2010
13 years 4 months ago
Inducing Probability Distributions from Knowledge Bases with (In)dependence Relations
When merging belief sets from different agents, the result is normally a consistent belief set in which the inconsistency between the original sources is not represented. As proba...
Jianbing Ma, Weiru Liu, Anthony Hunter
COLING
1994
13 years 5 months ago
Dynamic Logic With Possible World
This paper introduces a semantic theory I)I,PW, l)ynamic l,ogic with Possible World, which extends Groenendijk's I)PI, and Cresswell's Indices Semantics. The semantics c...
Ruzhan Lu
IJCAI
2001
13 years 5 months ago
Approximate inference for first-order probabilistic languages
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
Hanna Pasula, Stuart J. Russell