UID:
almahu_9948621277502882
Umfang:
VII, 389 p.
,
online resource.
Ausgabe:
1st ed. 1982.
ISBN:
9783540392408
Serie:
Lecture Notes in Computer Science, 138
Anmerkung:
Solving 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.
In:
Springer Nature eBook
Weitere Ausg.:
Printed edition: ISBN 9783540115588
Weitere Ausg.:
Printed edition: ISBN 9783662204337
Sprache:
Englisch
URL:
https://doi.org/10.1007/BFb0000048
