Characterizing consistency in probabilistic logic for a class of Horn clauses
type: Item
instance of: scholarly article
title: Characterizing consistency in probabilistic logic for a class of Horn clauses
zbMATH Open document ID: 0811.03013
DOI: 10.1007/BF01581149
author: Kim Allan Andersen
published in: Mathematical Programming. Series A. Series B
publication date: 1994-12-11T00:00:00Z
Mathematics Subject Classification ID: 03B48
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 700809
zbMATH Keywords: probabilistic logic
zbMATH Keywords: perfect graph
zbMATH Keywords: consistency
MaRDI profile type: Publication
cites work: Q4255462
cites work: Q3800008
cites work: On certain polytopes associated with graphs
cites work: Probabilistic satisfiability
cites work: Geometric algorithms and combinatorial optimization
cites work: Probability logic
cites work: Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
cites work: Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
cites work: Column Generation Methods for Probabilistic Logic
cites work: Gainfree Leontief substitution flow problems
cites work: Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
cites work: A linear programming approach to reasoning about probabilities
cites work: Q4734791
cites work: Probabilistic logic
cites work: Q3997653
cites work: Q3818127
full work available at URL: https://doi.org/10.1007/bf01581149
OpenAlex ID: W2016810775
description: scientific article; zbMATH DE number 700809