1071 search results - page 58 / 215 » Modal Logics, Description Logics and Arithmetic Reasoning |
CADE
2004
Springer
15 years 10 months ago
2004
Springer
APAL
2006
14 years 9 months ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
166
click to vote
CADE
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
ARITH
2009
IEEE
15 years 4 months ago
2009
IEEE
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open and largely unsolved problem, espec...
CADE
2002
Springer
15 years 10 months ago
2002
Springer