Logic programs consist of formulas of mathematical logic and various proof-theoretic techniques can be used to design and analyse execution models for such programs. We briefly review the main problems, which are questions that are still elusive in the design of logic programming languages, from a prooftheoretic point of view. Existing approaches and analyses which lead to the various languages are all rather sophisticated and involve complex manipulations of proofs. All are designed for analysis on paper by a human and many of them are ripe for automation. We aim to perform the automation of some aspects of proof-theoretic analyses, in order to assist in the design of logic programming languages. In this paper we describe the first steps towards the design of such an automatic analysis tool. We investigate the usage of particular proof manipulations for the analysis of logic programming strategies. We propose a more precise specification of sequent calculi inference rules that we use ...

There are several major approaches to model concurrent computations using logic. In this context, one aim can be to achieve different forms of programming as logic, object-oriented or concurrent ones in a same logical language. Linear logic seems to be well-suited to describe computations that are concurrent and based on state transitions. In this paper, we propose and analyze a framework based on Full Intuitionistic Linear Logic (FILL), logical fragment with potentialities for non-determinisms management, as foundation of concurrent object-oriented programming, following the two paradigms proof-search as computation and proofs as computations.