Characterizing consistency in probabilistic logic for a class of Horn clauses

DOI10.1007/BF01581149MaRDI QIDQ1340063zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1187083
• On consistency in probabilistic logic for logical formulas represented by B-hypertrees
• Interval-valued probabilistic logic for a class of Horn clauses
• Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
• scientific article; zbMATH DE number 988760

Cites work

• A linear programming approach to reasoning about probabilities
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• Column Generation Methods for Probabilistic Logic
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Gainfree Leontief substitution flow problems
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 4066847 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 1324220 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
• On certain polytopes associated with graphs
• Probabilistic logic
• Probabilistic satisfiability
• Probability logic

Cited in

(5)

• On consistency in probabilistic logic for logical formulas represented by B-hypertrees
• Interval-valued probabilistic logic for a class of Horn clauses
• Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
• Theory and algorithms for analysing the consistent region in probabilistic logic
• scientific article; zbMATH DE number 1187083 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340063)