Abstract

. Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly 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. 1 Introduction Backward chaining is a standard technique in automated deduction, particularly in logic programming systems, often taking the form of a version of Robinson's resolution rule [18]. The fundamental question is to determine whether or not a given formula follows from a given set of formul, and there are various techniques which can be used to guide the search for a proof. An instance of this approach is...

Citations