An incremental algorithm for DLO quantifier elimination via constraint propagation

DOI10.1016/J.ARTINT.2004.05.011MaRDI QIDQ814643zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Constraint databasesConstraint propagationQuantifier elimination

Mathematics Subject Classification ID

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)

Recommendations

• Linear Quantifier Elimination
• New results on quantifier elimination over real closed fields and applications to constraint databases
• Advances in Databases and Information Systems
• Linear quantifier elimination
• A Quantifier Elimination Algorithm for Linear Real Arithmetic

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 729555 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• scientific article; zbMATH DE number 1821697 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• 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
• The minimum equivalent DNF problem and shortest implicants

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)