3. FroCos 2000: Nancy, France

Hélène Kirchner, Christophe Ringeissen (Eds.): Frontiers of Combining Systems, Third International Workshop, FroCoS 2000, Nancy, France, March 22-24, 2000, Proceedings. Lecture Notes in Computer Science 1794 Springer 2000, ISBN 3-540-67281-8

Invited Paper

Alexander Bockmayr, Friedrich Eisenbrand:
Combining Logic and Optimization in Cutting Plane Theory. 1-17

Session 1

Laurent Granvilliers:
Towards Cooperative Interval Narrowing. 18-31
Erica Melis, Jürgen Zimmer, Tobias Müller:
Integrating Constraint Solving into Proof Planning. 32-46
Alessandro Armando, Silvio Ranise:
Termination of Constraint Contextual Rewriting. 47-61

Invited Paper

Gilles Dowek:
Axioms vs. Rewrite Rules: From Completeness to Cut Elimination. 62-72

Session 2

Ullrich Hustadt, Clare Dixon, Renate A. Schmidt, Michael Fisher:
Normal Forms and Proofs in Combined Modal and Temporal Logics. 73-87
Paqui Lucio:
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic. 88-104

Session 3

Jorge Cruz, Pedro Barahona:
Handling Differential Equations with Constraints for Decision Support. 105-120
Volker Sorge:
Non-Trivial Symbolic Computations in Proof Planning. 121-135
Erik Poll, Simon J. Thompson:
Integrating Computer Algebra and Reasoning through the Type System of Aldor. 136-150

Invited Paper

Tomás E. Uribe:
Combinations of Model Checking and Theorem Proving. 151-170

Session 4

Sergio Antoy, Michael Hanus:
Compiling Multi-Paradigm Declarative Programs into Prolog. 171-185
Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio:
Modular Redundancy for Theorem Proving. 186-199
Alessandro Coglio, Fausto Giunchiglia, José Meseguer, Carolyn L. Talcott:
Composing and Controlling Search in Reasoning Theories Using Mappings. 200-216

Invited Paper

Klaus U. Schulz:
Why Combined Decision Problems Are Often Intractable. 217-244

Session 5

Leo Bachmair, I. V. Ramakrishnan, Ashish Tiwari, Laurent Vigneron:
Congruence Closure Modulo Associativity and Commutativity. 245-259
Franz Baader, Cesare Tinelli:
Combining Equational Theories Sharing Non-Collapse-Free Constructors. 260-274
Agostino Dovier, Carla Piazza, Alberto Policriti:
Comparing Expressiveness of Set Constructor Symbols. 275-289

Last update Thu May 23 16:49:47 2013 CET by the DBLP Team —

This material is Open Data

Data released under the ODC-BY 1.0 license — See also our legal information page