Bit inference

Research output: Contribution to journalConference articlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)26-35
Number of pages10
JournalCEUR Workshop Proceedings
Volume373
StatePublished - 2008
Event1st 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 200811 Aug 2008

Fingerprint

Dive into the research topics of 'Bit inference'. Together they form a unique fingerprint.

Cite this