An extended semantics for logic programs with annotated disjunctions and its efficient implementation

Fabrizio Riguzzi, Terrance Swift

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Logic Programming with Annotated Disjunctions (LPADs) is a formalism for modeling probabilistic information that has recently received increased attention. The LPAD semantics, while being simple and clear, suffers from the requirement of having function free-programs, which is a strong limitation. In this paper we present an extension of the semantics that removes this restriction and allows us to write programs modeling infinite domains, such as Hidden Markov Models. We show that the semantics is well-defined for a large class of programs. Moreover, we present the algorithm "Probabilistic Inference with Tabling and Answer subsumption" (PITA) for computing the probability of queries to programs according to the extended semantics. Tabling and answer subsumption not only ensure the correctness of the algorithm with respect to the semantics but also make it very efficient on programs without function symbols. PITA has been implemented in XSB and tested on six domains: two with function symbols and four without. The execution times are compared with those of ProbLog, cplint and CVE. PITA was almost always able to solve larger problems in a shorter time on both type of domains.

Original languageEnglish (US)
Title of host publicationCEUR Workshop Proceedings
Volume598
StatePublished - 2010
Externally publishedYes
Event25th Italian Conference on Computational Logic, CILC 2010 - Rende, Italy
Duration: Jul 7 2010Jul 9 2010

Other

Other25th Italian Conference on Computational Logic, CILC 2010
CountryItaly
CityRende
Period7/7/107/9/10

Fingerprint

Semantics
Logic programming
Hidden Markov models

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Riguzzi, F., & Swift, T. (2010). An extended semantics for logic programs with annotated disjunctions and its efficient implementation. In CEUR Workshop Proceedings (Vol. 598)

An extended semantics for logic programs with annotated disjunctions and its efficient implementation. / Riguzzi, Fabrizio; Swift, Terrance.

CEUR Workshop Proceedings. Vol. 598 2010.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Riguzzi, F & Swift, T 2010, An extended semantics for logic programs with annotated disjunctions and its efficient implementation. in CEUR Workshop Proceedings. vol. 598, 25th Italian Conference on Computational Logic, CILC 2010, Rende, Italy, 7/7/10.
Riguzzi, Fabrizio ; Swift, Terrance. / An extended semantics for logic programs with annotated disjunctions and its efficient implementation. CEUR Workshop Proceedings. Vol. 598 2010.
@inproceedings{8c3b379f1bde46099394c24d1595365c,
title = "An extended semantics for logic programs with annotated disjunctions and its efficient implementation",
abstract = "Logic Programming with Annotated Disjunctions (LPADs) is a formalism for modeling probabilistic information that has recently received increased attention. The LPAD semantics, while being simple and clear, suffers from the requirement of having function free-programs, which is a strong limitation. In this paper we present an extension of the semantics that removes this restriction and allows us to write programs modeling infinite domains, such as Hidden Markov Models. We show that the semantics is well-defined for a large class of programs. Moreover, we present the algorithm {"}Probabilistic Inference with Tabling and Answer subsumption{"} (PITA) for computing the probability of queries to programs according to the extended semantics. Tabling and answer subsumption not only ensure the correctness of the algorithm with respect to the semantics but also make it very efficient on programs without function symbols. PITA has been implemented in XSB and tested on six domains: two with function symbols and four without. The execution times are compared with those of ProbLog, cplint and CVE. PITA was almost always able to solve larger problems in a shorter time on both type of domains.",
author = "Fabrizio Riguzzi and Terrance Swift",
year = "2010",
language = "English (US)",
volume = "598",
booktitle = "CEUR Workshop Proceedings",

}

TY - GEN

T1 - An extended semantics for logic programs with annotated disjunctions and its efficient implementation

AU - Riguzzi, Fabrizio

AU - Swift, Terrance

PY - 2010

Y1 - 2010

N2 - Logic Programming with Annotated Disjunctions (LPADs) is a formalism for modeling probabilistic information that has recently received increased attention. The LPAD semantics, while being simple and clear, suffers from the requirement of having function free-programs, which is a strong limitation. In this paper we present an extension of the semantics that removes this restriction and allows us to write programs modeling infinite domains, such as Hidden Markov Models. We show that the semantics is well-defined for a large class of programs. Moreover, we present the algorithm "Probabilistic Inference with Tabling and Answer subsumption" (PITA) for computing the probability of queries to programs according to the extended semantics. Tabling and answer subsumption not only ensure the correctness of the algorithm with respect to the semantics but also make it very efficient on programs without function symbols. PITA has been implemented in XSB and tested on six domains: two with function symbols and four without. The execution times are compared with those of ProbLog, cplint and CVE. PITA was almost always able to solve larger problems in a shorter time on both type of domains.

AB - Logic Programming with Annotated Disjunctions (LPADs) is a formalism for modeling probabilistic information that has recently received increased attention. The LPAD semantics, while being simple and clear, suffers from the requirement of having function free-programs, which is a strong limitation. In this paper we present an extension of the semantics that removes this restriction and allows us to write programs modeling infinite domains, such as Hidden Markov Models. We show that the semantics is well-defined for a large class of programs. Moreover, we present the algorithm "Probabilistic Inference with Tabling and Answer subsumption" (PITA) for computing the probability of queries to programs according to the extended semantics. Tabling and answer subsumption not only ensure the correctness of the algorithm with respect to the semantics but also make it very efficient on programs without function symbols. PITA has been implemented in XSB and tested on six domains: two with function symbols and four without. The execution times are compared with those of ProbLog, cplint and CVE. PITA was almost always able to solve larger problems in a shorter time on both type of domains.

UR - http://www.scopus.com/inward/record.url?scp=84883407735&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883407735&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84883407735

VL - 598

BT - CEUR Workshop Proceedings

ER -