A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity

We propose a new declarative planning language, called K, which is based on principles and methods of logic programming. In this language, transitions between states of knowledge can be described, rather than transitions between completely described states of the world, which makes the language well-suited for planning under incomplete knowledge. Furthermore, it enables the use of default principles in the planning process by supporting negation as failure. Nonetheless, K also supports the representation of transitions between states of the world (i.e., states of complete knowledge) as a special case, which shows that the language is very flexible. As we demonstrate on particular examples, the use of knowledge states may allow for a natural and compact problem representation. We then provide a thorough analysis of the computational complexity of K, and consider different planning problems, including standard planning and secure planning (also known as conformant planning) problems. We show that these problems have different complexities under various restrictions, ranging from NP to NEXPTIME in the propositional case. Our results form the theoretical basis for the DLV^K system, which implements the language K on top of the DLV logic programming system.Comment: 48 pages, appeared as a Technical Report at KBS of the Vienna University of Technology, see http://www.kr.tuwien.ac.at/research/reports

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

Identification of Design Principles

This report identifies those design principles for a (possibly new) query and transformation language for the Web supporting inference that are considered essential. Based upon these design principles an initial strawman is selected. Scenarios for querying the Semantic Web illustrate the design principles and their reflection in the initial strawman, i.e., a first draft of the query language to be designed and implemented by the REWERSE working group I4

A State-Based Regression Formulation for Domains with Sensing Actions<br> and Incomplete Information

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 a three-valued characterization of domains with sensing actions to define the regression function. 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.Comment: 34 pages, 7 Figure

Can anybody help? : mitigating IS development project risk with user

In this paper we aim to gain insight into the relationship between user participation modes and project risk factors, and then we construct a model that can be used to determine how user participation can be successfully applied in ISD projects with a given set of risk factors. We perform an in-depth literature review, which aims to clarify the concept of user participation as part of risk management. We then report on the results of a case study in Cap Gemini where we conduct an exploratory research of the application of user participation in practice. For this exploratory research, a quantitative and qualitative research method was designed in the form of a survey and interviews. Though the results from our case study we gain insight into the relationship between user participation and IS project risk and also determine how user participation can be used to mitigate such risk

Answer Set Planning Under Action Costs

Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language Kc, which extends the declarative planning language K by action costs. Kc provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all plans (i.e., cheapest plans). As we demonstrate, this novel language allows for expressing some nontrivial planning tasks in a declarative way. Furthermore, it can be utilized for representing planning problems under other optimality criteria, such as computing ``shortest'' plans (with the least number of steps), and refinement combinations of cheapest and fastest plans. We study complexity aspects of the language Kc and provide a transformation to logic programs, such that planning problems are solved via answer set programming. Furthermore, we report experimental results on selected problems. Our experience is encouraging that answer set planning may be a valuable approach to expressive planning systems in which intricate planning problems can be naturally specified and solved

Towards Guidelines for Preventing Critical Requirements Engineering Problems

Context] Problems in Requirements Engineering (RE) can lead to serious consequences during the software development lifecycle. [Goal] The goal of this paper is to propose empirically-based guidelines that can be used by different types of organisations according to their size (small, medium or large) and process model (agile or plan-driven) to help them in preventing such problems. [Method] We analysed data from a survey on RE problems answered by 228 organisations in 10 different countries. [Results] We identified the most critical RE problems, their causes and mitigation actions, organizing this information by clusters of size and process model. Finally, we analysed the causes and mitigation actions of the critical problems of each cluster to get further insights into how to prevent them. [Conclusions] Based on our results, we suggest preliminary guidelines for preventing critical RE problems in response to context characteristics of the companies.Comment: Proceedings of the 42th Euromicro Conference on Software Engineering and Advanced Applications, 201

Drawing the line: drawing and construction strategies for simple and complex figures in Williams Syndrome and typical development

In the typical population, a series of drawing strategies have been outlined, which progressively emerge during childhood. Individuals with Williams syndrome (WS), a rare genetic disorder, produce drawings that lack cohesion, yet drawing strategies in this group have hitherto not been investigated. In this study, WS and typically developing (TD) groups drew and constructed (from pre-drawn lines and shapes) a series of intersecting and embedded figures. Participants with WS made use of the same strategies as the TD group for simple intersecting figures, though were less likely to use a typical strategy for more complex figures that contained many spatial relations. When replicating embedded shapes, the WS group used typical drawing strategies less frequently than the TD group, despite attempting to initiate a strategy that is observed in TD children. Results suggested that individuals with WS show a particular difficulty with replicating figures that include multiple spatial relations. The impact of figure complexity and task demands on performance are discussed