TY - JOUR
T1 - Hybrid probabilistic programs
AU - Dekhtyar, Alex
AU - Subrahmanian, V. S.
N1 - Funding Information:
This work was supported by the Army Research Oce under Grants DAAH -04-95-10174, DAAH -04-96-10297, and DAAH 04-96-1-0398, by the Army Research Laboratory under contract number DAAL01-97-K0135, by an NSF Young Investigator award IRI-93-57756, and by an award from Lockheed Martin Advanced Technology Labs. We would like to thank the anonymous reviewers for pointing out a bug in an earlier version of the paper and for a number of useful comments.
PY - 2000/6
Y1 - 2000/6
N2 - 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.
AB - 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.
KW - Logic programming languages
KW - Probabilistic logic
KW - Uncertainty
UR - http://www.scopus.com/inward/record.url?scp=0000815597&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0000815597&partnerID=8YFLogxK
U2 - 10.1016/S0743-1066(99)00059-X
DO - 10.1016/S0743-1066(99)00059-X
M3 - Article
AN - SCOPUS:0000815597
SN - 0743-1066
VL - 43
SP - 187
EP - 250
JO - Journal of Logic Programming
JF - Journal of Logic Programming
IS - 3
ER -