1995•Medical Entomology and ZoologyRequires access

Principles and Practice of Constraint Programming - CP '95: First International Conference, CP '95, Cassis, France, September 19 - 22, 1995. Proceedings

Ugo Montanari, Francesca Rossi

Open publisher page 1 citations

Abstract

Complete solving of linear Diophantine equations and inequations without adding variables.- From Elliott-MacMahon to an algorithm for general linear constraints on naturals.- The progressive party problem: Integer linear programming and constraint programming compared.- From local to global consistency in temporal constraint networks.- Scaling effects in the CSP phase transition.- Asynchronous weak-commitment search for solving distributed constraint satisfaction problems.- Optimization-based heuristics for maximal constraint satisfaction.- First-order definability over constraint databases.- On similarity queries for time-series data: Constraint specification and implementation.- Safe stratified datalog with integer order programs.- Constrained dependencies.- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic.- Debugging constraint programs.- An optimizing compiler for CLP(?).- Local and global relational consistency.- Dynamic variable ordering in CSPs.- A unifying framework for tractable constraints.- On the forward checking algorithm.- A confluent calculus for concurrent constraint programming with guarded choice.- Situated simplification.- Guarded constructive disjunction: Angel or demon?.- Domain independent ask approximation in CCP.- On the combination of symbolic constraints, solution domains, and constraint solvers.- Constraint propagation in model generation.- Normalizing narrowing for weakly terminating and confluent systems.- On termination of constraint logic programs.- Modelling producer/consumer constraints.- A constraint-based approach to diagnosing software problems in computer networks.- Solving crew scheduling problems by constraint programming.- A visual constraint-programming environment.- Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam's procedure?.- Improved branch and bound in constraint logic programming.- Reducing domains for search in CLP(FD) and its application to job-shop scheduling.- What is symbolic computation?.- Constraint solving for combinatorial search problems: A tutorial.- The concurrent constraint programming research programmes.- Automatic generation of invariants and intermediate assertions.- The OTI constraint solver: A constraint library for constructing interactive graphical user interfaces.- Model-based computing: Using concurrent constraint programming for modeling and model compilation.- CLP in ECRC.- Constraint programming and industrial applications.- The CHIP system and its applications.- Applications of constraint programming.

About this research paper

What this paper is about

Complete solving of linear Diophantine equations and inequations without adding variables.- From Elliott-MacMahon to an algorithm for general linear constraints on naturals.- The progressive party problem: Integer linear programming and constraint programming compared.- From local to global consistency in temporal constraint networks.- Scaling effects in the CSP phase transition.- Asynchronous weak-commitment search for solving distributed constraint satisfaction problems.- Optimization-based heuristics for maximal constraint satisfaction.- First-order definability over constraint databases.- On similarity queries for time-series data: Constraint specification and implementation.- Safe stratified datalog with integer order programs.- Constrained dependencies.- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic.- Debugging constraint programs.- An optimizing compiler for CLP(?).- Local and global relational consistency.- Dynamic variable ordering in CSPs.- A unifying framework for tractable constraints.- On the forward checking algorithm.- A confluent calculus for concurrent constraint programming with guarded choice.- Situated simplification.- Guarded constructive disjunction: Angel or demon?.- Domain independent ask approximation in CCP.- On the combination of symbolic constraints, solution domains, and constraint solvers.- Constraint propagation in model generation.- Normalizing narrowing for weakly terminating and confluent systems.- On termination of constraint logic programs.- Modelling producer/consumer constraints.- A constraint-based approach to diagnosing software problems in computer networks.- Solving crew scheduling problems by constraint programming.- A visual constraint-programming environment.- Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam's procedure?.- Improved branch and bound in constraint logic programming.- Reducing domains for search in CLP(FD) and its application to job-shop scheduling.- What is symbolic computation?.- Constraint solving for combinatorial search problems: A tutorial.- The concurrent constraint programming research programmes.- Automatic generation of invariants and intermediate assertions.- The OTI constraint solver: A constraint library for constructing interactive graphical user interfaces.- Model-based computing: Using concurrent constraint programming for modeling and model compilation.- CLP in ECRC.- Constraint programming and industrial applications.- The CHIP system and its applications.- Applications of constraint programming.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Complete solving of linear Diophantine equations and inequations without adding variables.- From Elliott-MacMahon to an algorithm for general linear constraints on naturals.- The progressive party problem: Integer linear programming and constraint programming compared.- From local to global consistency in temporal constraint networks.- Scaling effects in the CSP phase transition.- Asynchronous weak-commitment search for solving distributed constraint satisfaction problems.- Optimization-based heuristics for maximal constraint satisfaction.- First-order definability over constraint databases.- On similarity queries for time-series data: Constraint specification and implementation.- Safe stratified datalog with integer order programs.- Constrained dependencies.- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic.- Debugging constraint programs.- An optimizing compiler for CLP(?).- Local and global relational consistency.- Dynamic variable ordering in CSPs.- A unifying framework for tractable constraints.- On the forward checking algorithm.- A confluent calculus for concurrent constraint programming with guarded choice.- Situated simplification.- Guarded constructive disjunction: Angel or demon?.- Domain independent ask approximation in CCP.- On the combination of symbolic constraints, solution domains, and constraint solvers.- Constraint propagation in model generation.- Normalizing narrowing for weakly terminating and confluent systems.- On termination of constraint logic programs.- Modelling producer/consumer constraints.- A constraint-based approach to diagnosing software problems in computer networks.- Solving crew scheduling problems by constraint programming.- A visual constraint-programming environment.- Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam's procedure?.- Improved branch and bound in constraint logic programming.- Reducing domains for search in CLP(FD) and its application to job-shop scheduling.- What is symbolic computation?.- Constraint solving for combinatorial search problems: A tutorial.- The concurrent constraint programming research programmes.- Automatic generation of invariants and intermediate assertions.- The OTI constraint solver: A constraint library for constructing interactive graphical user interfaces.- Model-based computing: Using concurrent constraint programming for modeling and model compilation.- CLP in ECRC.- Constraint programming and industrial applications.- The CHIP system and its applications.- Applications of constraint programming.

Key concepts: Constraint programming, Constraint logic programming, Concurrent constraint logic programming, Constraint satisfaction, Constraint satisfaction problem, Binary constraint, Local consistency, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Principles and Practice of Constraint Programming - CP '95: First International Conference, CP '95, Cassis, France, September 19 - 22, 1995. Proceedings — Research Paper | ScholarLens