Probabilistic satisfiability and coherence checking through integer programming
نویسندگان
چکیده
منابع مشابه
Probabilistic Satisfiability and Coherence Checking through Integer Programming
This paper presents algorithms based on integer programming, both for probabilistic satisfiability and coherence checking. That is, we consider probabilistic assessments for both standard probability measures (Kolmogorovian setup) and full conditional measures (de Finettian coherence setup), and in both cases verify satisfiability/coherence using integer programming. We present empirical evalua...
متن کاملChecking System Properties via Integer Programming
The marking equation is a well known veriication method in the Petri net community. It has also be applied by Avrunin, Corbett et al. to automata models. It is a semidecision method, and it may fail to give an answer for some systems, in particular for those communicating by means of shared variables. In this paper, we complement the marking equation by a so called trap equation. We show that b...
متن کاملBounds for probabilistic integer programming problems
We consider stochastic integer programming problems with probabilistic constraints. The concept of a p-efficient point of a probability distribution is used to derive various equivalent problem formulations. Next we introduce new methods for constructing lower and upper bounds for probabilistically constrained integer programs. We also show how limited information about the distribution can be ...
متن کاملOn Stochastic Integer Programming under Probabilistic Constraints
We consider stochastic programming problems with probabilistic constraints in volving integer valued random variables The concept of p e cient points of a prob ability distribution is used to derive various equivalent problem formulations Next we modify the concept of r concave discrete probability distributions and analyse its relevance for problems under consideration These notions are used t...
متن کاملSatisfiability Checking ⋆
We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging modelchecking benchmarks to both explicit and symbolic model checkers. For symbolic model checking, we use CadenceSMV, NuSMV, and SAL-SMC. For explicit model checking, we use SPIN as the search engine, and we test essentially all pub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2015
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2014.09.002