From (Quantified) Boolean Formulae to Answer Set Programming.
Igor StéphanBenoit Da MotaPascal NicolasPublished in: J. Log. Comput. (2009)
Keyphrases
- abductive reasoning
- answer set programming
- quantified boolean formulae
- prime implicates
- reasoning tasks
- logic programs
- prime implicants
- quantified boolean formulas
- logic programming
- answer sets
- propositional logic
- fixpoint
- symmetry breaking
- expert systems
- software engineering
- normal form
- integrity constraints
- knowledge compilation
- first order logic
- knowledge representation
- np hard
- relational databases