Sciweavers

1131 search results - page 32 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
PLPV
2009
ACM
14 years 5 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
CIE
2008
Springer
13 years 10 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes
ICML
2002
IEEE
14 years 9 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
DLOG
2007
13 years 10 months ago
Exploiting Description Logic Reasoners in Inductive Logic
In spite of the increasing effort spent on building ontologies for the Semantic Web, little attention has been paid to the impact of these ontologies on knowledge-based intelligen...
Francesca A. Lisi
LISP
2008
165views more  LISP 2008»
13 years 8 months ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind