Probabilistic logic programming (Q1207942)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 165615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic logic programming |
scientific article; zbMATH DE number 165615 |
Statements
Probabilistic logic programming (English)
0 references
16 May 1993
0 references
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.
0 references
model semantics
0 references
\(SLD\)-resolution
0 references
fixpoint semantic
0 references
0.8615095615386963
0 references
0.8542433977127075
0 references
0.8406676054000854
0 references
0.8295602798461914
0 references
0.8264601826667786
0 references
