4622 search results - page 20 / 925 » Foundations of Information Theory |
ENTCS
2006
14 years 11 months ago
2006
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
101
click to vote
KR
1998
Springer
15 years 4 months ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
HICSS
2002
IEEE
15 years 4 months ago
2002
IEEE
The state of service management practice and the developments in ICT-efficiency research prompt the call for managerial relevance, normative theory building and the conceptualizat...
111
click to vote
ENTCS
2007
14 years 11 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
ATAL
1995
Springer
15 years 3 months ago
1995
Springer
This paper describes a novel approach to high-level agent programming based on a highly developed logical theory of action. The user provides a specification of the agents’ bas...