Results 1  10
of
36
Seven Days in the Life of a Robotic Agent
, 2002
"... Bootstrapping is a widely employed technique in the process of building highly complex systems such as microprocessors, language compilers, and computer operating systems. It could play an even more prominent role in the creation of computation systems capable of supporting intelligent agent beha ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
Bootstrapping is a widely employed technique in the process of building highly complex systems such as microprocessors, language compilers, and computer operating systems. It could play an even more prominent role in the creation of computation systems capable of supporting intelligent agent behaviors because of the even higher level of complexity. The prospect of a selfbootstrapping, selfimproving intelligent system has motivated various fields of research in machine learning. However, a robust, generalizable methodology of machine learning is yet to be found; there are still a lot of learning behaviors that no existing learning technique can adequately account for. We believe a uniform, logicbased system such as active logic [1, 2], will be more successful in the realization of this ideal. The overall architecture that we envision is as follows: a central commonsense reasoner module attends to novel situations where the system does not already have expertise, and to its own failures; it then reasons its way to solutions or repairs, and puts these into action while at the same time causing "expert" modules to be either created or retrained so as to more quickly enact those solutions on future occasions. Thus what we propose is a kind of meld between declarative and procedural techniques where the former has great expressive power and flexibility (but is slow) and the latter is very fast but hard to adapt to new situations.
The Dynamics of Syntactic Knowledge
 JOURNAL OF LOGIC AND COMPUTATION
, 2006
"... The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, we combine the syntactic approach with modal logic, using transition systems to model reasoning. We use two syntactic epi ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, we combine the syntactic approach with modal logic, using transition systems to model reasoning. We use two syntactic epistemic modalities: ‘knowing at least ’ a set of formulae and ‘knowing at most’ a set of formulae. We are particularly interested in models restricting the set of formulae known by an agent at a point in time to be finite. The resulting systems are investigated from the point of view of axiomatization and complexity. We show how these logics can be used to formalise nonomniscient agents who know some inference rules, and study their relationship to other systems of syntactic epistemic logics,
Towards DomainIndependent, TaskOriented, Conversational Adequacy
 In Proceedings of IJCAI2003 Intelligent Systems Demonstrations
, 2003
"... A short description of ALFRED, a metareasoning, naturallanguage HCI system. ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
(Show Context)
A short description of ALFRED, a metareasoning, naturallanguage HCI system.
Complete axiomatizations of finite syntactic epistemic states
 In Proceedings of the 3rd International Workshop on Declarative Agent Languages and Technologies (DALT
, 2005
"... Abstract. An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this set cannot in general be assumed – reasoning takes time and real agents frequently have contradictory beliefs. Th ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(Show Context)
Abstract. An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this set cannot in general be assumed – reasoning takes time and real agents frequently have contradictory beliefs. This paper discusses a formal model of knowledge as explicitly computed sets of formulae. It is assumed that agents represent their knowledge syntactically, and that they can only know finitely many formulae at a given time. Existing syntactic characterizations of knowledge seem to be too general to have any interesting properties, but we extend the meta language to include an operator expressing that an agent knows at most a particular finite set of formulae. The specific problem we consider is the axiomatization of this logic. A sound system is presented. Strong completeness is impossible, so instead we characterize the theories for which we can get completeness. Proving that a theory actually fits this characterization, including proving weak completeness of the system, turns out to be nontrivial. One of the main results is a collection of algebraic conditions on sets of epistemic states described by a theory, which are sufficient for completeness. The paper is a contribution to a general abstract theory of resource bounded agents. Interesting results, e.g. complex algebraic conditions for completeness, are obtained from very simple assumptions, i.e. epistemic states as arbitrary finite sets and operators for knowing at least and at most. 1
Strongly complete axiomatizations of ”knowing at most” in standard syntactic assignments
 In Francesca Toni and Paolo Torroni, editors, Preproceedings of the 6 th International Workshop on Computational Logic in Multiagent Systems (CLIMA VI
, 2005
"... Abstract. Standard syntactic assignments (SSAs) model knowledge directly rather than as truth in all possible worlds as in modal epistemic logic, by assigning arbitrary truth values to atomic epistemic formulae. It is a very general approach to epistemic logic, but has no interesting logical propert ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Standard syntactic assignments (SSAs) model knowledge directly rather than as truth in all possible worlds as in modal epistemic logic, by assigning arbitrary truth values to atomic epistemic formulae. It is a very general approach to epistemic logic, but has no interesting logical properties — partly because the standard logical language is too weak to express properties of such structures. In this paper we extend the logical language with a new operator used to represent the proposition that an agent “knows at most ” a given finite set of formulae and study the problem of strongly complete axiomatization of SSAs in this language. Since the logic is not semantically compact, a strongly complete finitary axiomatization is impossible. Instead we present, first, a strongly complete infinitary system, and, second, a strongly complete finitary system for a slightly weaker variant of the language. 1
Rulebased and resourcebounded: A new look at epistemic logic
, 2006
"... Syntactic logics do not suffer from the problems of logical omniscience but are often thought to lack interesting properties relating to epistemic notions. By focusing on the case of rulebased agents, I develop a framework for modelling resourcebounded agents and show that the resulting models hav ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
Syntactic logics do not suffer from the problems of logical omniscience but are often thought to lack interesting properties relating to epistemic notions. By focusing on the case of rulebased agents, I develop a framework for modelling resourcebounded agents and show that the resulting models have a number of interesting properties.
Partial planning for situated agents based on active logic
 In Workshop on Logics for Resource Bounded Agents, ESSLLI
, 2006
"... This paper presents an investigation of rational agents that have limited computational resources and intentionally interact with their environments. We present an example logical formalism, based on Active Logic and Situation Calculus, that can be employed in order to satisfy the requirements arisi ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
This paper presents an investigation of rational agents that have limited computational resources and intentionally interact with their environments. We present an example logical formalism, based on Active Logic and Situation Calculus, that can be employed in order to satisfy the requirements arising due to being situated in a dynamic universe. We analyse how such agents can combine, in a timeaware fashion, inductive learning from experience and deductive reasoning using domain knowledge. In particular, we consider how partial plans are created and reasoned about, focusing on what new information can be provided as a result of action execution. 1
Research Chapters in the area of Stream Reasoning
"... Abstract. Data streams occur in a variety of modern applications. Specialized Stream Database Management Systems proved to be an optimal solution for on the fly analysis of data streams, but they cannot perform complex reasoning tasks that requires to combine the streaming data with less time varian ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Data streams occur in a variety of modern applications. Specialized Stream Database Management Systems proved to be an optimal solution for on the fly analysis of data streams, but they cannot perform complex reasoning tasks that requires to combine the streaming data with less time variant knowledge. At the same time, while reasoners are year after year scaling up in the classical, time invariant domain of ontological knowledge, reasoning upon rapidly changing information has been neglected or forgotten. We hereby propose stream reasoning an unexplored, yet high impact, research area as the new multidisciplinary approach which will provide the abstractions, foundations, methods, and tools required to integrate data streams and reasoning systems. In particular the focus of this paper is to sketch the research chapters of Stream Reasoning. 1
Specification of a Test Environment and Performance Measures for PerturbationTolerant Cognitive Agents
"... In this paper I propose a flexible method of characterizing a test environment such that its environmental complexity, information density, variability and volatility can be easily measured. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper I propose a flexible method of characterizing a test environment such that its environmental complexity, information density, variability and volatility can be easily measured.
A strongly complete logic of dense time intervals
 Proceedings of the Workshop on Logics for Resource Bounded Agents, Malaga
, 2006
"... michal,bezem¡ We discuss briefly the duality (or rather, complementarity) of system descriptions based on actions and transitions, on the one hand, and states and their changes, on the other. We settle for the latter and present a simple language, for describing state changes, which is parameterized ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
michal,bezem¡ We discuss briefly the duality (or rather, complementarity) of system descriptions based on actions and transitions, on the one hand, and states and their changes, on the other. We settle for the latter and present a simple language, for describing state changes, which is parameterized by an arbitrary language for describing properties of the states. The language can be viewed as a simple fragment of step logic, admitting however various extensions by appropriate choices of the underlying logic. Alternatively, it can be seen as a very specific fragment of temporal logic (with a variant of ‘until ’ or ‘chop ’ operator), and is interpreted over dense (possibly continuous) linear time. The reasoning system presented here is sound, as well as strongly complete and decidable (provided that so is the parameter logic for reasoning about a single state). We give the main idea of the completeness proof and suggest a wide range of possible applications (action based descriptions, active logic, bounded agents), which is a simple consequence of the parametric character of both the language and the reasoning system. 1