On the Computational Complexity of Quantified Horn Clauses.
Marek KarpinskiHans Kleine BüningPeter H. SchmittPublished in: CSL (1987)
Keyphrases
- horn clauses
- computational complexity
- inference rules
- first order logic
- logic programs
- inductive logic programming
- lattice theory
- np complete
- database queries
- conceptual clustering
- special case
- high computational complexity
- database
- np hard
- computational cost
- bit rate
- general purpose
- high dimensional
- training data
- learning algorithm
- databases
- data sets