Sciweavers

551 search results - page 71 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
CAGD
2006
97views more  CAGD 2006»
14 years 9 months ago
Conditions for use of a non-selfintersection conjecture
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
Lars-Erik Andersson, Neil F. Stewart, Malika Zidan...
JAL
2008
83views more  JAL 2008»
14 years 9 months ago
Objective Bayesian probabilistic logic
This paper develops connections between objective Bayesian epistemology--which holds that the strengths of an agent's beliefs should be representable by probabilities, should...
Jon Williamson
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
14 years 9 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
JSYML
2000
103views more  JSYML 2000»
14 years 9 months ago
A Model Complete Theory of Valued D-Fields
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for...
Thomas Scanlon
CORR
1999
Springer
115views Education» more  CORR 1999»
14 years 9 months ago
The Symbol Grounding Problem
: There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This pa...
Stevan Harnad