Automated theorem proving

Autor:

Source: Wikipedia. Pages: 100. Chapters: Automated reasoning, Burrows-Abadi-Needham logic, Chaff algorithm, Computer-assisted proof, Concolic testing, Davis-Putnam algorithm, Delayed clause construction, DPLL algorithm, Geometry Expert, Harald Ganzinger,... Viac o knihe

Produkt je dočasne nedostupný

24.29 €

bežná cena: 27.60 €

O knihe

Source: Wikipedia. Pages: 100. Chapters: Automated reasoning, Burrows-Abadi-Needham logic, Chaff algorithm, Computer-assisted proof, Concolic testing, Davis-Putnam algorithm, Delayed clause construction, DPLL algorithm, Geometry Expert, Harald Ganzinger, Hilbert system, Interactive Theorem Proving (conference), IsaPlanner, Mathematics Mechanization and Automated Reasoning Platform, Method of analytic tableaux, Model elimination, Occurs check, Proof (truth), Proof assistant, Proof complexity, Propositional proof system, Reasoning system, Resolution (logic), Rippling, Semi-linear resolution, Sequent calculus, Substitution (logic), System on TPTP, Unification (computer science), Unit propagation. Excerpt: 241 article summaries including: Automated Theorem Proving for General Game Playing . Automated Theorem Proving - Resolution vs Tableaux . Machine learning and automated theorem proving . Aspects of the theory of containers within automated theorem proving . Computer Algebra meets Automated Theorem Proving: Integrating Maple and PVS . Stålmarck's Method for Automated Theorem Proving in First Order Logic . Automated Theorem-proving and Program Verification: An Annotated Bibliography . Appendices for automated theorem proving in Euler diagram systems . 20 Dependently Typed Programming based on Automated Theorem Proving . Decomposition Techniques and their Applications in Automated Theorem Proving . Higher-Order Automated Theorem Proving for Natural Language Semantics . External Sources of Axioms in Automated Theorem Proving . Chaining Techniques for Automated Theorem Proving in Many-Valued Logics . Differential dynamic logics - automated theorem proving for hybrid systems . Avoiding redundancy in compilers for automated theorem proving . Fundamental Results on Automated Theorem Proving by Test Set Induction . Automated theorem proving in support of computer algebra: symbolic definite integration as a case study . AN INTRODUCTION TO THE CONCEPTS AND TECHNIQUES OF AUTOMATED THEOREM-PROVING . 36 Reasoning in the OWL 2 Full Ontology Language using First-Order Automated Theorem Proving . A case study in automated theorem proving: A difficult problem about commutators . Searching for fixed point combinators by using automated theorem proving: A preliminary report . Challenge problems focusing on equality and combinatory logic: Evaluating automated theorem-proving programs . Contributions to automated-theorem-proving and formal methods with applications to control systems . Analysis of the use of semantic trees in automated theorem proving . Automated theorem-proving for the theories of partial and total ordering . Verifying B Proof Rules using Deep Embedding and Automated Theorem Proving . The role of heuristics in automated theorem proving: JA Robinson's resolution principle . The role of heuristics in automated theorem proving JA Robinson's resolution principle . A Coq-based Library for Interactive and Automated Theorem Proving in Plane Geometry . 56 Parametric mixed sequent calculus . Monotone sequent calculus and resolution . 63 A sequent calculus demonstration of Herbrand's theorem . 64 Intersection Logic in sequent calculus style . 66 A Sequent Calculus for Modelling Interferences . 67 Induction and Co-induction in Sequent Calculus . Exploiting non-canonicity in the sequent calculus . Logic programming and the intuitionistic sequent calculus . Cut-free double sequent calculus for S5 . 2-Sequent Calcul...

  • Vydavateľstvo: Books LLC, Reference Series
  • Formát: Paperback
  • Jazyk:
  • ISBN: 9781156765098

Generuje redakčný systém BUXUS CMS spoločnosti ui42.