Sciweavers

1302 search results - page 151 / 261
» Free-Style Theorem Proving
Sort
View
AAAI
1992
13 years 11 months ago
Lexical Imprecision in Fuzzy Constraint Networks
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 ...
James Bowen, K. Robert Lai, Dennis Bahler
CPC
2008
135views more  CPC 2008»
13 years 10 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
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...
Michael Fuchs
APPML
2006
79views more  APPML 2006»
13 years 10 months ago
Example of supersonic solutions to a steady state Euler-Poisson system
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...
Yue-Jun Peng, Ingrid Violet
IANDC
2008
116views more  IANDC 2008»
13 years 10 months ago
Deciding expressive description logics in the framework of resolution
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...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
CORR
2006
Springer
89views Education» more  CORR 2006»
13 years 10 months ago
Finite-State Dimension and Real Arithmetic
We use entropy rates and Schur concavity to prove that, for every integer k 2, every nonzero rational number q, and every real number , the base-k expansions of , q + , and q all...
David Doty, Jack H. Lutz, Satyadev Nandakumar