Sciweavers

37 search results - page 3 / 8
» Answer Set Programming with Clause Learning
Sort
View
ICTAI
2007
IEEE
13 years 11 months ago
ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming
In this paper we developed an Inductive Logic Programming (ILP) based framework ExOpaque that is able to extract a set of Horn clauses from an arbitrary opaque machine learning mo...
Yunsong Guo, Bart Selman
ML
2006
ACM
13 years 4 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
ICLP
2010
Springer
13 years 8 months ago
Learning Domain-Specific Heuristics for Answer Set Solvers
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
Marcello Balduccini
ILP
2004
Springer
13 years 10 months ago
Learning Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
Fabrizio Riguzzi
KRDB
2003
111views Database» more  KRDB 2003»
13 years 6 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis