10th International Conference on Automated Deduction : Kaiserslautern, FRG, July 24-27, 1990 : proceedings

This volume contains the papers presented at the 10th International Conference on Automated Deduction (CADE-10). CADE is the major forum at which research on all aspects of automated deduction is presented. Although automated deduction research is also presented at more general artificial intelligen...

תיאור מלא

שמור ב:
מידע ביבליוגרפי
מחבר ראשי: Stickel, Mark E.
מחבר תאגידי: International conference on automated deduction (Auteur)
פורמט: Livre numérique
שפה:Anglais
יצא לאור: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
סדרה:Lecture notes in computer science. Lecture notes in artificial intelligence 449
נושאים:
גישה מקוונת:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
הערה: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27, 1990, proceedings, M.E. Stickel (Ed.), Berlin, Springer-Verlag, 1990, 1 vol. (XVI-688 p.), Lecture notes in computer science, 0-387-52885-7
• 10th International Conference on Automated Deduction, Texte imprimé, 9783662171035
תוכן הענינים:
  • A theorem prover for a computational logic
  • A complete semantic back chaining proof system
  • Parallelizing the closure computation in automated deduction
  • Partheo: A high-performance parallel theorem prover
  • Substitution-based compilation of extended rules in deductive databases
  • Automatic theorem proving in paraconsistent logics: Theory and implementation
  • Case-free programs: An abstraction of definite horn programs
  • Generalized well-founded semantics for logic programs
  • Tactical theorem proving in program verification
  • Extensions to the rippling-out tactic for guiding inductive proofs
  • Guiding induction proofs
  • Term rewriting induction
  • A resolution principle for clauses with constraints
  • Str+ve