2308 search results - page 50 / 462 » Representing Symbolic Reasoning |
174
click to vote
RTSS
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
123
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabil...
163
click to vote
FCSC
2008
15 years 5 months 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...
142
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
There is a notable interest in extending probabilistic generative modeling principles to accommodate for more complex structured data types. In this paper we develop a generative ...
130
click to vote
DATE
2009
IEEE
16 years 7 days ago
2009
IEEE
This paper uses under-approximation of unreachable states of a design to derive incomplete specification of combinational logic. The resulting incompletely-specified functions are...