Sciweavers

351 search results - page 25 / 71
» Classical Logic with Partial Functions
Sort
View
FLAIRS
2007
13 years 9 months ago
Naive Bayes and Decision Trees for Function Tagging
This paper describes the use of two machine learning techniques, naive Bayes and decision trees, to address the task of assigning function tags to nodes in a syntactic parse tree....
Mihai C. Lintean, Vasile Rus
KI
2007
Springer
14 years 1 months ago
Inductive Synthesis of Recursive Functional Programs
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...
Martin Hofmann 0008, Andreas Hirschberger, Emanuel...
JUCS
2006
131views more  JUCS 2006»
13 years 7 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
POPL
2006
ACM
14 years 7 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
IWFM
1998
13 years 8 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler