An Efficient Solver for Parametrized Difference Revision
We present GenC, an efficient and highly-parallel belief revision solver for paramatrized difference operators. GenC uses an AllSAT solver to enumerate the possible models of a formula, and then determines the output of revision through a series of bit comparisons. The result is a system that can calculate the result of revision for formulas with 100 variables and millions of clauses in just seconds; the running times obtained by GenC far surpass existing solvers for belief revision. The system also has many features that are useful for practical problems: it supports both interactive and offline data entry, it allows multiple formats for entering formulas, and it provides output in human-readable format. Most importantly, GenC is able to model revision by any parametrized difference operator, which allows a wide range of practical problems to be easily captured.
- 2.Aravanis, T., Peppas, P.: Belief revision in answer set programming. In: Proceedings of the 21st Panhellenic Conference on Informatics (PCI 2017) (2017)Google Scholar
- 3.Dalal, M.: Investigations into a theory of knowledge base revision. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 475–479 (1988)Google Scholar
- 6.Hoos, H., Stützle, T.: SATLIB: an online resource for research on SAT. In: SAT 2000, pp. 283–292 (2000)Google Scholar
- 12.Toda, T., Tsuda, K.: BDD construction for all solutions SAT and efficient caching mechanism. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing, pp. 1880–1886 (2015)Google Scholar