On consistency in probabilistic logic for logical formulas represented by B-hypertrees
From MaRDI portal
On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees
Recommendations
- scientific article; zbMATH DE number 1187083
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- Validation of Stochastic Systems
- Theory and algorithms for analysing the consistent region in probabilistic logic
- On the satisfiability of some simple probabilistic logics
- Inconsistency measures for probabilistic logics
- Probabilistic logics with independence and confirmation
- Probabilization of logics: completeness and decidability
Cites work
- A class of logic problems solvable by linear programming
- A linear programming approach to reasoning about probabilities
- Algorithms for testing the satisfiability of propositional formulae
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- Column Generation Methods for Probabilistic Logic
- Convex Programming Methods for Global Optimization
- Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
- Directed hypergraphs and applications
- scientific article; zbMATH DE number 1324220 (Why is no real title available?)
- Probabilistic logic
Cited in
(3)
This page was built for publication: On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296806)
