Login / Signup
An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences.
Vikraman Arvind
Somenath Biswas
Published in:
Inf. Process. Lett. (1987)
Keyphrases
</>
np hard
dynamic programming
optimal solution
satisfiability problem
computational complexity
search space
np complete
objective function
natural language
orders of magnitude
knowledge base
simulated annealing
sat problem
conjunctive normal form