AI Planning is inherently hard and hence it is desirable to derive as much information as we can from the structure of the planning problem and let this information be exploited by a planner. Many recent planners use the finite-domain state-variable representation of the problem instead of the traditional propositional representation. However, most planning problems are still specified in the propositional representation due to the widespread modeling language PDDL and it is hard to generate a compact and computationally efficient state variable representation from the propositional model. In this paper we propose a novel method for automaticallygenerating an efficient state-variable representation from the propositional representation. This method groups sets of propositions into state variables based onthe mutex relations introduced in the planning graph. As we shall show experimentally, our method outperforms the current state-of-the-art method both in the smaller number of generated state variables and in the increased performance of planners.

argumentation frameworks (AFs) provide the basis for various reasoning problems in the areas of Knowledge Representation and Artificial Intelligence. Efficient evaluation of AFs has thus been identified as an important research challenge. So far, implemented systems for evaluating AFs have either followed a straight-forward reduction-based approach or been limited to certain tractable classes of AFs. In this work, we present a generic approach for reasoning over AFs, based on the novel concept of complexity-sensitivity. Establishing the theoretical foundations of this approach, we derive several new complexity results for preferred, semistable and stage semantics which complement the current complexity landscape for abstract argumentation, providing further understanding on the sources of intractability of AF reasoning problems. The introduced generic framework exploits decision procedures for problems of lower complexity whenever possible. This allows, in particular, instantiations of the generic framework via harnessing in an iterative way current sophisticated Boolean satisfiability (SAT) solver technology for solving the considered AF reasoning problems. First experimental results show that the SAT-based instantiation of our novel approach outperforms existing systems.

At the risk of being scolded again for "employing universal truths and unarguable facts" in support of my position, I must point out that it is the responsibility of a scientist or engineer to document clearly the known limitations of any method he develops and publishes. In addition to truth in packaging, a clear and unblinking examination of the limitations of one's own work is an invaluable guide to further research. Akman observes, correctly, that QSIM is a purely mathematical formalism for expressing qualitative differential equation models of the world, and not a physical modeling methodology. Our research group has also been concerned with this limitation, so we have developed modelbuilding methods which compile QDEs for QSIM to simulate, either from a component-connection description of a device (Franke and Dvorak 1989, 1990), or from a physical scenario description via qualitative views and processes (Crawford, Farquhar, and Kuipers 1990). These two model-building methods are important elements of the QSIM perspective on qualitative reasoning (Kuipers 1989).