Frontiers of Combining Systems: Third International Workshop, FroCoS 2000, Nancy, France, March 22-24, 2000. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the Third International Workshop on Frontiers of Combining Systems, FroCoS 2000, held in Nancy, France, in March 2000.
The 14 revised full papers presented together with four invited papers were carefully reviewed and selected from a total of 31 submissions. Among the topics covered are constraint processing, interval narrowing, rewriting systems, proof planning, sequent calculus, type systems, model checking, theorem proving, declarative programming, logic programming, and equational theories.

Author(s): Alexander Bockmayr, Friedrich Eisenbrand (auth.), Hélène Kirchner, Christophe Ringeissen (eds.)
Series: Lecture Notes in Computer Science 1794 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000

Language: English
Pages: 298
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages

Front Matter....Pages -
Combining Logic and Optimization in Cutting Plane Theory....Pages 1-17
Towards Cooperative Interval Narrowing....Pages 18-31
Integrating Constraint Solving into Proof Planning....Pages 32-46
Termination of Constraint Contextual Rewriting....Pages 47-61
Axioms vs. Rewrite Rules: From Completeness to Cut Elimination....Pages 62-72
Normal Forms and Proofs in Combined Modal and Temporal Logics....Pages 73-87
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic....Pages 88-104
Handling Differential Equations with Constraints for Decision Support....Pages 105-120
Non-trivial Symbolic Computations in Proof Planning....Pages 121-135
Integrating Computer Algebra and Reasoning through the Type System of Aldor....Pages 136-150
Combinations of Model Checking and Theorem Proving....Pages 151-170
Compiling Multi-paradigm Declarative Programs into Prolog....Pages 171-185
Modular Redundancy for Theorem Proving....Pages 186-199
Composing and Controlling Search in Reasoning Theories Using Mappings....Pages 200-216
Why Combined Decision Problems Are Often Intractable....Pages 217-244
Congruence Closure Modulo Associativity and Commutativity....Pages 245-259
Combining Equational Theories Sharing Non-Collapse-Free Constructors....Pages 260-274
Comparing Expressiveness of Set Constructor Symbols....Pages 275-289
Back Matter....Pages -