Advances in Logic Programming and Automated Reasoning, Volume 1
Ralph W. Wilkerson
Intellect Books, 1992 - Computers - 270 pages
This series reviews research contributions in logic programming and automated reasoning and is desinged to stimulate and sustain new, productive lines of investigation into symbolic and algebraic computing techniques as they relate to logic programming and automate reasoning. Topics covered include equational reasoning, parallel programming in logic, term rewriting systems, control of logic programs, completion procedures, unification and matching algorithms, design and implementation of deduction systems, logical methods of knowledge representation, logic-based inference techniques, and programs synthesis and verification.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Equations OrderSortedness and Inheritance
An Automated Decision Procedure Based on the Semantic
An Assertional Programming System
Theory and Applications of the Parallel KnowledgeBased
Other editions - View all
algorithm answer substitution applied Artificial Intelligence atomic Automated bundle circular waiting Class Concepts classification numbers color connection graph contains database dc links dc parallelism dcdp links decomposed decomposition deduction defined definition denotes derived E-model empty clause equality axioms equational logic program equational theory Euler paths example executable first-order logic formal formula free(S goal clause ground term heuristics Hoare triple Horn clause inherited initial instantiated interpretation knowledge base knowledge representation Lemma link-L lock node or-links order-sorted parallel link resolution paramodulation partition path PR functions predicate logic problem program segment program synthesis programming language Prolog Proof properties quantifiers query relation rewriting robot-1 satellite clause satellite-cl search space semantic networks semantic tableau shown in Figure solved sort Soundness Theorem specification step subsumption sun clause task pool theorem proving tion to-be-locked transformation tree type b statement type symbol unifies updated var(e variables