Frontiers of Combining Systems: Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings / Edition 1by Helene Kirchner, Christophe Ringeissen
Pub. Date: 04/13/2000
Publisher: Springer Berlin Heidelberg
This book constitutes the refereed proceedings of the Third Internatio nal Workshop on Frontiers of Combining Systems, FroCoS 2000, held in N ancy, France, in March 2000. The 14 revised full papers presented toge ther with four invited papers were carefully reviewed and selected fro m a total of 31 submissions. Among the topics covered are constraint p rocessing;… See more details below
This book constitutes the refereed proceedings of the Third Internatio nal Workshop on Frontiers of Combining Systems, FroCoS 2000, held in N ancy, France, in March 2000. The 14 revised full papers presented toge ther with four invited papers were carefully reviewed and selected fro m a total of 31 submissions. Among the topics covered are constraint p rocessing; interval narrowing; rewriting systems; proof planning; sequ ent calculus; type systems; model checking; theorem proving; declarati ve programming; logic programming; and equational theories.
- Springer Berlin Heidelberg
- Publication date:
- Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence Series, #1794
- Edition description:
- Product dimensions:
- 9.21(w) x 6.14(h) x 0.64(d)
Table of Contents
Invited Paper.- Combining Logic and Optimization in Cutting Plane Theory.- Session 1.- Towards Cooperative Interval Narrowing.- Integrating Constraint Solving into Proof Planning.- Termination of Constraint Contextual Rewriting.- Invited Paper.- Axioms vs. Rewrite Rules: From Completeness to Cut Elimination.- Session 2.- Normal Forms and Proofs in Combined Modal and Temporal Logics.- Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic.- Session 3.- Handling Differential Equations with Constraints for Decision Support.- Non-trivial Symbolic Computations in Proof Planning.- Integrating Computer Algebra and Reasoning through the Type System of Aldor.- Invited Paper.- Combinations of Model Checking and Theorem Proving.- Session 4.- Compiling Multi-paradigm Declarative Programs into Prolog.- Modular Redundancy for Theorem Proving.- Composing and Controlling Search in Reasoning Theories Using Mappings.- Invited Paper.- Why Combined Decision Problems Are Often Intractable.- Session 5.- Congruence Closure Modulo Associativity and Commutativity.- Combining Equational Theories Sharing Non-Collapse-Free Constructors.- Comparing Expressiveness of Set Constructor Symbols.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >