AbstractWhen logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ∪ {D}. Thus contexts, represented as the left-hand side of intuitionistic sequents, grow as stacks during the bottom-up search for a cut-free proof. While such an intuitionistic notion of context provides for elegant specifications of many computations, contexts can be made more expressive and flexible if they are based on linear logic. After presenting two equivalent formulations of a fragment of linear logic, we show that the fragment h...
This paper is focused on a double extension of traditional Logic Programming which enhances it follo...
Computational Linguistics and Logic Programming have strong connections, but the former uses concept...
iPreface Logic programming employs logic as a programming language Thus a logic program consists of...
AbstractWhen logic programming is based on the proof theory of intuitionistic logic, it is natural t...
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow ...
Logic programming languages based on fragments of intuitionistic logic have recently been developed ...
Logic programming languages based on fragments of intuitionistic logic have recently been developed ...
Abstract. A key property in the definition of logic programming languages is the completeness of goa...
AbstractThe notions of uniform proof and of resolution represent the foundations of the proof-theore...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
To appear in Theory and Practice of Logic Programming (TPLP)International audienceSeveral formal sys...
A natural extension of SLD-resolution is introduced as a goal directed proof procedure for the full...
Abstract. Logic programming can be given a foundation in sequent calculus, viewing computation as th...
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like pro...
Linear logic as introduced by Girard and presented in the previous chapter is a rich system for the ...
This paper is focused on a double extension of traditional Logic Programming which enhances it follo...
Computational Linguistics and Logic Programming have strong connections, but the former uses concept...
iPreface Logic programming employs logic as a programming language Thus a logic program consists of...
AbstractWhen logic programming is based on the proof theory of intuitionistic logic, it is natural t...
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow ...
Logic programming languages based on fragments of intuitionistic logic have recently been developed ...
Logic programming languages based on fragments of intuitionistic logic have recently been developed ...
Abstract. A key property in the definition of logic programming languages is the completeness of goa...
AbstractThe notions of uniform proof and of resolution represent the foundations of the proof-theore...
The notions of uniform proof and resolution represent the foundations of the proof-theoretic charact...
To appear in Theory and Practice of Logic Programming (TPLP)International audienceSeveral formal sys...
A natural extension of SLD-resolution is introduced as a goal directed proof procedure for the full...
Abstract. Logic programming can be given a foundation in sequent calculus, viewing computation as th...
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like pro...
Linear logic as introduced by Girard and presented in the previous chapter is a rich system for the ...
This paper is focused on a double extension of traditional Logic Programming which enhances it follo...
Computational Linguistics and Logic Programming have strong connections, but the former uses concept...
iPreface Logic programming employs logic as a programming language Thus a logic program consists of...