Sciweavers

1300 search results - page 27 / 260
» Probabilistic logic with independence
Sort
View
APAL
2005
73views more  APAL 2005»
13 years 8 months ago
Finite information logic
We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) move...
Rohit Parikh, Jouko A. Väänänen
CONCUR
2004
Springer
14 years 2 months ago
Modular Construction of Modal Logics
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavi...
Corina Cîrstea, Dirk Pattinson
ICDE
2012
IEEE
199views Database» more  ICDE 2012»
11 years 11 months ago
Physically Independent Stream Merging
—A facility for merging equivalent data streams can support multiple capabilities in a data stream management system (DSMS), such as query-plan switching and high availability. O...
Badrish Chandramouli, David Maier, Jonathan Goldst...
CONCUR
2001
Springer
14 years 1 months ago
Probabilistic Information Flow in a Process Algebra
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
Alessandro Aldini
ICLP
2009
Springer
14 years 9 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...