Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
John N. Hooker, G. Rago, V. Chandru, A. Shrivastav...
Abstract. When generalization algorithms are known to the public, an adversary can obtain a more precise estimation of the secret table than what can be deduced from the disclosed ...
Lei Zhang 0004, Lingyu Wang, Sushil Jajodia, Alexa...
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Optimality conditions are derived for problems of minimizing a general measure of deviation of a random variable, with special attention to situations where the random variable cou...
R. Tyrrell Rockafellar, Stan Uryasev, Michael Zaba...