On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees

DOI10.1016/S0377-2217(97)00179-3zbMath0944.90044OpenAlexW2051127798MaRDI QIDQ1296806

Kim Allan Andersen

Publication date: 27 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00179-3

zbMATH Keywords

hypergraphinteger programmingconsistencybalanced matrixprobabilistic logic

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Operations research and management science (90B99)

Cites Work

• Unnamed Item
• Probabilistic logic
• Characterizing consistency in probabilistic logic for a class of Horn clauses
• A linear programming approach to reasoning about probabilities
• Directed hypergraphs and applications
• Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
• Algorithms for testing the satisfiability of propositional formulae
• Column Generation Methods for Probabilistic Logic
• A class of logic problems solvable by linear programming
• Convex Programming Methods for Global Optimization