Hybrid probabilistic programs

Alex Dekhtyar, V. S. Subrahmanian

Research output: Contribution to journalArticlepeer-review

74 Scopus citations

Abstract

The precise probability of a compound event (e.g. e1 ∨ e2, e1 ∧ e2) depends upon the known relationships (e.g. independence, mutual exclusion, ignorance of any relationship, etc.) between the primitive events that constitute the compound event. To date, most research on probabilistic logic programming has assumed that we are ignorant of the relationship between primitive events. Likewise, most research in AI (e.g. Bayesian approaches) has assumed that primitive events are independent. In this paper, we propose a hybrid probabilistic logic programming language in which the user can explicitly associate, with any given probabilistic strategy, a conjunction and disjunction operator, and then write programs using these operators. We describe the syntax of hybrid probabilistic programs, and develop a model theory and fixpoint theory for such programs. Last, but not least, we develop three alternative procedures to answer queries, each of which is guaranteed to be sound and complete.

Original languageEnglish (US)
Pages (from-to)187-250
Number of pages64
JournalJournal of Logic Programming
Volume43
Issue number3
DOIs
StatePublished - Jun 2000
Externally publishedYes

Keywords

  • Logic programming languages
  • Probabilistic logic
  • Uncertainty

ASJC Scopus subject areas

  • Logic

Fingerprint

Dive into the research topics of 'Hybrid probabilistic programs'. Together they form a unique fingerprint.

Cite this