1 option
Frontiers of Combining Systems : Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings / edited by Helene Kirchner, Christophe Ringeissen.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 1794.
- Lecture Notes in Artificial Intelligence ; 1794
- Language:
- English
- Subjects (All):
- Logic, Symbolic and mathematical.
- Artificial intelligence.
- Mathematical Logic and Foundations.
- Artificial Intelligence.
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Mathematical Logic and Foundations.
- Artificial Intelligence.
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (X, 298 pages).
- Edition:
- First edition 2000.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
- System Details:
- text file PDF
- 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
- 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
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-46421-1
- 9783540464211
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.