Column Generation Methods for Probabilistic Logic
From MaRDI portal
Cited in
(46)- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
- On consistency in probabilistic logic for logical formulas represented by B-hypertrees
- Inference flexibility in Horn clause knowledge bases and the simplex method
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- A column generation approach to job grouping for flexible manufacturing systems
- Genetic algorithms and tabu search: Hybrids for optimization
- Resolution and the integrality of satisfiability problems
- Credal networks
- Probabilistic satisfiability with imprecise probabilities
- Computing posterior upper expectations
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- Probability logic and optimization SAT: The PSAT and CPA models
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Boole's conditions of possible experience and reasoning under uncertainty
- Best second order bounds for two-terminal network reliability with dependent edge failures
- Compatibility, desirability, and the running intersection property
- Towards classifying propositional probabilistic logics
- Merging the local and global approaches to probabilistic satisfiability
- Probabilistic satisfiability and coherence checking through integer programming
- Statistical matching of multiple sources: A look through coherence
- Expressive probabilistic description logics
- Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence
- Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
- Weak nonmonotonic probabilistic logics
- Aggregating disparate estimates of chance
- Projection, consistency, and George Boole
- Conformity and independence with coherent lower previsions
- Quantitative logic reasoning
- Focused most probable world computations in probabilistic logic programs
- Logics with Probability Operators
- An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version)
- A hybrid method for probabilistic satisfiability
- Polynomially computable bounds for the probability of the union of events
- Inferential models and relevant algorithms in a possibilistic framework
- A further step for efficient corrections of inconsistent probabilistic data sets
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
- Sequential decision making with partially ordered preferences
- Variable aggregation and its effect on union bounding problem
- De Finetti's legacy in dealing with uncertainty: towards finance, artificial intelligence and beyond
- Combining probabilistic logic programming with the power of maximum entropy
- Probabilistic logic under coherence: complexity and algorithms
- Coherence graphs
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- An anytime deduction algorithm for the probabilistic logic and entailment problems
This page was built for publication: Column Generation Methods for Probabilistic Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025903)
