1948 search results - page 41 / 390 » Formalizing Mirror Theory |
ACMICEC
2006
ACM
14 years 2 months ago
2006
ACM
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
ICEIS
2003
IEEE
14 years 2 months ago
2003
IEEE
: A definition of types in an information system is given from real-world abstractions through data constructs, schema and definitions to physical data values. Category theory su...
IJAR
2008
13 years 8 months ago
2008
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
GC
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...