3. FroCos 2000: Nancy, France

@proceedings{DBLP:conf/frocos/2000,
  editor    = {H{\'e}l{\`e}ne Kirchner and
               Christophe Ringeissen},
  title     = {Frontiers of Combining Systems, Third International Workshop,
               FroCoS 2000, Nancy, France, March 22-24, 2000, Proceedings},
  booktitle = {FroCoS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1794},
  year      = {2000},
  isbn      = {3-540-67281-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Paper

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

Session 1

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

Invited Paper

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

Session 2

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

Session 3

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

Invited Paper

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

Session 4

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

Invited Paper

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

Session 5

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