Integration of quantifier elimination with constraint logic programming

DOI10.1007/3-540-45470-5_4MaRDI QIDQ4808700zbMATH OpenFDO

Authors Thomas Sturm

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2385/23850007.htm

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Computer Algebra in Scientific Computing
• Constraint logic programming with polynomial constraints over finite domains
• Analytic constraint solving and interval arithmetic
• Solving mixed quantified constraints over a domain based on \({\mathcal R}\)eal numbers and \({\mathcal H}\)erbrand terms
• Real quantifier elimination in practice

Cited in

(5)

• Approximate quantified constraint solving by cylindrical box decomposition
• scientific article; zbMATH DE number 1253959 (Why is no real title available?)
• Hybrid Automata in Systems Biology: How Far Can We Go?
• Computer Algebra in Scientific Computing
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs

This page was built for publication: Integration of quantifier elimination with constraint logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808700)