1131 search results - page 154 / 227 » Logic Programming, Functional Programming, and Inductive Def... |
120
click to vote
AAECC
2007
Springer
15 years 2 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
139
Voted
TPHOL
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
118
click to vote
ECML
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
107
Voted
DAGSTUHL
2007
15 years 4 months ago
2007
arrhythmias (extended abstract) Elisa Fromont, Ren´e Quiniou, Marie-Odile Cordier We are interested in using parallel universes to learn interpretable models that can be subseque...
123
click to vote
APLAS
2006
ACM
15 years 8 months ago
2006
ACM
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...