Merging the local and global approaches to probabilistic satisfiability
DOI10.1016/J.IJAR.2007.03.001zbMATH Open1343.68220OpenAlexW1987500336MaRDI QIDQ2270380
Publication date: 18 March 2010
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2007.03.001
linear programmingstabilizationcolumn generationprobabilistic satisfiabilityprobabilistic entailmentrule-based approach
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- A Linear Programming Approach to the Cutting-Stock Problem
- Stochastic independence in a coherent setting
- Probabilistic logic
- Stabilized column generation
- A linear programming approach to reasoning about probabilities
- Column Generation Methods for Probabilistic Logic
- Variable neighborhood search
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Variable Neighborhood Search
- A logic for reasoning about probabilities
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Anytime deduction for probabilistic logic
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
- On the uncertainties transmitted from premises to conclusions in deductive inferences
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Probabilistic satisfiability
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
- Probabilistic satisfiability
- Probabilistic logic revisited
- Boole's conditions of possible experience and reasoning under uncertainty
- An anytime deduction algorithm for the probabilistic logic and entailment problems
- On cautious probabilistic inference and default detachment
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- Probabilistic Reasoning in the Description Logic $$\mathcal {ALCP}$$ with the Principle of Maximum Entropy
- A Hybrid Method for Probabilistic Satisfiability
- Projection, consistency, and George Boole
- Variable neighbourhood search: Methods and applications
- Towards classifying propositional probabilistic logics
- Variable neighbourhood search: methods and applications
- Sequential decision making with partially ordered preferences
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- Logic optimality for multi-objective optimization
- Probabilistic sentence satisfiability: an approach to PSAT
- Syntactic reasoning with conditional probabilities in deductive argumentation
- Inconsistency-tolerant reasoning over linear probabilistic knowledge bases
- Probabilistic satisfiability and coherence checking through integer programming
- Probabilistic logic with independence
Uses Software
This page was built for publication: Merging the local and global approaches to probabilistic satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270380)
