Probabilistic logic programming (Q1207942)

The logic programming language for expressing a probabilistic information is proposed. \(P\)-programs are finite sets of clauses of a special kind: the head of a clause is an atomic formula loaded by a closed interval \([a,b]\), and the body is a set of formulae (not only atomic) which are loaded by closed intervals too. The formula \(F:[a,b]\) denotes that the probability of \(F\) lies in the interval \([a,b]\). The fixpoint semantic and probabilistic model semantics are developed for such programs. A refutational procedure for a query processing to \(P\)- programs is proposed which is based on SLD-resolution.