• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Nyheter
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Pocketböcker
  • Spel & pussel

10% rabatt på allt med kod: NYSTART10 →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Naturvetenskap och teknik
    2. Matematik och naturvetenskap
    3. Matematik
    4. Matematikens grunder

    Symbolic Logic and Mechanical Theorem Proving

    AvChin-Liang Chang,Richard Char-Tung Lee

    Inbunden, Engelska, 1973

    667 kr

    Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

    Fler format och utgåvor

    Häftad

    554 kr

    Beskrivning

    This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.

    Produktinformation

    • Utgivningsdatum:1973-06-15
    • Mått:152 x 229 x 29 mm
    • Vikt:640 g
    • Format:Inbunden
    • Språk:Engelska
    • Antal sidor:331
    • Förlag:Elsevier Science
    • ISBN:9780121703509

    Utforska kategorier

    • Matematikens grunder inom Naturvetenskap och teknik

    Innehållsförteckning

    • PrefaceAcknowledgments1. Introduction1.1 Artificial Intelligence, Symbolic Logic, and Theorem Proving1.2 Mathematical BackgroundReferences2. The Propositional Logic2.1 Introduction2.2 Interpretations of Formulas in the Propositional Logic2.3 Validity and Inconsistency in the Propositional Logic2.4 Normal Forms in the Propositional Logic2.5 Logical Consequences2.6 Applications of the Propositional LogicReferencesExercises3. The First-Order Logic3.1 Introduction3.2 Interpretations of Formulas in the First-Order Logic3.3 Prenex Normal Forms in the First-Order Logic3.4 Applications of the First-Order LogicReferencesExercises4. Herbrand's Theorem4.1 Introduction4.2 Skolem Standard Forms4.3 The Herbrand Universe of a Set of Clauses4.4 Semantic Trees4.5 Herbrand's Theorem4.6 Implementation of Herbrand's TheoremReferencesExercises5. The Resolution Principle5.1 Introduction5.2 The Resolution Principle for the Propositional Logic5.3 Substitution and Unification5.4 Unification Algorithm5.5 The Resolution Principle for the First-Order Logic5.6 Completeness of the Resolution Principle5.7 Examples Using the Resolution Principle5.8 Deletion StrategyReferencesExercises6. Semantic Resolution and Lock Resolution6.1 Introduction6.2 An Informal Introduction to Semantic Resolution6.3 Formal Definitions and Examples of Semantic Resolution6.4 Completeness of Semantic Resolution6.5 Hyperresolution and the Set-of-Support Strategy: Special Cases of Semantic Resolution6.6 Semantic Resolution Using Ordered Clauses6.7 Implementation of Semantic Resolution6.8 Lock Resolution6.9 Completeness of Lock ResolutionReferencesExercises7. Linear Resolution7.1 Introduction7.2 Linear Resolution7.3 Input Resolution and Unit Resolution7.4 Linear Resolution Using Ordered Clauses and the Information of Resolved Literals7.5 Completeness of Linear Resolution7.6 Linear Deduction and Tree Searching7.7 Heuristics in Tree Searching7.8 Estimations of Evaluation FunctionsReferencesExercises8. The Equality Relation8.1 Introduction8.2 Unsatisfiability under Special Classes of Models8.3 Paramodulation—An Inference Rule for Equality8.4 Hyperparamodulation8.5 Input and Unit Paramodulations8.6 Linear ParamodulationReferencesExercises9. Some Proof Procedures Based on Herbrand's Theorem9.1 Introduction9.2 The Prawitz Procedure9.3 The V-Resolution Procedure9.4 Pseudosemantic Trees9.5 A Procedure for Generating Closed Pseudosemantic Trees9.6 A Generalization of the Splitting Rule of Davis and PutnamReferencesExercises10. Program Analysis10.1 Introduction10.2 An Informal Discussion10.3 Formal Definitions of Programs10.4 Logical Formulas Describing the Execution of a Program10.5 Program Analysis by Resolution10.6 The Termination and Response of Programs10.7 The Set-of-Support Strategy and the Deduction of the Halting Clause10.8 The Correctness and Equivalence of Programs10.9 The Specialization of ProgramsReferencesExercises11. Deductive Question Answering, Problem Solving, and Program Synthesis11.1 Introduction11.2 Class A Questions11.3 Class B Questions11.4 Class C Questions11.5 Class D Questions11.6 Completeness of Resolution for Deriving Answers11.7 The Principles of Program Synthesis11.8 Primitive Resolution and Algorithm A (A Program-Synthesizing Algorithm)11.9 The Correctness of Algorithm A11.10 The Application of Induction Axioms to Program Synthesis11.11 Algorithm A (An Improved Program-Synthesizing Algorithm)ReferencesExercises12. Concluding RemarksReferencesAppendix AA.1 A Computer Program Using Unit Binary ResolutionA.2 Brief Comments on the ProgramA.3 A Listing of the ProgramA.4 IllustrationsReferencesAppendix BBibliographyIndex