Sciweavers

529 search results - page 60 / 106
» Simple Random Logic Programs
Sort
View
ML
2006
ACM
13 years 10 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 9 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
FLOPS
2010
Springer
14 years 4 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow
FOIKS
2004
Springer
14 years 3 months ago
Database Repair by Signed Formulae
We introduce a simple and practically efficient method for repairing inconsistent databases. The idea is to properly represent the underlying problem, and then use off-the-shelf a...
Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Mau...
PPDP
2009
Springer
14 years 4 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano