Sciweavers

155 search results - page 21 / 31
» Non-Determinism in Deductive Databases
Sort
View
ICDT
2010
ACM
195views Database» more  ICDT 2010»
14 years 1 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich
DEXAW
2006
IEEE
151views Database» more  DEXAW 2006»
14 years 3 months ago
Avenues to Flexible Data Integrity Checking
Traditional methods for integrity checking in relational or deductive databases heavily rely on the assumption that data have integrity before the execution of updates. In this wa...
Hendrik Decker, Davide Martinenghi
IJCAI
2003
13 years 11 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
APLAS
2005
ACM
14 years 3 months ago
Using Datalog with Binary Decision Diagrams for Program Analysis
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
John Whaley, Dzintars Avots, Michael Carbin, Monic...
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 11 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm