Result: Quantifier-elimination for the first-order theory of Boolean algebras with linear cardinality constraints
Title:
Quantifier-elimination for the first-order theory of Boolean algebras with linear cardinality constraints
Authors:
Source:
ADBIS 2004 : advances in databases and information systems (Budapest, 22-25 September 2004)Lecture notes in computer science. :1-21
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 56 ref
Original Material:
INIST-CNRS
Subject Terms:
Documentation, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Algèbre Boole, Boolean algebra, Algebra Boole, Algèbre relationnelle, Relational algebra, Algebra relacional, Base donnée relationnelle, Relational database, Base relacional dato, Base donnée, Database, Base dato, Contrainte égalité, Equality constraint, Constreñimiento igualdad, Interrogation base donnée, Database query, Interrogación base datos, Logique booléenne, Boolean logic, Lógica booleana, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Recherche information, Information retrieval, Búsqueda información, Système information, Information system, Sistema información, Base donnée avec contrainte, Constrained database, Base dato forzada, Elimination quantificateur, Quantifier elimination, Eliminación cuentificador
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588, United States
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16177699
Database:
PASCAL Archive
Further Information
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 Boolean algebras of sets, this is a new generalization of Boole's well-known variable elimination method for conjunctions of Boolean equality constraints. We also explain the connection of this new logical result with the evaluation of relational calculus queries on constraint databases that contain Boolean linear cardinality constraints.