Constraints in Computational Logics

This volume constitutes the proceedings of the First International Conference on Constraints in Computational Logics, CCL '94, held in Munich, Germany in September 1994. Besides abstracts or full papers of the 5 invited talks by senior researchers, the book contains revised versions of the 21 accepted research papers selected from a total of 52 submissions. The volume assembles high quality original papers covering major theoretical and practical issues of combining and extending programming paradigms, preferably by using constraints. The topics covered include symbolic constraints, set constraints, numerical constraints, multi-paradigm programming, combined calculi, constraints in rewriting, deduction, symbolic computations, and working systems.

Inhalt
Automated deduction with constraints.- Local simplification.- Simplifying clausal satisfiability problems.- Ordered Binary Decision Diagrams and the Davis-Putnam procedure.- A foundation for higher-order concurrent constraint programming.- Constraints for polymorphic behaviours of concurrent ML.- A confluent relational calculus for higher-order programming with constraints.- Modular AC unification of higher-order patterns.- Higher order disunification: Some decidable cases.- Syntactic AC-unification.- Applications of constraint logic programming.- Repeated redundant inequalities in constraint logic programming.- An efficient algorithm of logic programming with constraint hierarchy.- Application of constraint logic programming for VLSI CAD tools.- Path consistency in clp(FD).- Symbolic constraints and tree automata.- A record calculus with principal types.- ECOLOG: an Environment for constraint logics.- On modularity in term rewriting and narrowing.- Higher order conditional rewriting and narrowing.- Buchberger's algorithm: A constraint-based completion procedure.- Set constraints and logic programming.- Set constraints in some equational theories.- How to win a game with features.- Some new decidability results on positive and negative set constraints.- Solving simplification ordering constraints.