Forward and Backward Chaining in Linear Logic (Extended Abstract)

Logic programming languages based on linear logic are of both theoretical and practical interest, particularly because such languages can be seen as providing a logical basis for programs which execute within a dynamic environment. Most linear logic programming languages are implemented using standa...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in theoretical computer science Vol. 37; pp. 1 - 16
Main Authors:	Harland, James A., Pym, David J., Winikoff, Michael
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2000
ISSN:	1571-0661, 1571-0661
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Logic programming languages based on linear logic are of both theoretical and practical interest, particularly because such languages can be seen as providing a logical basis for programs which execute within a dynamic environment. Most linear logic programming languages are implemented using standard resolution or backward chaining techniques. However, there are many applications in which the combination of such techniques with forward chaining ones are desirable. We develop a proof-theoretic foundation for a system which combines both forms of reasoning in linear logic.
ISSN:	1571-0661 1571-0661
DOI:	10.1016/S1571-0661(05)01136-9