Postprint version. Published in International Conference on Logic Programming (ICLP’97) Proceedings: Leuven, Belgium, July 1, 1997, pages 391-405.
Copyright © 1997 Springer.
NOTE: At the time of publication, the author Alex Dekhtyar was not yet affiliated with Cal Poly.
The precise probability of a compound event (e.g. e1 V 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 [20, 24, 25, 26] 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.