1532 search results - page 159 / 307 » The Symbol Grounding Problem |
115
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
123
click to vote
CC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
124
click to vote
AISC
2004
Springer
15 years 10 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
129
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
139
click to vote
CAV
2003
Springer
15 years 10 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...