3457 search results - page 65 / 692 » A Symbol Is Not a Symbol |
COLING
1992
15 years 1 months ago
1992
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
110
Voted
FCSC
2008
15 years 20 days ago
2008
We present a computing environment for origami on the web. The environment consists of the computational origami engine Eos for origami construction, visualization, and geometrical...
113
Voted
AISC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
130
Voted
ATVA
2011
Springer
14 years 17 days ago
2011
Springer
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. T...
FMCAD
2006
Springer
15 years 4 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...