1532 search results - page 160 / 307 » The Symbol Grounding Problem |
135
click to vote
TIME
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
158
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
132
click to vote
CAV
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
161
click to vote
CCL
1994
Springer
15 years 8 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
171
click to vote
AIIA
1991
Springer
15 years 8 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...