Logic programming is a paradigm which makes use of mathematical logic to represent programs by means of sets of formal sentences.
In this talk we recall Andreoli's logic programming paradigm, which is based on linear logic proof structures. We focus on the so called "multiplicative" fragment, that is, the one which only employs linear and context-free methods.
We show how to revise this construction in order to accommodate specific generalized multiplicative connectives.
This allows us to implement some non-linear and context-sensitive methods in a pure multiplicative fragment. This talk is based on a joint work with Roberto Maieli
Per partecipare al seminario:
chiedere il link all’indirizzo email firstname.lastname@example.org
o cliccare sul seguente link Link identifier #identifier__114833-1Microsoft Teams
This post is also available in: Link identifier #identifier__32070-5Eng