Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas.
Yuping ShenXishun ZhaoPublished in: CoRR (2014)
Keyphrases
- logic programs
- propositional formulas
- propositional logic
- logic programming
- normal form
- answer sets
- fixpoint
- propositional satisfiability
- answer set programming
- cnf formula
- conjunctive normal form
- computational properties
- stable models
- sat problem
- abductive reasoning
- belief revision
- sat solvers
- industrial applications
- decision problems
- programming language
- relational databases
- natural language
- knowledge base
- artificial intelligence
- databases