Generating functionology
A shorter model theory
Purely functional data structures
Purely functional data structures
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
Hi-index | 0.00 |
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.