Sciweavers

2138 search results - page 54 / 428
» Logics for the Relational Syllogistic
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 8 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
JACM
2000
81views more  JACM 2000»
13 years 7 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
TIME
2007
IEEE
14 years 2 months ago
Temporalising Tractable Description Logics
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
Alessandro Artale, Roman Kontchakov, Carsten Lutz,...
AAAI
2010
13 years 9 months ago
Structure Learning for Markov Logic Networks with Many Descriptive Attributes
Many machine learning applications that involve relational databases incorporate first-order logic and probability. Markov Logic Networks (MLNs) are a prominent statistical relati...
Hassan Khosravi, Oliver Schulte, Tong Man, Xiaoyua...
MFCS
2000
Springer
13 years 11 months ago
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
The probability of a property on the collection of all finite relational structures is the limit as
Phokion G. Kolaitis, Moshe Y. Vardi