On the Satisfiability of Random k-Horn Formulae.

Gabriel Istrate

Published in: Graphs, Morphisms and Statistical Physics (2001)

Keyphrases

propositional logic
random sat instances
horn clauses
np hard
satisfiability problem
np complete
satisfiability testing
uniformly distributed
decision procedures
owl dl ontology
computational complexity
randomly generated
maximal tractable