Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=958

• Interactive theorem proving and computer algebra
  Johannes Ueberberg
  Lecture Notes in Computer Science 958, 1995, pp. 1-9
• A practical algorithm for geometric theorem proving
  Ashutosh Rege, John Canny
  Lecture Notes in Computer Science 958, 1995, pp. 10-17
• Combining theorem proving and symbolic mathematical computing
  Karsten Homann, Jacques Calmet
  Lecture Notes in Computer Science 958, 1995, pp. 18-29
• Tools for solving problems in the scope of algebraic programming
  Y.V. Kapitonova, A.A. Letichevsky, M.S. L'vov, V.A. Volkov
  Lecture Notes in Computer Science 958, 1995, pp. 30-47
• Planning a proof of the intermediate value theorem
  Myles Chippendale
  Lecture Notes in Computer Science 958, 1995, pp. 48-63
• A general technique for automatically optimizing programs through the use of proof plans
  Peter Madden, Ian Green
  Lecture Notes in Computer Science 958, 1995, pp. 64-79
• Datalog and TwoGroups and C++
  Greg Butler
  Lecture Notes in Computer Science 958, 1995, pp. 80-92
• Linear logic and real closed fields: A way to handle situations dynamically
  Pierre Jumpertz
  Lecture Notes in Computer Science 958, 1995, pp. 93-114
• A proof environment for arithmetic with the omega rule
  Siami Baker, Alan Smaill
  Lecture Notes in Computer Science 958, 1995, pp. 115-130
• Using commutativity properties for controlling coercions
  Stephan A. Missura, Andreas Weber
  Lecture Notes in Computer Science 958, 1995, pp. 131-143
• Theories = signatures + propositions used as types
  Stephan A. Missura
  Lecture Notes in Computer Science 958, 1995, pp. 144-155
• The ideal structure of Gröbner base computations
  Stéphane Collart, Daniel Mall
  Lecture Notes in Computer Science 958, 1995, pp. 156-166
• Modeling cooperating agents scenarios by deductive planning methods and logical fiberings
  Jochen Pfalzgraf, Ute Cornelia Sigmund, Karel Stokkermans
  Lecture Notes in Computer Science 958, 1995, pp. 167-190
• Propagation of mathematical constraints in subdefinite models
  Vitaly Telerman
  Lecture Notes in Computer Science 958, 1995, pp. 191-208
• Combining computer algebra and rule based reasoning
  Reinhard Bündgen
  Lecture Notes in Computer Science 958, 1995, pp. 209-223
• Algebraic specification of empirical inductive learning methods based on rough sets and matroid theory
  Shusako Tsumoto, Hiroshi Tanaka
  Lecture Notes in Computer Science 958, 1995, pp. 224-243
• Subsymbolic processing using adaptive algorithms
  David J. Nettleton, Roberto Garigliano
  Lecture Notes in Computer Science 958, 1995, pp. 244-254
• An interpretation of the propositional Boolean algebra as a k-algebra. effective calculus
  Luis M. Laita, Luis de Ledesma, Eugenio Roanes-Lozano, Eugenio Roanes-Macías
  Lecture Notes in Computer Science 958, 1995, pp. 255-263
• Subdefinite computations and symbolic transformations in the UniCalc solver
  Alexander Semenov, Alexander Babichev, Alexander Leshchenko
  Lecture Notes in Computer Science 958, 1995, pp. 264-275