35 search results - page 6 / 7 » Introducing Abduction into (Extensional) Inductive Logic Pro... |
TCS
2011
13 years 15 days ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
ILP
2007
Springer
13 years 11 months ago
2007
Springer
Machine-generated documents containing semi-structured text are rapidly forming the bulk of data being stored in an organisation. Given a feature-based representation of such data,...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...