Heuristic search and pruning in polynomial constraints satisfaction

DOI10.1023/A:1018911907086zbMath0880.68069OpenAlexW1567972467MaRDI QIDQ1370613

Hoon Hong

Publication date: 7 January 1998

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018911907086

zbMATH Keywords

algebraic algorithmsatisfiability of polynomial constraints

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) General topics in artificial intelligence (68T01)

Related Items (2)

Numerical solution for bounding feasible point sets ⋮ A hybrid global optimization method: The multi-dimensional case

Uses Software

• Unnamed Item

This page was built for publication: Heuristic search and pruning in polynomial constraints satisfaction