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 ...
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...
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,...
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...