1532 search results - page 39 / 307 » The Symbol Grounding Problem |
158
click to vote
EACL
2010
ACL Anthology
15 years 1 months ago
2010
ACL Anthology
Until recently, referring expression generation (reg) research focused on the task of selecting the semantic content of definite mentions of listener-familiar discourse entities. I...
145
click to vote
CONCUR
2001
Springer
15 years 8 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
126
click to vote
ASPDAC
2004
ACM
15 years 7 months ago
2004
ACM
When time is incorporated in the specification of discrete systems, the complexity of verification grows exponentially. When the temporal behavior is specified with symbols, the ve...
132
Voted
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— We study the problem of designing control strategies for nondeterministic transitions systems enforcing the satisfaction of Linear Temporal Logic (LTL) formulas over th...
132
click to vote
CASC
2010
Springer
15 years 2 months ago
2010
Springer
Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods t...