FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Dividing and conquering logic
An interpolating theorem prover
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Reasoning about partially observed actions
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Compact propositional encoding of first-order theories
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Towards controlled query evaluation for incomplete first-order databases
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
Ground Logic with Equality (GL=) is a subset of First-Order Logic (FOL) in which functions or quantifiers are excluded, but equality is preserved. We argue about GL='s unique position (in terms of expressiveness and ease of decidability) between FOL and Propositional Logic (PL). We aim to solve satisfiability (SAT) problems formulated in GL= by converting them into PL using a satisfiability-preserving conversion algorithms, and running a general SAT solver on the resulting PL Knowledge Base (KB). We introduce two conversion algorithms, with the latter utilizing the former as a subroutine, and prove their correctness - that is, that the translation preserves satisfiability. The main contribution of this work is in utilizing input fragmentation to yield PL KBs that are smaller than possible prior to our work, thus resulting in the ability to solve GL= SAT problems faster than was possible before.