Constraints in Computational Logics
Editat de Jean-Pierre Jouannauden Limba Engleză Paperback – 24 aug 1994
Preț: 326.68 lei
Preț vechi: 408.36 lei
-20%
Puncte Express: 490
Preț estimativ în valută:
57.77€ • 66.24$ • 49.93£
57.77€ • 66.24$ • 49.93£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540584032
ISBN-10: 354058403X
Pagini: 388
Ilustrații: IX, 371 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.59 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354058403X
Pagini: 388
Ilustrații: IX, 371 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.59 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.