Frontiers of combining systems : third international workshop, FroCoS 2000, Nancy, France, March 22-24, 2000 : proceedings
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science. Lecture notes in artificial intelligence
1794 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Frontiers of combining systems, third international workshop, FroCoS 2000, Nancy, France, March 22-24, 2000, proceedings, Hélène Kirchner, Christophe Ringeissen (eds.), 2000, Berlin, Springer, 1 vol. (X-289 p.), Lecture notes in computer science, 3-540-67281-8 • Frontiers of Combining Systems, Texte imprimé, 9783662172179 |
Tabla de Contenidos:
- 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.