134 search results - page 18 / 27 » Computationally Grounded Theories of Agency |
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
POPL
1998
ACM
14 years 25 days ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
CRITICAL
2005
13 years 10 months ago
2005
During the last few years, there have been debates over what is context and how computers should act upon it. Two disparate camps of thought can be recognized. First, Realism, hav...
LICS
2003
IEEE
14 years 1 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...