Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Learning possibilistic logic theories from default rules (abridged version)

Kuzelka, Ondrej, Davis, Jesse and Schockaert, Steven 2017. Learning possibilistic logic theories from default rules (abridged version). Presented at: IJCAI-17: Workshop on Logical Foundations for Uncertainty and Machine Learning, Melbourne, Australia, 19-25 August 2017.

[img]
Preview
PDF - Accepted Post-Print Version
Download (119kB) | Preview

Abstract

We introduce a setting for learning possibilistic logic theories from defaults of the form “if alpha then typically beta”. An important property of our approach is that it is inherently able to handle noisy and conflicting sets of defaults. Among others, this allows us to learn possibilistic logic theories from crowdsourced data and to approximate propositional Markov logic networks using heuristic MAP solvers.

Item Type: Conference or Workshop Item (Paper)
Date Type: Completion
Status: Unpublished
Schools: Computer Science & Informatics
Date of First Compliant Deposit: 22 August 2017
Last Modified: 31 Jan 2018 14:05
URI: http://orca.cf.ac.uk/id/eprint/103858

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics