1
|
Abstract:
Abstract. Logic programming languages based on linear logic have been of recent interest, particularly as such languages provide a logical basis for programs which execute within a dynamic environment. Most of these 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, such as in agent systems which are expected to behave both rationally (i.e. reasoning in a backward-chaining manner) and reactively (i.e. reasoning in a forward-chaining manner). In this paper we develop the proof-theoretic foundations for systems which combine both methods of reasoning for linear logic. We give an inference system which allows for such "mixed " reasoning, and we discuss its properties. 1
Citations
| 745 | A machine-oriented logic based on the resolution principle – Robinson - 1986 |
| 620 | Predicate Logic as Programming Language – Kowalski - 1974 |
| 500 | Introduction to Metamathematics – Kleene - 1952 |
| 383 | Untersuchungen über das logische Schließen – Gentzen - 1935 |
| 334 | A.: Uniform Proofs as a Foundation for Logic Programming – Miller, Nadathur, et al. - 1991 |
| 295 | Logic programming in a fragment of intuitionistic linear logic – Hodas, Miller - 1994 |
| 224 | Logic programming with focusing proofs in linear logic – Andreoli - 1992 |
| 43 | Programming in Lygon: An overview – Harland, Pym, et al. - 1996 |
| 27 | On bunched predicate logic – Pym - 1999 |
| 23 | A Logical Analysis of Modules – Miller - 1989 |
| 16 | A proof-theoretic analysis of goal-directed provability – Harland - 1994 |
| 13 | Structural Operational Semantics (lecture notes – Plotkin - 1981 |
| 7 | The Art of Prolog, 2nd ed – Sterling, Shapiro - 1994 |
| 6 | On proof normalisation – Galmiche, Perrier - 1994 |
