J. Harland, D. Pym, and M. Winikoff. Forward and backward chaining in linear logic. In D. Galmiche, editor, Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics, volume 37 of Electronic Notes in Theoretical Computer Science, Pittsburgh, Pennsylvania, June 2000. Elsevier Science.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....simply and naturally in linear logic [22, 23] Given also the existence of a number of logic programming languages based on linear logic (such as LO [4] Lolli [15] Forum [24] LLP [16] and Lygon [12] it seems natural to explore the use of linear logic as a basis for BDI style agent systems. In [13] it was shown how a notion of forward chaining could be introduced into the standard sequent calculus for linear logic in order to provide such behaviour. In [14] the use of this framework as a basis for agent systems was discussed. In this paper we develop this direction further by examining the ....

....simple and natural way to express conditions which are dependent on the dynamics of the environment. The techniques for backward chaining (both classically and for linear logic) are well known [15, 20, 25, 27] the integration of forward chaining techniques into such a system was investigated in [13]. In particular, this allows a combination of don t know nondeterminism (common in logic programming) via backwardchaining with don t care nondeterminism via forward chaining. Such an integrated system is thus able to both follow a planned sequence of instructions (backward chaining) and react to ....

[Article contains additional citation context not shown here]

J. Harland, D. Pym and M. Winiko#, Forward and Backward Chaining in Linear Logic, Proceedings of the CADE-17 Workshop on Proof-Search in Type-Theoretic Systems, Pittsburgh, June, 200.

....and naturally in linear logic [22, 23] Given also the existence of a number of logic programming languages based on linear logic (such as LO [4] Lolli [15] Forum [24] LLP [16] and Lygon [12] it seems natural to explore the use of linear logic as a basis for BDI style agent systems. In [13] it was shown how a notion of forward chaining could be introduced into the standard sequent calculus for linear logic in order to provide such behaviour. In [14] the use of this framework as a basis for agent systems was discussed. In this paper we develop this direction further by examining the ....

....simple and natural way to express conditions which are dependent on the dynamics of the environment. The techniques for backward chaining (both classically and for linear logic) are well known [15, 20, 25, 27] the integration of forward chaining techniques into such a system was investigated in [13]. In particular, this allows a combination of don t know nondeterminism (common in logic programming) via backward chaining with don t care nondeterminism via forward chaining. Such an integrated system is thus able to both follow a planned sequence of instructions (backward chaining) and react ....

[Article contains additional citation context not shown here]

J. Harland, D. Pym and M. Winikoff, Forward and Backward Chaining in Linear Logic, Proceedings of the CADE-17 Workshop on Proof-Search in Type-Theoretic Systems, Pittsburgh, June, 200.

....Lygon [17] it seems natural to explore the use of linear logic as a basis for BDI style agent systems. Some initial work in this direction was done by Abdullah Al Amin [3] however, that was limited to the use of a particular language (Lygon) and did not take reactive behaviour into account. In [18] it was shown how a notion of forward chaining could be introduced into the standard sequent calculus for linear logic in order to provide such behaviour. Hence such mixed mode inference is of patricular interest as a basis for agent systems. This paper thus attempts to re cast the framework of ....

....a simple and natural way to express conditions which are dependent on the dynamics of the environment. The techniques for backward chaining (both classically and for linear logic) are well known [26, 32, 38, 20] the integration of forwardchaining techniques into such a system was investigated in [18]. In particular, this allows a combination of don t know nondeterminism (common in logic programming) via backward chaining with don t care nondeterminism via forward chaining. Such an integrated system is thus able to both follow a planned sequence of instructions (backward chaining) and react ....

[Article contains additional citation context not shown here]

J. Harland, D. Pym and M. Winiko, Forward and Backward Chaining in Linear Logic, Proceedings of the CADE-17 Workshop on Proof-Search in TypeTheoretic Systems, Pittsburgh, June, 200.

....Lygon [13] it seems natural to explore the use of linear logic as a basis for BDI style agent systems. Some initial work in this direction was done by Abdullah Al Amin [3] however, that was limited to the use of a particular language (Lygon) and did not take reactive behaviour into account. In [14] it was shown how a notion of forward chaining could be introduced into the standard sequent calculus for linear logic in order to provide such behaviour. This paper thus attempts to re cast the framework of BDI systems into a logic programming paradigm based on linear logic. Whilst this may be ....

....simple and natural way to express conditions which are dependent on the dynamics of the environment. The techniques for backward chaining (both classically and for linear logic) are well known [21, 26, 32, 15] the integration of forward chaining techniques into such a system was investigated in [14]. In particular, this allows a combination of don t know nondeterminism (common in logic programming) via backward chaining with don t care nondeterminism via forward chaining. Kowalski and Sadri [22] developed extensions to the traditional logic programming paradigm to incorporate agent ....

[Article contains additional citation context not shown here]

J. Harland, D. Pym and M. Winikoff, Forward and Backward Chaining in Linear Logic, Proceedings of the CADE-17 Workhop on Proof-Search in Type-Theoretic Systems, Pittsburgh, June, 200.

....clear that the pattern of choices of premisses made by the search procedure has a critical impact on the outcome of the search. For example, in systems such as Prolog [5,8,33] one premiss might lead to looping 9 More important, perhaps, in systems which combine top down and bottom up reasoning [11]. 11 whereas another premiss might fail very quickly. These observations lead us to the view that Reductive Logic = Reduction Control; i.e. the speci cation of a reductive logic requires not only the de nition of the reduction operators, corresponding to the rules of inference of a ....

....of the program is then given by the least xed point of this operator, a co limit of ordinal powers of T P . It is interesting to note that this forward chaining system is traditionally used to provide a xpoint semantics for SLD resolution [5] a backward chaining system (cf. the discussion in [11]) The T P semantics is very good logically. It gives a term model of the underlying logic and includes an explicit measure of the logical complexity of a goal, i.e. the power of T P at which the goal can be proved. However, the T P semantics is quite poor in its treatment of the execution ....

Harland, J., D. Pym and M. Winiko, Forward and Backward Chaining in Linear Logic (Extended Abstract), this volume.

No context found.

J. Harland, D. Pym, and M. Winikoff. Forward and backward chaining in linear logic. In D. Galmiche, editor, Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics, volume 37 of Electronic Notes in Theoretical Computer Science, Pittsburgh, Pennsylvania, June 2000. Elsevier Science.

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