Column Generation Methods for Probabilistic Logic
DOI10.1287/IJOC.3.2.135zbMATH Open0800.68864OpenAlexW1965892141MaRDI QIDQ4025903
Marcus V. Poggi de Aragão, Brigitte Jaumard, Pierre Hansen
Publication date: 18 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.3.2.135
artificial intelligencecolumn generationcolumn generation algorithmexpert systemsprobabilistic satisfiabilityNilsson's model
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic in artificial intelligence (68T27)
Cited In (44)
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- A Hybrid Method for Probabilistic Satisfiability
- Projection, consistency, and George Boole
- An anytime deduction algorithm for the probabilistic logic and entailment problems
- Compatibility, desirability, and the running intersection property
- Inferential models and relevant algorithms in a possibilistic framework
- Resolution and the integrality of satisfiability problems
- Polynomially Computable Bounds for the Probability of the Union of Events
- Computing posterior upper expectations
- Towards classifying propositional probabilistic logics
- Boole's conditions of possible experience and reasoning under uncertainty
- A column generation approach to job grouping for flexible manufacturing systems
- Best second order bounds for two-terminal network reliability with dependent edge failures
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
- On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees
- Focused most probable world computations in probabilistic logic programs
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- Conformity and independence with coherent lower previsions
- Merging the local and global approaches to probabilistic satisfiability
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Logics with Probability Operators
- Inference flexibility in Horn clause knowledge bases and the simplex method
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- A further step for efficient corrections of inconsistent probabilistic data sets
- Sequential decision making with partially ordered preferences
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- Coherence graphs
- Statistical matching of multiple sources: A look through coherence
- Expressive probabilistic description logics
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
- Probabilistic satisfiability with imprecise probabilities
- 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
- Credal networks
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Combining probabilistic logic programming with the power of maximum entropy
- An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version)
- Genetic algorithms and tabu search: Hybrids for optimization
- Quantitative Logic Reasoning
- Probabilistic logic under coherence: complexity and algorithms
- Probabilistic satisfiability and coherence checking through integer programming
- Probability logic and optimization SAT: The PSAT and CPA models
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)