Hardness of Preorder Checking for Basic Formalisms.
Laura BozzelliAxel LegaySophie PinchinatPublished in: LPAR (Dakar) (2010)
Keyphrases
- phase transition
- np hard
- logic programming
- learning theory
- computational complexity
- reasoning tasks
- information retrieval
- nonmonotonic reasoning
- information theoretic
- computational properties
- knowledge representation
- np complete
- fixed parameter tractable
- neural network
- consistency checking
- logic programs
- worst case
- genetic algorithm
- machine learning
- real world