A new polynomial-time algorithm for linear programming
Combinatorica
Unification in combinations of collapse-free theories with disjoint sets of function symbols
Proc. of the 8th international conference on Automated deduction
Explicit representation of terms defined by counter examples
Journal of Automated Reasoning
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Boolean unification - The story so far
Journal of Symbolic Computation
Equational problems anddisunification
Journal of Symbolic Computation
Automatic proofs by induction in theories without constructors
Information and Computation
A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
Satisfiability of systems of ordinal notations with the subterm property is decidable
Proceedings of the 18th international colloquium on Automata, languages and programming
Minimal solutions of linear diophantine systems: bounds and algorithms
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
A method for simultaneous search for refutations and models by equational constraint solving
Journal of Symbolic Computation
A new method for undecidability proofs of first order theories
Journal of Symbolic Computation
Set based program analysis
Simple LPO constraint solving methods
Information Processing Letters
An efficient incremental algorithm for solving systems of linear Diophantine equations
Information and Computation
Equational formulae with membership constraints
Information and Computation
A complete and recursive feature theory
Theoretical Computer Science
A fast method for finding the basis of nonnegative solutions to a linear Diophantine equation
Journal of Symbolic Computation
Combining decision algorithms for matching in the union of disjoint equational theories
Information and Computation
Feature trees over arbitrary structures
Specifying syntactic structures
Building constraint satisfaction problem solvers using rewrite rules and strategies
Fundamenta Informaticae - Special issue on foundations of constraint programming
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint Programming: Basics and Trends: 1994 Chatillon Spring School, Chantillon-Sur-Seine, France, May 16-20, 1994: Selected Papers
Proceedings of the First International Conference on Constraints in Computational Logics
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Solving Systems of Set Constraints using Tree Automata
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Combining Matching Algorithms: The Rectangular Case
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
The Negation Elimination from Syntactic Equational Formula is Decidable
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
General Solution of Systems of Linear Diophantine Equations and Inequations
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
A Foundation for Higher-order Concurrent Constraint Programming
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Associative-Commutative Unification
Proceedings of the 7th International Conference on Automated Deduction
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Combination Techniques for Non-Disjoint Equational Theories
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Higher-order Unification via Explicit Substitutions
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Some Notes on Rational Spaces
Constraints and constraint solving: an introduction
Constraints in computational logics
Constraints in computational logics
Generating Propagation Rules for Finite Domains: A Mixed Approach
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Proving Termination of Constraint Solver Programs
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Rule-Based Constraint Programming
Fundamenta Informaticae
| Hi-index | 0.00 |
Constraints are an effective toolto define sets of data by means of logical formulae. Our goalhere is to survey the notion of constraint system and to giveexamples of constraint systems operating on various domains,such as natural, rational or real numbers, finite domains, andterm domains. We classify the different methods used for solvingconstraints, syntactic methods based on transformations, semanticmethods based on adequate representations of constraints, hybridmethods combining transformations and enumerations. The conceptsand methods are illustrated via examples. We also discuss applicationsof constraints to various fields, such as programming, operationsresearch, and theorem proving.