Hybrid probabilistic programs

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