Reason Maintenance - State of the Art

This paper describes state of the art in reason maintenance with a focus on its future usage in the KiWi project. To give a bigger picture of the field, it also mentions closely related issues such as non-monotonic logic and paraconsistency. The paper is organized as follows: first, two motivating scenarios referring to semantic wikis are presented which are then used to introduce the different reason maintenance techniques

The KB paradigm and its application to interactive configuration

The knowledge base paradigm aims to express domain knowledge in a rich formal language, and to use this domain knowledge as a knowledge base to solve various problems and tasks that arise in the domain by applying multiple forms of inference. As such, the paradigm applies a strict separation of concerns between information and problem solving. In this paper, we analyze the principles and feasibility of the knowledge base paradigm in the context of an important class of applications: interactive configuration problems. In interactive configuration problems, a configuration of interrelated objects under constraints is searched, where the system assists the user in reaching an intended configuration. It is widely recognized in industry that good software solutions for these problems are very difficult to develop. We investigate such problems from the perspective of the KB paradigm. We show that multiple functionalities in this domain can be achieved by applying different forms of logical inferences on a formal specification of the configuration domain. We report on a proof of concept of this approach in a real-life application with a banking company. To appear in Theory and Practice of Logic Programming (TPLP).Comment: To appear in Theory and Practice of Logic Programming (TPLP

Scheduling with partial orders and a causal model

In an ongoing project at Honeywell SRC, we are constructing a prototype scheduling system for a NASA domain using the 'Time Map Manager' (TMM). The TMM representations are flexible enough to permit the representation of precedence constraints, metric constraints between activities, and constraints relative to a variety of references (e.g., Mission Elapsed Time vs. Mission Day). The TMM also supports a simple form of causal reasoning (projection), dynamic database updates, and monitoring specified database properties as changes occur over time. The greatest apparent advantage to using the TMM is the flexibility added to the scheduling process: schedules are constructed by a process of 'iterative refinement,' in which scheduling decisions correspond to constraining an activity either with respect to another activity or with respect to one time line. The schedule becomes more detailed as activities and constraints are added. Undoing a scheduling decision means removing a constraint, not removing an activity from a specified place on the time line. For example, we can move an activity around on the time line by deleting constraints and adding new ones

An efficient temporal logic for robotic task planning

Computations required for temporal reasoning can be prohibitively expensive if fully general representations are used. Overly simple representations, such as totally ordered sequence of time points, are inadequate for use in a nonlinear task planning system. A middle ground is identified which is general enough to support a capable nonlinear task planner, but specialized enough that the system can support online task planning in real time. A Temporal Logic System (TLS) was developed during the Intelligent Task Automation (ITA) project to support robotic task planning. TLS is also used within the ITA system to support plan execution, monitoring, and exception handling

A Historical Perspective on Runtime Assertion Checking in Software Development

This report presents initial results in the area of software testing and analysis produced as part of the Software Engineering Impact Project. The report describes the historical development of runtime assertion checking, including a description of the origins of and significant features associated with assertion checking mechanisms, and initial findings about current industrial use. A future report will provide a more comprehensive assessment of development practice, for which we invite readers of this report to contribute information

Modelling process knowledge in architectural design: A case-based approach

The paper presents on-going research aimed at the understanding and support of process knowledge in architectural design, from early and not sufficiently defined, to satisfactorily-defined phases. Today, technical, planning, management and environmental issues have created a scenario of such complexity that traditionally efficient control tools (e.g. technical manuals) are inadequate and there is a demand for new, integrated instruments to handle the decision process underlying architectural design. We assume design as a recursive and incrementally specified intentional planning activity, involving goals, constraints and their relationships. The essence of architectural design is thus encapsulated in the continual recursive transformation of the initial model, in order to map the desired state onto the enacted one. On the basis of this concept of design we describe the model of an environment aimed at progressively representing the enlarging space of acquired knowledge, and at supporting the designer's central role in the management of complexity