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...
Uložené v:
| Vydané v: | Electronic notes in theoretical computer science Ročník 37; s. 1 - 16 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
2000
|
| ISSN: | 1571-0661, 1571-0661 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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 |