Sciweavers

361 search results - page 8 / 73
» Analytic Methods for the Logic of Proofs
Sort
View
ICLP
2007
Springer
14 years 2 months ago
Automatic Correctness Proofs for Logic Program Transformations
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
JAPLL
2007
86views more  JAPLL 2007»
13 years 8 months ago
Using logical relevance for question answering
We propose a novel method of determining the appropriateness of an answer to a question through a proof of logical relevance rather than a logical proof of truth. We define logic...
Marco De Boni
CSR
2008
Springer
13 years 10 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Ugo Dal Lago, Martin Hofmann
JMLR
2006
112views more  JMLR 2006»
13 years 8 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt
IANDC
2006
77views more  IANDC 2006»
13 years 8 months ago
Weakly complete axiomatization of exogenous quantum propositional logic
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...
Paulo Mateus, Amílcar Sernadas