We consider the separation problem for sets X that are inverse images of a given set S by a linear mapping. Classical examples occur in integer programming, complementarity problems and other optimization problems. One would like to generate valid inequalities that cut off some point not lying in X , without reference to the linear mapping. Formulas for such inequalities can be obtained through...

Abstract In Minker and Rajasekar (J Log Program 9(1):45–74, 1990), proposed a semantics for negation-free disjunctive logic programs that offers natural generalisation of the fixed point definite programs. We show this can be further generalised with classical negation, in constructive modal-theoretic framework where rules are built from claims hypotheses , namely, formulas form $$\Box \varphi ...

Since their introduction in form of a canonical representation logical functions, the Binary Decision Diagrams (BDDs) gained wide acceptance numerous industrial applications. This paper summarizes properties BDD Minimal Cut Sets (MCS) Fault Tree (FT) models most typically encountered nuclear energetics. sets from MCS are defined as paths top node to terminal nodes BDD, on which quantitative and...