Sciweavers

1532 search results - page 190 / 307
» The Symbol Grounding Problem
Sort
View
TABLEAUX
2009
Springer
15 years 11 months ago
Tableaux and Model Checking for Memory Logics
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
Carlos Areces, Diego Figueira, Daniel Gorín...
GIAE
2004
Springer
136views Mathematics» more  GIAE 2004»
15 years 9 months ago
Implicit Reduced Involutive Forms and Their Application to Engineering Multibody Systems
Abstract. The RifSimp package in Maple transforms a set of differential equations to Reduced Involutive Form. This paper describes the application of RifSimp to challenging real-w...
Wenqin Zhou, David J. Jeffrey, Gregory J. Reid, Ch...
CAV
2000
Springer
138views Hardware» more  CAV 2000»
15 years 8 months ago
Counterexample-Guided Abstraction Refinement
xample-Guided Abstraction Refinement for Symbolic Model Checking EDMUND CLARKE YUAN LU Carnegie Mellon University, Pittsburgh, Pennsylvania Broadcom Co., San Jose, California ORNA ...
Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan ...
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 4 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
TNN
1998
123views more  TNN 1998»
15 years 4 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti