Solving mixed quantified constraints over a domain based on Real numbers and Herbrand terms

DOI10.1007/3-540-45788-7_6MaRDI QIDQ4409154zbMATH OpenFDO

Authors Miguel García-Díaz, Susana Nieva

Publication date 30 June 2003

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/2441/24410103.htm

zbMATH Keywords

constraint systemsfinite symbolic treesfirst-order logichereditary Harrop formulasreal numbers

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Efficient solving of quantified inequality constraints over the real numbers
• On constraint qualifications for mathematical programs with mixed complementarity constraints
• Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$
• On solving mixed-integer constraint satisfaction problems with unbounded variables
• Solving existentially quantified constraints with one equality and arbitrarily many inequalities
• Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• Solving linear constraints over real and rational fields
• scientific article; zbMATH DE number 1538621

Cited in

(2)

• scientific article; zbMATH DE number 2040978 (Why is no real title available?)
• Integration of quantifier elimination with constraint logic programming

This page was built for publication: Solving mixed quantified constraints over a domain based on \({\mathcal R}\)eal numbers and \({\mathcal H}\)erbrand terms

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