2. AISMC 1994: Cambridge, UK

@proceedings{DBLP:conf/aisc/1994,
  editor    = {Jacques Calmet and
               John A. Campbell},
  title     = {Integrating Symbolic Mathematical Computation and Artificial
               Intelligence, Second International Conference, AISMC-2, Cambridge,
               UK, August 3-5, 1994, Selected Papers},
  booktitle = {AISCM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {958},
  year      = {1995},
  isbn      = {3-540-60156-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Johannes Ueberberg: Interactive Theorem Proving and Computer Algebra. 1-9 BibTeX
• Ashutosh Rege, John F. Canny: A Practical Algorithm for Geometric Theorem Proving. 10-17 BibTeX
• Karsten Homann, Jacques Calmet: Combining Theorem Proving and Symbolic Mathematical Computing. 18-29 BibTeX
• Y. V. Kapitonova, Alexander A. Letichevsky, Vladislav A. Volkov, M. S. Lvov: Tools for Solving Problems in the Scope of Algebraic Programming. 30-47 BibTeX
• Myles Chippendale: Planning a Proof of the Intermediate Value Theorem. 48-63 BibTeX
• Peter Madden, Ian Green: A General Technique for Automatically Optimizing Programs Through the Use of Proof Plans. 64-79 BibTeX
• Gregory Butler: Datalog and TwoGroups and C++. 80-92 BibTeX
• Pierre Jumpertz: Linear Logic and Real Closed Fields: a Way to Handle Situations Dynamically. 93-114 BibTeX
• Siani Baker, Alan Smaill: A Proof Environment for Arithmetic with the Omega Rule. 115-130 BibTeX
• Stephan A. Missura, Andreas Weber: Using Commutativity Properties for Controlling Coercions. 131-143 BibTeX
• Stephan A. Missura: Theories = Signatures + Propositions Used as Types. 144-155 BibTeX
• Stéphane Collart, Daniel Mall: The Ideal Structure of Gröbner Base Computations. 156-166 BibTeX
• Jochen Pfalzgraf, Ute Cornelia Sigmund, Karel Stokkermans: Modeling Cooperating Agents Scenarios by Deductive Planning Methods and Logical Fiberings. 167-190 BibTeX
• Vitaly Telerman: Propagation of Mathematical Constraints in Subdefinite Models. 191-208 BibTeX
• Reinhard Bündgen: Combining Computer Algebra and Rule Based Reasoning. 209-223 BibTeX
• Shusaku Tsumoto, Hiroshi Tanaka: Algebraic Specification of Empirical Inductive Learning Methods based on Rough Sets and Matroid Theory. 224-243 BibTeX
• David J. Nettleton, Roberto Garigliano: Subsymbolic Processing using Adaptive Algorithms. 244-254 BibTeX
• Luis M. Laita, Luis de Ledesma, Eugenio Roanes-Lozano, Eugenio Roanes-Macías: An Interpretation of the Propositional Boolean Algebra as k-algebra. Effective Calculus. 255-263 BibTeX
• Alexander Semenov, Alexander Babichev, Alexander Leshchenko: Subdefinite Computations and Symbolic Transformations in the UniCalc Solver. 264-275 BibTeX