3691 search results - page 267 / 739 » Bayesian Logic Programs |
166
click to vote
COLING
1990
15 years 7 months ago
1990
This paper describes a new program, correct, which takes words rejected by the Unix spell program, proposes a list of candidate corrections, and sorts them by probability. The pro...
168
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
189
click to vote
ICFP
2003
ACM
2003
ACM
A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
16 years 6 months ago
We report on work in progress devoted to the formalization of an Ordered Logical Framework (OLF) based on a two-level architecture [8] in the Hybrid system. OLF here is a second-or...
155
click to vote
APLAS
2005
ACM
16 years 7 days ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
189
click to vote
AICOM
2006
15 years 6 months ago
2006
This paper presents an overview of recent systems for Inductive Logic Programming (ILP). After a short description of the two popular ILP systems FOIL and Progol, we focus on meth...