Login / Signup
Algorithms for Testing the Satisfiability of Propositional Formulae.
Giorgio Gallo
Giampaolo Urbani
Published in:
J. Log. Program. (1989)
Keyphrases
</>
computational complexity
orders of magnitude
significant improvement
propositional logic
computational cost
computationally efficient
data sets
neural network
learning algorithm
lower bound
worst case
optimization problems
test cases
first order logic
satisfiability testing