52 citations · 103 across the 25 of their papers we have counts for
4 papers · 2 filters
ILP Modulo Theories
Panagiotis Manolios, Vasilis Papavasileiou
We present Integer Linear Programming (ILP) Modulo Theories (IMT). An IMT instance is an Integer Linear Programming instance, where some symbols have interpretations in background…
Checking Satisfiability by Dependency Sequents
Eugene Goldberg, Panagiotis Manolios
We introduce a new algorithm for checking satisfiability based on a calculus of Dependency sequents (D-sequents). Given a CNF formula F(X), a D-sequent is a record stating that und…
Removal of Quantifiers by Elimination of Boundary Points
Eugene Goldberg, Panagiotis Manolios
We consider the problem of elimination of existential quantifiers from a Boolean CNF formula. Our approach is based on the following observation. One can get rid of dependency on a…
Quantifier Elimination by Dependency Sequents
Eugene Goldberg, Panagiotis Manolios
We consider the problem of existential quantifier elimination for Boolean formulas in Conjunctive Normal Form (CNF). We present a new method for solving this problem called Derivat…