Sciweavers

142 search results - page 20 / 29
» On the Existence of Answer Sets in Normal Extended Logic Pro...
Sort
View
ICDE
1992
IEEE
126views Database» more  ICDE 1992»
13 years 11 months ago
Logical Database Design with Inclusion Dependencies
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...
Tok Wang Ling, Cheng Hian Goh
ECSQARU
2007
Springer
14 years 1 months ago
Syntactic Propositional Belief Bases Fusion with Removed Sets
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
Julien Hué, Odile Papini, Eric Würbel
DLOG
2008
13 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
PODS
1995
ACM
139views Database» more  PODS 1995»
13 years 11 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
JAR
2007
142views more  JAR 2007»
13 years 7 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler