Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae.
Ofer ArieliPublished in: ACM Trans. Comput. Log. (2007)
Keyphrases
- quantified boolean formulae
- propositional logic
- symmetry breaking
- prime implicates
- knowledge compilation
- quantified boolean formulas
- first order logic
- belief revision
- prime implicants
- davis putnam
- combinatorial problems
- constraint satisfaction problems
- constraint programming
- search tree
- integer linear programming
- sat problem
- propositional satisfiability
- artificial intelligence
- sat solvers
- database systems