Probabilistic Inductive Logic Programming Based on Answer Set Programming release_ahr4hjvqmzf6hdy5cj34gsfesa

by Matthias Nickles, Alessandra Mileo

Released as a article .

2014  

Abstract

We propose a new formal language for the expressive representation of probabilistic knowledge based on Answer Set Programming (ASP). It allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities and for learning of such weights from data (parameter estimation). Weighted formulas are given a semantics in terms of soft and hard constraints which determine a probability distribution over answer sets. In contrast to related approaches, we approach inference by optionally utilizing so-called streamlining XOR constraints, in order to reduce the number of computed answer sets. Our approach is prototypically implemented. Examples illustrate the introduced concepts and point at issues and topics for future research.
In text/plain format

Archived Files and Locations

application/pdf  178.9 kB
file_qivljzabszdrbi4osks7c3psui
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2014-05-04
Version   v1
Language   en ?
arXiv  1405.0720v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 753ed428-6f48-4024-80ca-0e973c8c2566
API URL: JSON