Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CP
2000
Springer
11 years 8 months ago
Algebraic Simplification Techniques for Propositional Satisfiability
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
João P. Marques Silva
CP
2000
Springer
11 years 8 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
CP
2000
Springer
11 years 8 months ago
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
Luís Baptista, João P. Marques Silva
CP
2000
Springer
11 years 9 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
CP
2000
Springer
11 years 9 months ago
Linear Formulation of Constraint Programming Models and Hybrid Solvers
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
Philippe Refalo
CP
2000
Springer
11 years 9 months ago
Singleton Consistencies
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
Patrick Prosser, Kostas Stergiou, Toby Walsh
CP
2000
Springer
11 years 9 months ago
Practical Investigation of Constraints with Graph Views
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
Tobias Müller
CP
2000
Springer
11 years 9 months ago
Constraint-Based Agents: The ABC's of CBA's
The Constraint-Based Agent (CBA) framework is a set of tools for designing, simulating, building, verifying, optimizing, learning and debugging controllers for agents embedded in a...
Alan K. Mackworth
books