1410 search results - page 133 / 282 » Proving theorems by reuse |
135
click to vote
EHCI
2001
15 years 7 months ago
2001
Abstract. Systematic user errors commonly occur in the use of interactive systems. We describe a formal reusable user model implemented in higher-order logic that can be used for m...
144
click to vote
AAAI
1992
15 years 7 months ago
1992
We define fuzzy constraint networks and prove a theorem about their relationship to fuzzy logic. Then we introduce Khayyam, a fuzzy constraint-based programming language in which ...
159
click to vote
CPC
2008
15 years 6 months ago
2008
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
149
click to vote
APPML
2006
15 years 6 months ago
2006
We give an example of supersonic solutions to a one-dimensional steady state Euler-Poisson system arising in the modeling of plasmas and semiconductors. The existence of the supers...
135
click to vote
IANDC
2008
15 years 6 months ago
2008
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...