This Mathematically Oriented Introduction To The Theory Of Logic Programming Presents A Systematic Exposition Of The Resolution Method For Propositional, First Order, And Horn Clause Logics, Together With An Analysis Of The Semantic Aspects Of The Method It Is Through The Inference Rule Of Resolution That Both Proofs And Computations Can Be Manipulated On Computers, And This Book Contains Elegant Versions And Proofs Of The Fundamental Theorems And Lemmas In The Proof Theory Of Logic Programming Advanced Topics Such As Recursive Complexity And Negation As Failure And Its Semantics Are Covered, And Streamlined Setups For SLD And SLDNF Resolution Are Described No Other Book Treats This Material In Such Detail And With Such Sophistication Doets Provides A Novel Approach To Resolution That Is Applied To The First Order Case And The Case Of Positive Logic Programs In Contrast To The Usual Approach, The Concept Of A Resolvent Is Defined Nonconstructively, Without Recourse To The Concept Of Unification, Allowing The Soundness And Completeness Proofs To Be Carried Out In A Economic Way Other New Material Includes Computability Results Dealing With Analytical Hierarchy, Results On Infinite Derivations And An Exposition On General Logic Programs Using Valued Logic
Is a well-known author, some of his books are a fascination for readers like in the From Logic to Logic Programming (Foundations of Computing) book, this is one of the most wanted Kees Doets author readers around the world.
- From Logic to Logic Programming (Foundations of Computing)
- Kees Doets
- 09 July 2018 Kees Doets