Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas.
Yuping ShenXishun ZhaoPublished in: KR (2014)
Keyphrases
- logic programs
- propositional formulas
- propositional logic
- logic programming
- normal form
- fixpoint
- answer set programming
- answer sets
- stable models
- propositional satisfiability
- computational properties
- conjunctive normal form
- sat problem
- belief revision
- reasoning tasks
- machine learning
- belief change
- first order logic
- lower bound
- artificial intelligence