Sciweavers

1941 search results - page 186 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
115
Voted
LICS
2010
IEEE
15 years 2 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
220
Voted
ENTCS
2007
114views more  ENTCS 2007»
15 years 3 months ago
Reporting Failures in Functional Logic Programs
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
Michael Hanus
240
Voted
ICFP
2009
ACM
16 years 4 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
166
Voted
ILP
2004
Springer
15 years 9 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
120
Voted
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 5 months ago
A General Notion of Useful Information
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...
Philippe Moser