The rise of nonlinear mathematical programming
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Acceleration methods of numeric CSPc
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Using “weaker” functions for constraint propagation over real numbers
Proceedings of the 1999 ACM symposium on Applied computing
A new basis for spreadsheet computing: Interval Solver for Microsoft Excel
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation
ACM Transactions on Mathematical Software (TOMS)
ACM SIGSOFT Software Engineering Notes
Symbolic-interval cooperation in constraint programming
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
A Constraint Satisfaction Approach to a Circuit Design Problem
Journal of Global Optimization
Progress in the Solving of a Circuit Design Problem
Journal of Global Optimization
Accelerating filtering techniques for numeric CSPs
Artificial Intelligence
Global Hull Consistency with Local Search for Continuous Constraint Solving
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
CLIP: A CLP(Intervals) Dialect for Metalevel Constraint Solving
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
A Control Language for Designing Constraint Solvers
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Interval Constraints: Results and Perspectives
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Solving Nonlinear Equations by Abstraction, Gaussian Elimination, and Interval Methods
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
A Note on Partial Consistencies over Continuous Domains
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Solving Constraints over Floating-Point Numbers
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Solving Nonlinear Systems by Constraint Inversion and Interval Arithmetic
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Continuous First-Order Constraint Satisfaction
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Declarative Modelling of Constraint Propagation Strategies
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Interval arithmetic and interval analysis: an introduction
Granular computing
Numerical solution for bounding feasible point sets
Journal of Computational and Applied Mathematics
Synthesis of efficient constraint-satisfaction programs
The Knowledge Engineering Review
Interval constraint solving for camera control and motion planning
ACM Transactions on Computational Logic (TOCL)
Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques
ACM Transactions on Mathematical Software (TOMS)
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science
Efficient solving of quantified inequality constraints over the real numbers
ACM Transactions on Computational Logic (TOCL)
A constraint solver for model-based engineering
AI Communications
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Search heuristics for constraint-aided embodiment design
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Artificial Intelligence
Constraint Reasoning for Differential Models
Proceedings of the 2005 conference on Constraint Reasoning for Differential Models
Model-Based Failure Analysis with RODON
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
ICOS: a branch and bound based solver for rigorous global optimization
Optimization Methods & Software - GLOBAL OPTIMIZATION
Numerica: a modeling language for global optimization
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Exploiting single-cycle symmetries in continuous constraint problems
Journal of Artificial Intelligence Research
Extending consistent domains of numeric CSP
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Search strategies for an anytime usage of the branch and prune algorithm
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Box consistency through adaptive shaving
Proceedings of the 2010 ACM Symposium on Applied Computing
Hull consistency under monotonicity
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Canonical dual least square method for solving general nonlinear systems of quadratic equations
Computational Optimization and Applications
Gröbner bases for polynomial systems with parameters
Journal of Symbolic Computation
Including ordinary differential equations based constraints in the standard CP framework
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A box-consistency contractor based on extremal functions
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A safe and flexible CP-based approach for velocity tuning problems
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Integrating ICP and LRA solvers for deciding nonlinear real arithmetic problems
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Efficient pruning technique based on linear relaxations
COCOS'03 Proceedings of the Second international conference on Global Optimization and Constraint Satisfaction
δ-complete decision procedures for satisfiability over the reals
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Engineering Applications of Artificial Intelligence
Adaptive bisection of numerical CSPs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A branch and prune algorithm for the computation of generalized aspects of parallel robots
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Feedback-directed unit test generation for C/C++ using concolic execution
Proceedings of the 2013 International Conference on Software Engineering
Hi-index | 0.01 |
This paper presents {\tt Newton}, a branch and prune algorithm used to find all isolated solutions of a system of polynomial constraints. {\tt Newton} can be characterized as a global search method which uses intervals for numerical correctness and for pruning the search space early. The pruning in {\tt Newton} consists of enforcing at each node of the search tree a unique local consistency condition, called box-consistency, which approximates the notion of arc-consistency well known in artificial intelligence. Box-consistency is parametrized by an interval extension of the constraint and can be instantiated to produce the Hansen--Sengupta narrowing operator (used in interval methods) as well as new operators which are more effective when the computation is far from a solution. {\tt Newton} has been evaluated on a variety of benchmarks from kinematics, chemistry, combustion, economics, and mechanics. On these benchmarks, it outperforms the interval methods we are aware of and compares well with \textit{state-of-the-art} continuation methods. Limitations of {\tt Newton} (e.g., a sensitivity to the size of the initial intervals on some problems) are also discussed. Of particular interest is the mathematical and programming simplicity of the method.