Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CADE
2008
Springer

favoriteEmaildiscussreport

117views Logical Reasoning» more CADE 2008»

Bit Inference

14 years 4 months ago

Download ftp.informatik.rwth-aachen.de

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. "It does take a little bit of inference." ? Tony Fratto, Deputy Press Secretary, USA

Nachum Dershowitz

Real-time Traffic

Automated Reasoning | Boolean Satisability Procedures | CADE 2008 | Deputy Press Secretary | Efficient Propositional Inference |

claim paper

Related Content

» BitValue Inference Detecting and Exploiting Narrow Bitwidth Computations

» Inferring sequences produced by a linear congruential generator on elliptic curves missing...

» Materializing Inferred and Uncertain Knowledge in RDF Datasets

» Bit level types for high level reasoning

» Inferring Trust

» On Channel State Inference and Prediction Using Observable Variables in 80211b Network

» BitLevel Equalization and Soft Detection for GrayCoded Multilevel Modulation

» Learning Probabilistic ReadOnce Formulas on Product Distributions

» Type inference for unboxed types and first class mutability

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2008
Where	CADE
Authors	Nachum Dershowitz

Comments (0)