Sciweavers

1941 search results - page 128 / 389
» On the Hardness of Approximate Reasoning
Sort
View
CADE
2008
Springer
16 years 6 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
ICEIS
2005
IEEE
16 years 20 hour ago
A Survey of Case-Based Diagnostic Systems for Machines
Electrical and mechanical equipment such as gearboxes in an industrial robot or electronic circuits in an industrial printer sometimes fail to operate as intended. The faulty compo...
Erik Olsson
HICSS
2003
IEEE
134views Biometrics» more  HICSS 2003»
15 years 11 months ago
User Centred Opportunities for Supporting Consumer Behaviour Through Handheld and Ubiquitous Computing
Moving around our physical environment, we are surrounded and interact with information that exhorts and stimulates us to buy things. For most of us, not all of these impulses are...
Kenton O'Hara, Mark Perry
TPHOL
2002
IEEE
15 years 11 months ago
Quotient Types: A Modular Approach
In this paper we introduce a new approach to axiomatizing quotient types in type theory. We suggest replacing the existing monolithic rule set by a modular set of rules for a speci...
Aleksey Nogin
CCL
1994
Springer
15 years 10 months ago
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Tomás E. Uribe, Mark E. Stickel