On the Compilability and Expressive Power of Propositional Planning Formalisms
Bernhard NebelPublished in: CoRR (2011)
Keyphrases
- expressive power
- first order logic
- computational properties
- knowledge representation
- data complexity
- propositional logic
- query language
- transitive closure
- relational algebra
- planning problems
- causal graph
- probabilistic reasoning
- knowledge base
- relation algebra
- knowledge representation and reasoning
- recursive queries
- aggregate functions
- machine learning
- default logic
- complex objects
- incomplete information
- logic programming
- artificial intelligence