M.R. Genesereth and M.L. Ginsberg. Logic Programming. Comm. ACM, 28(9), September 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....task, the model analyzer depends upon a COBRA metamodel, a concept classifier and axiom check er, and an information elicitor. The COBRA metamodel, described elsewhere [21] comprises a taxonomy of semantic concepts [23] 24] Each concept in the taxonomy can be constrained by a set of axioms [25]. Each leaf level concept in the taxonomy must satisfy all axioms defined for the intermediate concepts along all its inheritance paths to the top of the taxonomy. The actual classification of concepts on the flow diagram occurs through use of an automated concept classifier [26] The concept ....

M.R. Genesereth and M.L. Ginsberg, "Logic Programming," Comm. ACM, vol. 28, no. 9, pp. 933-941, Sept. 1985.

....l parents) defun update r parents (resolvent r parents step point) r parents) 5.2 Adding more control 17 The above configuration of ACT P gives the implementation of the basic Prolog system. However, one can add other control facilities, for example like those used in IC Prolog [5] or in MRS [11]. IC Prolog uses control annotations to specify the order of the literals in the body of a Horn clause depending on the query. The same is done in MRS via the use of control clauses. For example, the ACT P axiom (where symbols starting with a are variables) parent x y) parent y ....

M. R. Genesereth and M.L. Ginsberg, Logic Programming, CACM 28 (1985) 933-941.

....Figure IV 1. AQUINAS Knowledge Acquisition Workbench [KITT87, p. 99] Repetory Grid Tools Hierarchical Structure Tools Uncertainty Tools Inference Engine Multiple Scale Tools Induction Tools Multiple Expert Tools Common LISP and Common LOOPS 54 Logic programming is programming by description. [GENE85] Specific assertions are declared explicitly to be true, and then are combined with a general inference procedure. The assertions describe objects and relationships within a problem domain. The inference process requires that each statement in the knowledge base must be capable of evaluating to ....

M. Genesereth and M. Ginsberg, "Logic Programming", Communications of the ACM, September 1985, pp. 933-941.

....trying to solve a problem. They allow for no backtracking, and they always terminate independent on whether they successfully solved the problem at hand or not. 4.6. 2 Logic Programming This description of the logic programming style is heavily founded in the concepts described in the literature [Genesereth and Ginsberg 1985] [Clocksin 45 and Mellish 1987] Rich and Knight 1991] while focusing on the features that seem to be relevant for composition. A logic programming system is typically a single threaded system, it uses shared information on unification values as the only means of sharing information among its ....

M. Genesereth and M. Ginsberg, "Logic Programming, " Communications of the ACM, vol. 28, no. 9, September 1985, pp. 933-941.

....analyzer depends upon a COBRA metamodel, a concept classifier and axiom checker, and an information elicitor. The COBRA meta model, described elsewhere [21] comprises a taxonomy of semantic concepts [23 24] Each concept in the taxonomy can be constrained by a set of Draft 08 28 00 10 axioms [25]. Each leaf level concept in the taxonomy must satisfy all axioms defined for the intermediate concepts along all its inheritance paths to the top of the taxonomy. SOFTWARE ARCHITECTURE DIAGRAM UNDERSTANDING THE PROBLEM MODEL Design Analyses MODEL ANALYZER Data Flow Diagram ....

Genesereth, M. R. and Ginsberg, M. L. (1985) "Logic Programming", Communications of the ACM, September 1985, Volume 28, Number 9, pp. 933941.

....automated support: 1) for verifying assertions that instances of a concept are indeed valid instances of the concept and (2) for evaluating whether or not a concept is a leaf in the taxonomy. The COBRA meta model addresses these requirements by providing axioms, expressed using predicate logic (Genesereth and Ginsberg, 1985), for each semantic concept within the taxonomy, and by allowing axioms from more general concepts to be inherited by more specialized concepts. This section explains the main principles of concept axioms and inheritance. A full specification of the axioms applicable for each concept in the COBRA ....

Genesereth, M. R. and Ginsberg, M. L. (1985) "Logic Programming", Communications of the ACM, September 1985, Volume 28, Number 9, pp. 933-941.

....task, the model analyzer depends upon a COBRA metamodel, a concept classifier and axiom checker, and an information elicitor. The COBRA meta model, described elsewhere [21] comprises a taxonomy of semantic concepts [23 24] Each concept within the taxonomy can be constrained by a set of axioms [25]. Each leaf level concept within the taxonomy must satisfy all axioms defined for the intermediate concepts along all its inheritance paths from the top of the taxonomy. The actual classification of concepts on the flow diagram occurs through use of an automated concept classifier [26] The ....

Genesereth, M. R. and Ginsberg, M. L. (1985) "Logic Programming", Communications of the ACM, September 1985, Volume 28, Number 9, pp. 933941.

.... principle for Horn clauses which consist of unification and substitution (cf. Kowa74] Llyo84] Unification is the process to match the free variables and the constants of a rule call in the body of a rule with the variables and constants of the corresponding heads of rules in the knowledge base [GG85]. Substitution means to replace the called rule by the body of the corresponding rule, if the rule call and the head of the corresponding rule could be unified. The resolution process starts with the unification and substitution of the leftmost rule call and continues step by step from left to ....

Genesereth M.R., Gaisberg M.L., Logic Programming, IEEE Computer, Vol. 28 No. 9, September 1985, pp. 933-941.

No context found.

M.R. Genesereth and M.L. Ginsberg. Logic Programming. Comm. ACM, 28(9), September 1985.

No context found.

M.R. Genesereth and M.L. Ginsberg. Logic Programming. Comm. ACM, 28(9), September 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC