Interval-valued probabilistic logic for a class of Horn clauses (Q1388210)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Interval-valued probabilistic logic for a class of Horn clauses |
scientific article; zbMATH DE number 1162022
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Interval-valued probabilistic logic for a class of Horn clauses |
scientific article; zbMATH DE number 1162022 |
Statements
Interval-valued probabilistic logic for a class of Horn clauses (English)
0 references
10 December 1998
0 references
Horn clauses (i.e., formulas of predicate calculus ending in the implication of an atomic clause) have a large subclass that can be efficiently represented by directed graphs. The author shows that for these clauses and probabilistic evaluation of their truth value, the linear programming approach of Nilsson yields efficient solutions of the consistency and entailment problems.
0 references
probabilistic evaluation of truth value
0 references
Horn clauses
0 references
linear programming approach
0 references
consistency
0 references
entailment
0 references
0.8222813606262207
0 references
0.799383282661438
0 references
0.7846977114677429
0 references
0.7808377146720886
0 references
