18 research outputs found
THE LOGIC OF BELIEF PERSISTENCY
The interaction bietween knowledge and belief in a temporal context is analyzed. An axiomatic formulation and semantic characterization of the principle of belief persistency implied by the standard conditionalization rule are provided. This principle says that an individual does not change her mind unless new evidence forces her to do so. It is shown that if beliefs are conscious (or stateindependent) and satisfy negative introspection then the principle of persistency of beliefs is characterized by the following axiom schema: the individual believes that 9 at date t if and orilly if she believes at date t that she will believe that 4 at date t+l.
Regression with respect to sensing actions and partial states
In this paper, we present a state-based regression function for planning
domains where an agent does not have complete information and may have sensing
actions. We consider binary domains and employ the 0-approximation [Son & Baral
2001] to define the regression function. In binary domains, the use of
0-approximation means using 3-valued states. Although planning using this
approach is incomplete with respect to the full semantics, we adopt it to have
a lower complexity. We prove the soundness and completeness of our regression
formulation with respect to the definition of progression. More specifically,
we show that (i) a plan obtained through regression for a planning problem is
indeed a progression solution of that planning problem, and that (ii) for each
plan found through progression, using regression one obtains that plan or an
equivalent one. We then develop a conditional planner that utilizes our
regression function. We prove the soundness and completeness of our planning
algorithm and present experimental results with respect to several well known
planning problems in the literature.Comment: 38 page
Electronic Enterprise Engineering - An Outline of an Architecture
In this paper we put forth a vision for organizations to fully embrace computer support. We propose a business-process oriented architecture for Electronic Enterprise Engineering (EEE) that will enable enterprises to manage and evolve all technological and organizational processes effectively; integrate and manage all enterprise information electronically; and empower knowledge workers at all levels with broad decision support capabilities. Our goal is for the EEE architecture to empower an enterprise to make the best use of its informational assets to operate effectively in this new era of electronic commerce. As part of this project we are developing a standard-based, customizable, integrated tool set called the Support Environment for Enterprise Engineering (SEEE). This paper presents the current SEEE architecture and shouts how it supports the three EEE goals
Efficient Open World Reasoning for Planning
We consider the problem of reasoning and planning with incomplete knowledge
and deterministic actions. We introduce a knowledge representation scheme
called PSIPLAN that can effectively represent incompleteness of an agent's
knowledge while allowing for sound, complete and tractable entailment in
domains where the set of all objects is either unknown or infinite. We present
a procedure for state update resulting from taking an action in PSIPLAN that is
correct, complete and has only polynomial complexity. State update is performed
without considering the set of all possible worlds corresponding to the
knowledge state. As a result, planning with PSIPLAN is done without direct
manipulation of possible worlds. PSIPLAN representation underlies the PSIPOP
planning algorithm that handles quantified goals with or without exceptions
that no other domain independent planner has been shown to achieve. PSIPLAN has
been implemented in Common Lisp and used in an application on planning in a
collaborative interface.Comment: 39 pages, 13 figures. to appear in Logical Methods in Computer
Scienc
Logics of knowledge and action: critical analysis and challenges
International audienceWe overview the most prominent logics of knowledge and action that were proposed and studied in the multiagent systems literature. We classify them according to these two dimensions, knowledge and action, and moreover introduce a distinction between individual knowledge and group knowledge, and between a nonstrategic an a strategic interpretation of action operators. For each of the logics in our classification we highlight problematic properties. They indicate weaknesses in the design of these logics and call into question their suitability to represent knowledge and reason about it. This leads to a list of research challenges
LTL Verification of Online Executions with Sensing in Bounded Situation Calculus
Abstract. We look at agents reasoning about actions from a firstperson perspective. The agent has a representation of world as situation calculus action theory. It can perform sensing actions to acquire information. The agent acts âonlineâ, i.e., it performs an action only if it is certain that the action can be executed, and collects sensing results from the actual world. When the agent reasons about its future actions, it indeed considers that it is acting online; however only possible sensing values are available. The kind of reasoning about actions we consider for the agent is verifying a first-order (FO) variant (without quantification across situations) of linear time temporal logic (LTL). We mainly focus on bounded action theories, where the number of facts that are true in any situation is bounded. The main results of this paper are: (i) possible sensing values can be based on consistency if the initial situation description is FO; (ii) for bounded action theories, progression over histories that include sensing results is always FO; (iii) for bounded theories, verifying our FO LTL against online executions with sensing is decidable.