Sciweavers

23 search results - page 1 / 5
» A Tractable First-Order Probabilistic Logic
Sort
View
AAAI
2012
11 years 6 months ago
A Tractable First-Order Probabilistic Logic
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Pedro Domingos, William Austin Webb
IJCAI
2003
13 years 5 months ago
A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases
In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was suffici...
Yongmei Liu, Hector J. Levesque
DLOG
2009
13 years 2 months ago
On Correspondences between Probabilistic First-Order and Description Logics
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...
Pavel Klinov, Bijan Parsia, Ulrike Sattler
TIME
2008
IEEE
13 years 10 months ago
Practical First-Order Temporal Reasoning
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variet...
Clare Dixon, Michael Fisher, Boris Konev, Alexei L...
ECAI
2010
Springer
13 years 5 months ago
ProbLog Technology for Inference in a Probabilistic First Order Logic
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. The paper defines a semantics for FOPro...
Maurice Bruynooghe, Theofrastos Mantadelis, Angeli...