128 search results - page 2 / 26 » Declarative Representation of Proof Terms |
103
click to vote
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
102
Voted
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
JMLR
2006
14 years 9 months ago
2006
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...
113
Voted
ICLP
2010
Springer
14 years 8 months ago
2010
Springer
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
95
Voted
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...