An incremental algorithm for DLO quantifier elimination via constraint propagation
DOI10.1016/J.ARTINT.2004.05.011zbMATH Open1086.03010OpenAlexW2013162904MaRDI QIDQ814643FDOQ814643
Authors: Matti Nykänen
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
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Database theory (68P15) Mechanization of proofs and logical operations (03B35) Quantifier elimination, model completeness, and related topics (03C10)
Cites Work
- Title not available (Why is that?)
- The minimum equivalent DNF problem and shortest implicants
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Transitive Reduction of a Directed Graph
- Title not available (Why is that?)
- New results on quantifier elimination over real closed fields and applications to constraint databases
- Purely Functional Data Structures
- Database query languages embedded in the typed lambda calculus
- Title not available (Why is that?)
This page was built for publication: An incremental algorithm for DLO quantifier elimination via constraint propagation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814643)