Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage in Boolean satisability procedures. Sets of variables are represented as bit vectors and formulæ as matrices. Symbolic operations are performed by bit arithmetic. As examples of inference done in this fashion, we describe ground resolution and ground completion.
|Number of pages||10|
|Journal||CEUR Workshop Proceedings|
|State||Published - 2008|
|Event||1st International Workshop on Practical Aspects of Automated Reasoning, PAAR 2008, Held Jointly with the Workshop on Evaluation of Systems for Higher Order Logic, ESHOL 2008 - Sydney, NSW, Australia|
Duration: 10 Aug 2008 → 11 Aug 2008