Characterizing consistency in probabilistic logic for a class of Horn clauses

DOI10.1007/BF01581149zbMath0811.03013OpenAlexW2016810775MaRDI QIDQ1340063

Kim Allan Andersen

Publication date: 11 December 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581149

zbMATH Keywords

consistencyperfect graphprobabilistic logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Probability and inductive logic (03B48)

Related Items (2)

Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs ⋮ On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees

Cites Work

• Probability logic
• Probabilistic logic
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• Probabilistic satisfiability
• Geometric algorithms and combinatorial optimization
• Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
• A linear programming approach to reasoning about probabilities
• On certain polytopes associated with graphs
• Gainfree Leontief substitution flow problems
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Column Generation Methods for Probabilistic Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing consistency in probabilistic logic for a class of Horn clauses