Sciweavers

410 search results - page 26 / 82
» Interval Arithmetic and Standardization
Sort
View
AAAI
2006
13 years 9 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...
Tobias Schmidt-Samoa
JSYML
2006
91views more  JSYML 2006»
13 years 7 months ago
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...
Leszek Aleksander Kolodziejczyk
FPL
2007
Springer
190views Hardware» more  FPL 2007»
14 years 1 months ago
Automatic Accuracy-Guaranteed Bit-Width Optimization for Fixed and Floating-Point Systems
In this paper we present Minibit+, an approach that optimizes the bit-widths of fixed-point and floating-point designs, while guaranteeing accuracy. Our approach adopts differen...
William G. Osborne, Ray C. C. Cheung, José ...
AI
1999
Springer
13 years 7 months ago
Modal Logics, Description Logics and Arithmetic Reasoning
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
Hans Jürgen Ohlbach, Jana Koehler