Column Generation Methods for Probabilistic Logic
From MaRDI portal
Publication:4025903
DOI10.1287/ijoc.3.2.135zbMath0800.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
column generationartificial intelligenceexpert systemscolumn generation algorithmprobabilistic satisfiabilityNilsson's model
Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Related Items
Projection, consistency, and George Boole, Probabilistic logic under coherence: complexity and algorithms, Coherence graphs, 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, Direct algorithms for checking consistency and making inferences from conditional probability assessments, Boole's conditions of possible experience and reasoning under uncertainty, Statistical matching of multiple sources: A look through coherence, Resolution and the integrality of satisfiability problems, Conformity and independence with coherent lower previsions, Expressive probabilistic description logics, Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence, Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation, A further step for efficient corrections of inconsistent probabilistic data sets, Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation, Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds, Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, Sequential decision making with partially ordered preferences, Focused most probable world computations in probabilistic logic programs, Best second order bounds for two-terminal network reliability with dependent edge failures, Weak nonmonotonic probabilistic logics, Quantitative Logic Reasoning, Aggregating disparate estimates of chance, An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version), Compatibility, desirability, and the running intersection property, Towards classifying propositional probabilistic logics, An anytime deduction algorithm for the probabilistic logic and entailment problems, Inferential models and relevant algorithms in a possibilistic framework, Merging the local and global approaches to probabilistic satisfiability, Probability logic and optimization SAT: The PSAT and CPA models, A Hybrid Method for Probabilistic Satisfiability, Credal networks, Polynomially Computable Bounds for the Probability of the Union of Events, Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem, On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees, Probabilistic satisfiability and coherence checking through integer programming, Probabilistic satisfiability with imprecise probabilities, Computing posterior upper expectations, A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments, Logics with Probability Operators, Inference flexibility in Horn clause knowledge bases and the simplex method, Combining probabilistic logic programming with the power of maximum entropy
