|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Donald W. LovelandPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Volume: 138 Weight: 0.675kg ISBN: 9783540115588ISBN 10: 3540115587 Pages: 389 Publication Date: 01 May 1982 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsSolving open questions with an automated theorem-proving program.- STP: A mechanized logic for specification and verification.- A look at TPS.- Logic machine architecture: Kernel functions.- Logic machine architecture: Inference mechanisms.- Procedure implementation through demodulation and related tricks.- The application of Homogenization to simultaneous equations.- Meta-level inference and program verification.- An example of FOL using metatheory.- Comparison of natural deduction and locking resolution implementations.- Derived preconditions and their use in program synthesis.- Automatic construction of special purpose programs.- Deciding combinations of theories.- Exponential improvement of efficient backtracking.- Exponential improvement of exhaustive backtracking: data structure and implementation.- Intuitionistic basis for non-monotonic logic.- Knowledge retrieval as limited inference.- On indefinite databases and the closed world assumption.- Proof by matrix reduction as plan + validation.- Improvements of a tautology-testing algorithm.- Representing infinite sequences of resolvents in recursive First-Order Horn Databases.- The power of the Church-Rosser property for string rewriting systems.- Universal unification and a classification of equational theories.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |