scholarly journals Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs

2021 ◽  
Vol 345 ◽  
pp. 14-26
Author(s):  
Damiano Azzolini ◽  
Fabrizio Riguzzi
Keyword(s):  
Probabilistic Logic ◽  
Logic Programs

scholarly journals The theory of interval probabilistic logic programs

2008 ◽  
Vol 55 (3-4) ◽  
pp. 355-388 ◽  
Author(s):  
Alex Dekhtyar ◽  
Michael I. Dekhtyar
Keyword(s):  
Probabilistic Logic ◽  
Logic Programs

scholarly journals Lifted discriminative learning of probabilistic logic programs

2018 ◽  
Vol 108 (7) ◽  
pp. 1111-1135 ◽  
Author(s):  
Arnaud Nguembang Fadja ◽  
Fabrizio Riguzzi
Keyword(s):  
Probabilistic Logic ◽  
Discriminative Learning ◽  
Logic Programs

Scaling Most Probable World Computations in Probabilistic Logic Programs

2008 ◽  
pp. 372-385
Author(s):  
Gerardo I. Simari ◽  
Maria Vanina Martinez ◽  
Amy Sliva ◽  
V. S. Subrahmanian
Keyword(s):  
Probabilistic Logic ◽  
Logic Programs

scholarly journals The PITA system: Tabling and answer subsumption for reasoning under uncertainty

2011 ◽  
Vol 11 (4-5) ◽  
pp. 433-449 ◽  
Author(s):  
FABRIZIO RIGUZZI ◽  
TERRANCE SWIFT
Keyword(s):  
Logic Programming ◽  
Probabilistic Logic ◽  
Similar Distribution ◽  
Logic Programs ◽  
Reasoning Under Uncertainty ◽  
Complex Queries ◽  
Possibilistic Logic ◽  
Distribution Semantics ◽  
Measure Of Uncertainty ◽  
Very High

AbstractMany real world domains require the representation of a measure of uncertainty. The most common such representation is probability, and the combination of probability with logic programs has given rise to the field of Probabilistic Logic Programming (PLP), leading to languages such as the Independent Choice Logic, Logic Programs with Annotated Disjunctions (LPADs), Problog, PRISM, and others. These languages share a similar distribution semantics, and methods have been devised to translate programs between these languages. The complexity of computing the probability of queries to these general PLP programs is very high due to the need to combine the probabilities of explanations that may not be exclusive. As one alternative, the PRISM system reduces the complexity of query answering by restricting the form of programs it can evaluate. As an entirely different alternative, Possibilistic Logic Programs adopt a simpler metric of uncertainty than probability.Each of these approaches—general PLP, restricted PLP, and Possibilistic Logic Programming—can be useful in different domains depending on the form of uncertainty to be represented, on the form of programs needed to model problems, and on the scale of the problems to be solved. In this paper, we show how the PITA system, which originally supported the general PLP language of LPADs, can also efficiently support restricted PLP and Possibilistic Logic Programs. PITA relies on tabling with answer subsumption and consists of a transformation along with an API for library functions that interface with answer subsumption. We show that, by adapting its transformation and library functions, PITA can be parameterized to PITA(IND, EXC) which supports the restricted PLP of PRISM, including optimizations that reduce non-discriminating arguments and the computation of Viterbi paths. Furthermore, we show PITA to be competitive with PRISM for complex queries to Hidden Markov Model examples, and sometimes much faster. We further show how PITA can be parameterized to PITA(COUNT) which computes the number of different explanations for a subgoal, and to PITA(POSS) which scalably implements Possibilistic Logic Programming. PITA is a supported package in version 3.3 of XSB.

Learning the Structure of Probabilistic Logic Programs

2012 ◽  
pp. 61-75 ◽  
Author(s):  
Elena Bellodi ◽  
Fabrizio Riguzzi
Keyword(s):  
Probabilistic Logic ◽  
Logic Programs

Policy Analytics Generation Using Action Probabilistic Logic Programs

2012 ◽  
pp. 515-542
Author(s):  
Gerardo I. Simari ◽  
John P. Dickerson ◽  
Amy Sliva ◽  
V. S. Subrahmanian
Keyword(s):  
Probabilistic Logic ◽  
Logic Programs ◽  
Policy Analytics

scholarly journals Using Histograms to Better Answer Queries to Probabilistic Logic Programs

2009 ◽  
pp. 40-54 ◽  
Author(s):  
Matthias Broecheler ◽  
Gerardo I. Simari ◽  
V. S. Subrahmanian
Keyword(s):  
Probabilistic Logic ◽  
Logic Programs
Sign in / Sign up

Export Citation Format

Share Document