Sciweavers

1194 search results - page 153 / 239
» A Calculus for Predicative Programming
Sort
View
JMLR
2006
112views more  JMLR 2006»
14 years 11 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
APAL
2005
107views more  APAL 2005»
14 years 11 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
ENTCS
2002
157views more  ENTCS 2002»
14 years 11 months ago
Arguments and Misunderstandings: Fuzzy Unification for Negotiating Agents
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contri...
Michael Schroeder, Ralf Schweimeier
VMCAI
2009
Springer
15 years 6 months ago
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
Hasan Amjad, Richard Bornat
ICALP
2005
Springer
15 years 5 months ago
About Hoare Logics for Higher-Order Store
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
Bernhard Reus, Thomas Streicher