Frontiers of combining systems. 3rd international workshop, FroCoS 2000, Nancy, France, March 22--24, 2000. Proceedings (Q1972826)

The articles of mathematical interest will be reviewed individually. The 1st workshop 1996 has been indicated (see Zbl 0885.00046). Indexed articles: \textit{Bockmayr, Alexander; Eisenbrand, Friedrich}, Combining logic and optimization in cutting plane theory, 1-17 [Zbl 0961.03012] \textit{Granvilliers, Laurent}, Towards cooperative interval narrowing, 18-31 [Zbl 0961.65048] \textit{Melis, Erica; Zimmer, Jürgen; Müller, Tobias}, Integrating constraint solving into proof planning, 32-46 [Zbl 0962.68151] \textit{Armando, Alessandro; Ranise, Silvio}, Termination of constraint contextual rewriting, 47-61 [Zbl 0971.68140] \textit{Dowek, Gilles}, Axioms vs. rewrite rules: From completeness to cut elimination, 62-72 [Zbl 0961.03013] \textit{Hustadt, U.; Dixon, C.; Schmidt, R. A.; Fisher, M.}, Normal forms and proofs in combined modal and temporal logics, 73-87 [Zbl 0964.03011] \textit{Lucio, Paqui}, Structured sequent calculi for combining intuitionistic and classical first-order logic, 88-104 [Zbl 0961.03008] \textit{Cruz, Jorge; Barahona, Pedro}, Handling differential equations with constraints for decision support, 105-120 [Zbl 0969.68668] \textit{Sorge, Volker}, Non-trivial symbolic computations in proof planning, 121-135 [Zbl 0962.68152] \textit{Poll, Erik; Thompson, Simon}, Integrating computer algebra and reasoning through the type systems of Aldor, 136-150 [Zbl 0962.68182] \textit{Uribe, Tomás E.}, Combinations of model checking and theorem proving, 151-170 [Zbl 0962.68110] \textit{Antoy, Sergio; Hanus, Michael}, Compiling multi-paradigm declarative programs into Prolog, 171-185 [Zbl 0969.68667] \textit{Bofill, Miquel; Godoy, Guillem; Nieuwenhuis, Robert; Rubio, Albert}, Modular redundancy for theorem proving, 186-199 [Zbl 0962.68153] \textit{Coglio, Alessandro; Giunchiglia, Fausto; Meseguer, José; Talcott, Carolyn L.}, Composing and controlling search in reasoning theories using mappings, 200-216 [Zbl 0965.68094] \textit{Schulz, Klaus U.}, Why combined decision problems are often intractable, 217-244 [Zbl 0961.03011] \textit{Bachmair, L.; Ramakrishnan, I. V.; Tiwari, A.; Vigneron, L.}, Congruence closure modulo associativity and commutativity, 245-259 [Zbl 0962.68085] \textit{Baader, Franz; Tinelli, Cesare}, Combining equational theories sharing non-collapse-free constructors, 260-274 [Zbl 0962.03037] \textit{Dovier, Agostino; Piazza, Carla; Policriti, Alberto}, Comparing expressiveness of set constructor symbols, 275-289 [Zbl 0961.03045]