Sciweavers

6597 search results - page 49 / 1320
» Orderings and Types in Databases
Sort
View
ITP
2010
165views Mathematics» more  ITP 2010»
13 years 11 months ago
A Mechanized Translation from Higher-Order Logic to Set Theory
Abstract. In order to make existing formalizations available for settheoretic developments, we present an automated translation of theories from Isabelle/HOL to Isabelle/ZF. This c...
Alexander Krauss, Andreas Schropp
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 11 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
CADE
2008
Springer
14 years 8 months ago
THF0 - The Core of the TPTP Language for Higher-Order Logic
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
Christoph Benzmüller, Florian Rabe, Geoff Sut...
ICDE
2000
IEEE
116views Database» more  ICDE 2000»
14 years 9 months ago
Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering
Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database appl...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
IJCAI
2003
13 years 9 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