Research Note: An incremental algorithm for DLO quantifier elimination via constraint propagation

Authors:
Matti Nykänen
Affiliations:
Department of Computer Science, P.O. Box 68 (Gustaf Hällströmin katu 2B), FIN-00014 University of Helsinki, Finland
Venue:
Artificial Intelligence
Year:
2004

Citing 9
Cited 0

Generating functionology

Generating functionology
A shorter model theory

A shorter model theory
Purely functional data structures

Purely functional data structures
New results on quantifier elimination over real closed fields and applications to constraint databases

Journal of the ACM (JACM)
Programming language pragmatics

Programming language pragmatics
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
The minimum equivalent DNF problem and shortest implicants

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Constraint Processing

Constraint Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first-order logical theory of dense linear order has long been known to admit quantifier elimination. This paper develops an explicit algorithm that yields an equivalent quantifier free form of its input formula. This algorithm performs existential quantifier elimination via constraint propagation. The result is computed incrementally using functional programming techniques. This approach may be of interest in implementing query languages for constraint databases.