1532 search results - page 81 / 307 » The Symbol Grounding Problem |
170
click to vote
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend ...
126
click to vote
EURODAC
1995
IEEE
15 years 7 months ago
1995
IEEE
Computing equivalence classes for FSMs has several applications to synthesis and veri cation problems. Symbolic traversal techniques are applicable to medium-small circuits. This ...
132
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
125
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
124
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....