A. Borgi, E. Lamma and P. Mello, Inheritance and Hypothetical Reasoning in Logic Programming, Proceedings of the 9th ECAI, (1990) 105-110.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....MULTILOG [34] 19] and Plog [35] organise logical expressions in sets (objects) that communicate with each other via message passing in a way similar to that in SILO. However, except in Plog, objects are organised in a free way with no distinction between classes and instances. Also, systems like [36], 37] 38] and CPU [39] use the notion of inheritance hierarchy to (dynamically) organise sets of logical expressions with no communication between them, but they come with a sound semantics. CPU is the only system that uses a kind of meta level knowledge to control inheritance. Most of the ....

A. Borgi, E. Lamma and P. Mello, Inheritance and Hypothetical Reasoning in Logic Programming, Proceedings of the 9th ECAI, (1990) 105-110.

....The monotonicity on the second argument is analogous. The result proves that fi M in P(B) P(B) preserves some properties. In particular, fi M is monotonous in the domain of monotonous mappings from P(B) P(B) 3. 1 Tuple Inheritance Composition As discussed for other inheritance operators [BLM90, MP91, BLM94], programs can be composed in a nested fashion Pn Mn Gamma1 Pn Gamma1 Mn Gamma2 : M1 P 1 . The behaviour of this nested composition is defined by specifying how the evaluation of a goal is carried out in each program P i . This yields to the usual distinction between static inheritance (a ....

A. Brogi, E. Lamma, P. Mello. Inheritance and Hypothetical Reasoning in Logic Programming Proceedings of 9th European Conference on Artificial Intelligence, Pitman, 1990, pp. 105-110.

....the antecedent D subprogram into the currently running program, and then attempt to solve the consequent in the usual fashion. The usage of this method depends largely on the nature of the quantification. In this respect there are several variants including [50, 56, 49] 54, 55] 52, 53] and [6]. To start with let us suppose we have universal quantification of all predicates in the antecedent and existential quantification of all variables local to the antecedent (that is, those not in the consequent; if all variables were existentially quantified there would be no communication between ....

....allow each agent to spawn environments for body processes which will not communicate with each other, thus satisfying the requirements for the non deterministic languages. 3.3.2 The Blocks World We now move on to consider a concrete example. We look at a problem from the blocks world, taken from [6]. There are three blocks stacked on a table as shown in Figure 3.1. The middle block is black and either the top or the bottom block is white, but it is unknown which. The objective is to determine if the middle block is next to a white block. We offer the following solution. We formally describe ....

Antonio Brogi, Evelina Lamma, and Paolo Mello. Inheritance and hypothetical reasoning in logic programming. In Proceedings of the European Conference on Artificial Intelligence, pages 105--110, 1990.

....database programs with negation and embedded implications thereby extending the semantics defined by Miller [18] which has been restricted to definite programs. Furthermore, as opposed to most other query languages with embedded implications proposed in the literature before (see e.g. 18] 20] [3], 9] our language does not have a topdown SLD resoltion based evaluation strategy like e.g. Prolog. Instead, a top down query compilation into an evaluating relational expression can be defined in analogy to ordinary programs. In a subsequent bottom up query evaluation phase the proper set of ....

....evaluation phase the proper set of answer tuples is computed in a set at a time fashion. Our query evaluation scheme thus generalizes the evaluation scheme of most deductive database systems (see e.g. 6] Context extension and the composition of logic theories have also been studied in [2] and [3]. In [22] an elaborated ML style module system for Prolog is presented. As opposed to our language, in [22] the configuration of modules is strictly separated from the logic language itself. Another approach uses higher order features to incorporate modules into a logic language ( 4] 5] The ....

Brogi A., Lamma E., Mello P.: Inheritance and Hypothetical Reasoning in Logic Programming. Proc. 9th European Conf. on Artificial Intelligence, 1990, p. 105-110

....The continuity on the second argument is analogous. The result proves that fi M in P(B) P(B) preserves some properties. In particular, fi M is continuous in the domain of continuous mappings from P(B) P(B) 3. 1 Tuple Inheritance Composition As discussed for other inheritance operators [BLM90, MP91, BLM94], programs can be composed in a nested fashion P n Mn01 P n01 Mn02 : M 1 P 1 . The behaviour of this nested composition is defined by specifying how the evaluation of a goal is carried out in each program P i . This yields to the usual distinction between static inheritance (a l a ....

A. Brogi, E. Lamma, P. Mello. Inheritance and Hypothetical Reasoning in Logic Programming Proceedings of 9th European Conference on Artificial Intelligence, Pitman, 1990, pp. 105-110.

....deductive database programs with negation and embedded implications. Our semantics extends that defined in [15] which has been restricted to positive programs. Furthermore, as opposed to most other query languages with embedded implications proposed in the literature before (see e.g. 15] 19] [2], 5] our language does not have a top down, SLD resolution based evaluation strategy like e.g. Prolog. Instead, a top down query compilation into an evaluating relational expression can be defined in analogy to ordinary deductive database programs. In a subsequent bottom up query evaluation ....

....itself (e.g. 12] 21] In [21] an elaborated ML style module system for Prolog is presented. As opposed to our language, the configuration of modules is strictly separated from the logic language itself. Context extension and the composition of logic theories have also been studied in [1] and [2]. A third approach uses higher order features to incorporate modules into a logic language ( 3] 4] The main contributions of this paper can be summarized as follows. ffl We define a deductive database language with modules and static scoping. A dynamic scoping rule can be invoked whenever ....

[Article contains additional citation context not shown here]

Brogi A., Lamma E., Mello P.: Inheritance and Hypothetical Reasoning in Logic Programming, Proc. of the 9th European Conference on Artificial Intelligence, 1990

....Operator Composition. Various proposals for modular logic programming adopt scope policies which are more complex than those we have discussed so far: typical examples are the operators for nested composition of [5, 78, 43] and the different forms of inheritance based compositions discussed in [11] and [19, 79] Programs can be composed in a nested fashion by accommodating them in a stack. Let S = P n ; P i ; P 1 ] be a stack where P 1 ; Pn are the component programs and Pn is the top of S. The behaviour of a nested composition is defined by specifying how the evaluation ....

A. Brogi, E. Lamma, and P. Mello. Inheritance and Hypothetical Reasoning in Logic Programming. In Proceedings of 9th European Conference on Artificial Intelligence, pages 105--110. Pitman, 1990.

No context found.

A. Brogi, E. Lamma, P. Mello. Inheritance and Hypothetical Reasoning in Logic Programming Proceedings of 9th European Conference on Artificial Intelligence, Pitman, 1990, pp. 105-110.

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