Distribution-aware sampling of answer sets

Research output: Chapter in Book or Conference Publication/ProceedingConference Publicationpeer-review

1 Citation (Scopus)

Abstract

Distribution-aware answer set sampling has a wide range of potential applications, for example in the area of probabilistic logic programming or for the computation of approximate solutions of combinatorial or search problems under uncertainty. This paper introduces algorithms for the sampling of answer sets under given probabilistic constraints. Our approaches allow for the specification of probability distributions over stable models using probabilistically weighted facts and rules as constraints for an approximate sampling task with specifiable accuracy. At this, we do not impose any independence requirements on random variables. An experimental evaluation investigates the performance characteristics of the presented algorithms.

Original languageEnglish
Title of host publicationScalable Uncertainty Management - 12th International Conference, SUM 2018, Proceedings
EditorsDavide Ciucci, Gabriella Pasi, Barbara Vantaggi
PublisherSpringer-Verlag
Pages164-180
Number of pages17
ISBN (Print)9783030004606
DOIs
Publication statusPublished - 2018
Event12th International Conference on Scalable Uncertainty Management, SUM 2018 - Milan, Italy
Duration: 3 Oct 20185 Oct 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11142 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Scalable Uncertainty Management, SUM 2018
Country/TerritoryItaly
CityMilan
Period3/10/185/10/18

Keywords

  • Answer set programming (ASP)
  • Nonmonotonic probabilistic logic programming
  • Probabilistic programming
  • Relational artificial intelligence

Fingerprint

Dive into the research topics of 'Distribution-aware sampling of answer sets'. Together they form a unique fingerprint.

Cite this