An incremental algorithm for DLO quantifier elimination via constraint propagation
From MaRDI portal
Publication:814643
DOI10.1016/j.artint.2004.05.011zbMath1086.03010OpenAlexW2013162904MaRDI QIDQ814643
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2004.05.011
Database theory (68P15) Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Quantifier elimination, model completeness, and related topics (03C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum equivalent DNF problem and shortest implicants
- Database query languages embedded in the typed lambda calculus
- New results on quantifier elimination over real closed fields and applications to constraint databases
- Purely Functional Data Structures
- The Transitive Reduction of a Directed Graph
This page was built for publication: An incremental algorithm for DLO quantifier elimination via constraint propagation
