8512 search results - page 95 / 1703 » Computing Theory With Relevance |
CIE
2009
Springer
14 years 3 days ago
2009
Springer
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers.
SIGSOFT
2002
ACM
14 years 9 months ago
2002
ACM
Consider the execution of a failing program as a sequence of program states. Each state induces the following state, up to the failure. Which variables and values of a program sta...
SYNTHESE
2011
13 years 3 months ago
2011
Various forms of underdetermination that might threaten the realist stance are examined. That which holds between different ‘formulations’ of a theory (such as the Hamiltonian...
GC
2004
Springer
14 years 1 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 ...
ARGMAS
2006
Springer
13 years 12 months ago
2006
Springer
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...