5 citations · 9 across the 9 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LO2012★ 1 cited
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…
cs.LO2012
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…