Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time.

Kenneth A. Berman John V. Franco John S. Schlipf

Published in: Discret. Appl. Math. (1995)

Keyphrases

propositional logic
np hard
worst case
satisfiability problem
database
neural network
horn clauses
satisfiability testing
xml documents
np complete
knowledge compilation
decision procedures
owl dl ontology