Probabilistic logic programming with multiplicative modules

International audienceThis paper illustrates a simple idea on how to interpret undecompsable generalized multiplicative modules of linear logic as probabilistic methods of a logic prgramming language. These new modules/methods allow to express kinds of propagation of probability distribution inside Bayesian Networks that cannot be expressed by standard Prolog-like programming languages

Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing

This paper concerns a logical approach to natural language parsing based on proof nets (PNs), i.e. de-sequentialized proofs, of linear logic (LL). In particular, it presents a simple and intuitive syntax for PNs of the cyclic multiplicative fragment of linear logic (CyMLL). The proposed correctness criterion for CyMLL PNs can be considered as the non-commutative counterpart of the famous Danos-Regnier (DR) criterion for PNs of the pure multiplicative fragment (MLL) of LL. The main intuition relies on the fact that any DR-switching (i.e. any correction or test graph for a given PN) can be naturally viewed as a seaweed, i.e. a rootless planar tree inducing a cyclic order on the conclusions of the given PN. Dislike the most part of current syntaxes for non-commutative PNs, our syntax allows a sequentialization for the full class of CyMLL PNs, without requiring these latter must be cut-free. Moreover, we give a simple characterization of CyMLL PNs for Lambek Calculus and thus a geometrical (non inductive) way to parse phrases or sentences by means of Lambek PNs

Cyclic multiplicative-additive proof nets of linear logic with an application to language parsing

This paper concerns a logical approach to natural language parsing based on proof nets (PNs), i.e. de-sequentialized proofs, of linear logic (LL). In particular, it presents a syntax for PNs of the cyclic multiplicative and additive fragment of linear logic (CyMALL). Any proof structure (PS), in Girards style, is weighted by boolean monomial weights, moreover, its conclusions Γ (a sequence of formulas occurrences) are endowed with a cyclic order σ, i.e., σ(Γ). Naively, a CyMALL PS π with conclusions σ(Γ) is correct if, for any slice ϕ(π) (obtained by a boolean valuation ϕ of π) there exists an additive resolution (i.e. a multiplicative refinement of ϕ(π)) that is a CyMLL PN with conclusions σ(Γr), where Γr is an additive resolution of Γ (i.e. a choice of an additive subformula for each formula of Γ). In its turn, the correctness criterion for CyMLL PNs can be considered as the non-commutative counterpart of the famous Danos-Regnier (DR) criterion for PNs of the pure multiplicative fragment (MLL) of LL. The main intuition relies on the fact that any DR-switching (i.e. any correction or test graph for a given PN) can be naturally viewed as a seaweed, i.e. a rootless planar tree inducing a cyclic order on the conclusions of the given PN. Dislike the most part of current syntaxes for non-commutative PNs our syntax allows a sequentialization for the full class of CyMLL PNs, without requiring these latter must be cut-free. Moreover, we give a characterization of CyMALL PNs for the extended (MALL) Lambek Calculus and thus a geometrical (non inductive) way to parse phrases or sentences. In particular additive Lambek PNs allow to parse phrases containing words with syntactical ambiguity (i.e. words with polymorphic type)

7-Chloroquinolin-4-yl Arylhydrazone Derivatives: Synthesis and Antifungal Activity

Fifteen 7-chloro-4-arylhydrazonequinolines have been evaluated for their in vitro antifungal activity against eight oral fungi: Candida albicans, C. parapsilosis, C. lipolytica, C. tropicalis, C. famata, C. glabrata, Rhodutorula mucilaginosa, and R. glutinis. Several compounds exhibited minimum inhibitory concentration (MIC) and minimum fungicidal concentration (MFC) activities comparable with the first-line drug fluconazole. These results could be considered as an important starting point for the rational design of new antifungal agents

Modularity of Proof-nets: generating the type of a module

IAC ReportsConsiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7, Rome / CNR - Consiglio Nazionale delle RichercheSIGLEITItal