This file was created by the TYPO3 extension publications --- Timezone: CEST Creation date: 2026-05-16 Creation time: 03:37:34 --- Number of references 462 article 2025 3 1 10.1613/jair.1.17279 Journal of Artificial Intelligence Research 82 1407-1444 https://jair.org/index.php/jair/article/view/17279 https://jair.org/index.php/jair/article/view/17279/27150 Conny Olz Alexander Lodemann Benedikt Jutz Mario Schmautz Maximilian Borowiec Susanne Biundo Pascal Bercher article 2025 inproceedings 2025 Proceedings of the 28th European Conference on Artificial Intelligence (ECAI 2025) IOS Press t3://file?uid=532911 Michael Welt Alexander Lodemann Conny Olz Pascal Bercher Birte Glimm inproceedings 2024 10.3233/FAIA241005 Proceedings of the 27th European Conference on Artificial Intelligence (ECAI 2024) IOS Press 4303--4310 t3://file?uid=523057 Conny Olz Alexander Lodemann Pascal Bercher inproceedings Olz2024TOILPHeuristic 2024 Proceedings of the 7th ICAPS Workshop on Hierarchical Planning (HPlan 2024) Conny Olz Alexander Lodemann Pascal Bercher phdthesis 2024 10.18725/OPARU-53481 https://oparu.uni-ulm.de/items/e6887ad7-6494-4deb-96c4-81edf63cffac Conny Olz conference Lin2024PlanVerificationComplexity 2024 https://doi.org/10.1609/aaai.v38i18.30000 Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024) AAAI Press 20203--20211 t3://file?uid=489952 Songtuan Lin Conny Olz Malte Helmert Pascal Bercher inproceedings Olz2023Lookahead 2023 https://doi.org/10.1609/socs.v16i1.27284 Proceedings of the 16th International Symposium on Combinatorial Search (SoCS 2023) AAAI Press 65--73 t3://file?uid=479856 Conny Olz Pascal Bercher inproceedings Olz2023ConjunctiveHTNEffects 2023 https://doi.org/10.1609/icaps.v33i1.27209 Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023) AAAI Press 314--323 t3://file?uid=479855 Conny Olz Pascal Bercher inproceedings SaWG23 The integration of automated planning and ontologies can benefit systems in aspects like additional expressivity and the handling of huge domains. However, the mapping between these techniques might not be straightforward. This work identifies some of the core challenges on the mapping of domain-specific ontologies into planning problems. Here, we identify challenges from both, the lenses of automated planning and domain-specific requirements. This work is intended to raise the discussion on these challenges and motivate future work on this direction. 2023 Proceedings of the PLanning And onTology wOrkshop (PLATO) Milene Santos-Teixeira Michael Welt Birte Glimm inproceedings GrGl23 The diverse research efforts in recent years in the area of stream reasoning (SR) led to a wide range of SR engines. However, the lack of standardization and the diverse choices in SR (e.g., tuple-driven vs.\ time-driven engines, streaming all results vs.\ newly derived ones\mbox, łdots) mean that real comparability among the engines is hardly given. A first step towards achieving comparability and standardization is the RSP-QL model, implemented in the RSP4J framework, which allows for describing and formalizing the semantics of SR engines. To further advance the state of the art in comparative research of stream reasoning, we present the results of a survey to quantify the in-use importance of several key performance indicators (KPIs) and features and compare SR engines along these KPIs with the CityBench and the CSRBench oracle. Our analysis shows that the two RSP4J implementations C-SPARQL2.0 and YASPER outperform the well-known C-SPARQL implementation in terms of performance and configurability. Our comparison against a naive SR extension of the incremental reasoning engine RDFox shows that SR engines still have potential for improvement. To avoid a costly integration of engines into several different benchmarking environments, we finally present a unifying interface, already aligned with the CityBench and CSRBench, for benchmarking SR engines. 2023 Proceedings of the 20th European Semantic Web Conference (ESWC 2023) Springer-Verlag Lecture Notes in Computer Science best paper nominee best paper nominee Nathan Gruber Birte Glimm inproceedings WeGS23 The unsolvability of planning problems is frequently associated with errors on the representation of the domain. Knowledge engineers often struggle to understand the underlying conditions of why a planning problem cannot be solved and which changes might be needed to reach a solution. In this work, we discuss theoretical foundations and algorithms that can be used to calculate minimal parts, called abstractions, of the planning problem that preserve the unsolvability. Additionally, our approach provides minimal sets of facts that repair the planning problem by rendering it solvable when removed. Both together can point to the source of the problem and give a clear focus on which parts of the planning specification are problematic. In particular, our proposed method can be used to debug planning problems that are unsolvable due to ill-modeled effects or over-restricted preconditions. Furthermore, we show that sets of facts inducing minimal unsolvable abstractions and repairs are related by diametrical hitting set properties, which allows us to exploit hitting set tree data structures for a goal-directed computation of these sets. 2023 Proceedings of the Workshop on Knowledge Engineering for Planning and Scheduling (KEPS 2023) Michael Welt Birte Glimm Milene Santos-Teixeira conference 2023 Proceedings of the 11th International Planning Competition: Planner Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC) t3://file?uid=483769 Ying Xian Wu Conny Olz Songtuan Lin Pascal Bercher inproceedings Lin2023VerificationComplexity 2023 Proceedings of the 6th ICAPS Workshop on Hierarchical Planning (HPlan 2023) Songtuan Lin Conny Olz Malte Helmert Pascal Bercher conference Olz23PandaDealer 2023 Proceedings of the 11th International Planning Competition: Planner Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC) t3://file?uid=483768 Conny Olz Daniel ��ö������� Pascal Bercher incollection 2022 1 The 2022 IEEE International Conference on Development and Learning (ICDL 2022) Jakob Karalus Felix Lindner inproceedings IlGl22a Classical instance queries over an ontology only consider explicitly named individuals. Concept referring expressions (CREs) also allow for returning answers in the form of concepts that describe implicitly given individuals in terms of their relation to an explicitly named one. Existing approaches, e.g., based on tree automata, can neither be integrated into state-of-the-art OWL reasoners nor are they directly amenable for an efficient implementation. To address this, we devise a novel algorithm that uses highly optimized OWL reasoners as a black box. In addition to the standard criteria of singularity and certainty for CREs, we devise and consider the criterion of uniqueness of CREs for Horn ALC ontologies. The evaluation of our prototypical implementation shows that computing CREs for the most general concept (top) can be done in less than one minute for ontologies with thousands of individuals and concepts. 2022 Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2022) Morgan Kaufmann Reasoning, Description Logics, Optimisations, Optimizations, Concept Referring Expressions AutomatedReasoning t3://file?uid=455865 Moritz Illich Birte Glimm inproceedings IlGl22b Classical instance queries over an ontology only consider explicitly named individuals. Concept referring expressions (CREs) also allow for returning answers in the form of concepts that describe implicitly given individuals in terms of their relation to an explicitly named one. Existing approaches, e.g., based on tree automata, can neither be integrated into state-of-the-art OWL reasoners nor are they directly amenable for an efficient implementation. To address this, we devise a novel algorithm that uses highly optimized OWL reasoners as a black box. In addition to the standard criteria of singularity and certainty for CREs, we devise and consider the criterion of uniqueness of CREs for Horn ALC ontologies. The evaluation of our prototypical implementation shows that computing CREs for the most general concept can be done in less than one minute for ontologies with thousands of individuals and concepts. 2022 Proceedings of the 35th International Workshop on Description Logics (DL 2022) 3263 CEUR-WS.org CEUR Workshop Proceedings Ofer Arieli and Martin Homola and Jean Christoph Jung and Marie-Laure Mugnier https://ceur-ws.org/Vol-3263/paper-14.pdf Moritz Illich Birte Glimm inproceedings GlKW22 We present two alternative algorithms for computing (all or some) solutions to the concept abduction problem: one algorithm is based on Reiter's hitting set tree algorithm, whereas the other one relies on a SAT encoding. In contrast to previous work, the algorithms do not rely on a refutation-based calculus and, hence, can be used also with efficient reasoners for tractable DLs such as $\mathcalEL$ and its extensions. An adaptation to other forms of (logic-based) abduction, e.g., to ABox abduction, is also possible. 2022 Proceedings of the 35th International Workshop on Description Logics (DL 2022) 3263 CEUR-WS.org CEUR Workshop Proceedings Ofer Arieli and Martin Homola and Jean Christoph Jung and Marie-Laure Mugnier https://ceur-ws.org/Vol-3263/paper-11.pdf Birte Glimm Yevgeny Kazakov Michael Welt article DGMT22 The area of Knowledge Representation and Reasoning (KR) is a central area in Artificial Intelligence that deals with the explicit, declarative representation of knowledge along with inference procedures for deriving further, implicit information from this knowledge. The goal of this Perspectives Seminar was to assess the area of KR, including its history, current state, and future prospects, and from this assessment to provide suggestions and recommendations for advancing the field, increasing participation in the area, and furthering links with related areas. Over the course of 5 days, 25 participants from a cross-section of subareas in KR and areas adjacent to KR met to discuss these topics. The workshop was composed of a number of invited talks and panels for reviewing the history and state of the art of KR, along with several working groups and general open discussions. In common with other Perspectives Workshops, a Manifesto will be produced; as well, recommendations contained in the manifesto will be also forwarded to the steering committee of the Principles of Knowledge Representation and Reasoning conference series for their consideration. 2022 10.4230/DagRep.12.7.62 Dagstuhl Reports 12 62—79 7 https://doi.org/10.4230/DagRep.12.7.62 James P. Delgrande Birte Glimm Thomas Meyer Miroslaw Truszczynski Milene Santos Teixeira Frank Wolter inbook 2022 Defining Artificial Intelligence 451-454 Felix Lindner conference 2022 31st International Conference on Robotics in Alpe-Adria-Danube Region (RAAD) Amar Halilovic Felix Lindner conference Olz2022POPrecsAndEffects Recently, preconditions and effects of compound tasks based on their possible refinements have been introduced together with an efficient inference procedure to compute a subset of them. However, they were restricted to total-order HTN planning domains. In this paper we generalize the definitions and algorithm to the scenario of partially ordered domains. 2022 Proceedings of the 5th ICAPS Workshop on Hierarchical Planning (HPlan 2022) 47--51 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2022/Olz2022POPrecsAndEffects.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2022/Olz2022POPrecsAndEffects.pdf Conny Olz Pascal Bercher inproceedings GlKa22 Propositional SAT solvers have been a popular way of computing justifications for ontological entailment– minimal subsets of axioms of the ontologies that entail a given conclusion. Most SAT encodings proposed for Description Logics (DLs), translate the inferences obtained by a consequence-based procedure to propositional Horn clauses, using which entailments from subsets of axioms can be effectively checked, and use modified SAT solvers to systematically search over these subsets. To avoid repeated discovery of subsets with already checked entailment, the modified SAT solvers add special blocking clauses that prevent generating truth assignments corresponding to these subsets, the number of which can be exponential, even if the number of justifications is small. In this paper, we propose alternative SAT encodings that avoid generation of unnecessary blocking clauses. Unlike the previous methods, the inferences are used not only for checking entailment from subsets of axioms, but also, as a part of the encoding, to ensure that the SAT solver generates truth assignments corresponding only to justifications. 2022 Proceedings of the 35th International Workshop on Description Logics (DL 2022) 3263 CEUR-WS.org CEUR Workshop Proceedings Ofer Arieli and Martin Homola and Jean Christoph Jung and Marie-Laure Mugnier https://ceur-ws.org/Vol-3263/paper-10.pdf Birte Glimm Yevgeny Kazakov conference Lindner22BeyondCausalLinks 2022 https://doi.org/10.1109/RO-MAN53752.2022.9900590 2022 31st IEEE International Conference on Robot & Human Interactive Communication (RO-MAN) IEEE 45--51 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2022/Lindner22PlanExplanationBeyondCL.pdf Felix Lindner Conny Olz incollection 2022 Robophilosophy 2022 Glenda Hannibal Felix Lindner incollection 2022 IEEE International Conference on Automation Science and Engineering (CASE) Benjamin Krarup Felix Lindner Senka Krivic Derek Long conference 2021 1 1 ICML Workshop on Human in the Loop Learning (HILL) Jakob Karalus Felix Lindner article BBKS21 We report on the technology transfer project “Do it yourself, but not alone: Companion-Technology for Home Improvement” that was carried out by Ulm University in cooperation with Robert Bosch GmbH. We developed a prototypical assistance system that assists a Do It Yourself (DIY) handyman in carrying out DIY projects. The assistant, based on various AI and dialog management capabilities, generates a sequence of detailed instructions that users may just follow or adapt according to their individual preferences. It features explanation capabilities as well as pro-active support based on communication with the user as well as with the involved tools. We report on the project’s main achievements, including the findings of various empirical studies conducted in various development stages of the prototype. 2021 10.1007/s13218-021-00721-x Künstliche Intell. 35 367—375 3 https://doi.org/10.1007/s13218-021-00721-x Pascal Bercher Gregor Behnke Matthias Kraus Marvin R. G. Schiller Dietrich Manstetten Michael Dambier Michael Dorna Wolfgang Minker Birte Glimm Susanne Biundo article Bercher2021DIY We report on the technology transfer project “Do it yourself, but not alone: Companion-Technology for Home Improvement” that was carried out by Ulm University in cooperation with Robert Bosch GmbH. We developed a prototypical assistance system that assists a Do It Yourself (DIY) handyman in carrying out DIY projects. The assistant, based on various AI and dialog management capabilities, generates a sequence of detailed instructions that users may just follow or adapt according to their individual preferences. It features explanation capabilities as well as pro-active support based on communication with the user as well as with the involved tools. We report on the project’s main achievements, including the findings of various empirical studies conducted in various development stages of the prototype. 2021 Künstliche Intelligenz – Special Issue on NLP and Semantics https://rdcu.be/cmGwb http://link.springer.com/article/10.1007/s13218-021-00721-x Pascal Bercher Gregor Behnke Matthias Kraus Marvin R. G. Schiller Dietrich Manstetten Michael Dambier Michael Dorna Wolfgang Minker Birte Glimm Susanne Biundo conference 2021 ICDL Workshop on Human aligned Reinforcement Learning for Autonomous Agents and Robots Jakob Karalus Amar Halilovic Felix Lindner inproceedings WeLG21a The exploration of large, unknown RDF data sets is difficult even for users who are familiar with Semantic Web technologies as, e.g., the SPARQL query language. The concept of faceted navigation offers a user-friendly exploration method through filters that are chosen such that no empty result sets occur. However, especially for large data sets, computing such filters is resource intensive and may cause considerable delays in the user interaction. One possibility for improving the performance is the generation of indices for partial solutions. In this paper, we propose and evaluate indices in form of the Bitmap Triple (BT) data structure, generated over the Header-Dictionary-Triples (HDT) RDF compression format. We show that the resulting indices can be utilized to efficiently compute the required exploratory operations for data sets with up to 150 million triples. In the experiments, the BT indices exhibit a stable performance and outperform other deployed approaches in four out of five compared operations. 1 2021 Proceedings of the 18th European Semantic Web Conference (ESWC 2021) Springer-Verlag Lecture Notes in Computer Science AutomatedReasoning, KnowledgeModelling Maximilian Wenzel Thorsten Liebig Birte Glimm inproceedings QuAG21a A lane-level, high-definition (HD) digital map is needed for autonomous cars to provide safety and security to the passengers. However, it continues to prove very difficult to produce error-free maps. To avoid the deactivation of autonomous driving (AD) mode caused by map errors, ensuring map data quality is a crucial task. We propose an ontology-based workflow for HD map data quality assurance, including semantic enrichment, violation detection, and violation handling. Evaluations show that our approach can successfully check the quality of map data and suggests that violation handling is even feasible on-the-fly in the car (on-board), avoiding the autonomous driving mode's deactivation. 2021 Proceedings of the 18th European Semantic Web Conference (ESWC 2021) Springer-Verlag Lecture Notes in Computer Science AutomatedReasoning KnowledgeModelling Haonan Qiu Adel Ayara Birte Glimm inproceedings StGl21a Automated reasoning support is an important aspect of logic-based knowledge representation. The development of specialised procedures and sophisticated optimisation techniques significantly improved the performance even for complex reasoning tasks such as conjunctive query answering. Reasoning and query answering over knowledge bases with a large number of facts and expressive schemata remains, however, challenging. We propose a novel approach where the reasoning over assertional knowledge is split into small, similarly sized work packages to enable a parallelised processing with tableau algorithms, which are dominantly used for reasoning with more expressive Description Logics. To retain completeness in the presence of expressive schemata, we propose a specifically designed cache that allows for controlling and synchronising the interaction between the constructed partial models. We further report on encouraging performance improvements for the implementation of the techniques in the tableau-based reasoning system Konclude. 2021 Proceedings of the 18th European Semantic Web Conference (ESWC 2021) Springer-Verlag Lecture Notes in Computer Science AutomatedReasoning KnowledgeModelling SemanticTechnologies Andreas Steigmiller Birte Glimm inproceedings StGL21b Konclude is a well-performing reasoner for ontologies formulated via the Web Ontology Language. In this paper, we give an overview of new or extended optimizations that lead to additional improvements. We further describe new (functional) extensions and capabilities (such as query answering) that are ready for first practical use-cases. Last but not least, we show some evaluations and comparisons for the new version of Konclude. 2021 Proceedings of the Semantic Reasoning Evaluation Challenge (SemREC 2021) 3123 CEUR-WS.org CEUR Workshop Proceedings Gunjan Singh and Raghava Mutharaju and Pavan Kapanipathi 37—43 https://ceur-ws.org/Vol-3123/paper5.pdf Andreas Steigmiller Birte Glimm Thorsten Liebig inproceedings Olz21RevealingEffects 2021 https://doi.org/10.1609/aaai.v35i13.17414 Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021) AAAI Press 11903--11912 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2021/Olz21CompoundEffects.pdf Conny Olz Susanne Biundo Pascal Bercher inbook 2021 Springer Felix Lindner inproceedings Olz2021ComprehendHTNModels 2021 Proceedings of the 10th Workshop on Knowledge Engineering for Planning and Scheduling (KEPS 2021) /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2021/Olz2021ComprehendHTNModels.pdf Conny Olz Eva Wierzba Pascal Bercher Felix Lindner conference 2021 AAAI 2021 Dennis Louise Martin Mose Bentzen Felix Lindner Michael Fisher inproceedings Kraus2020Comparison 2020 Proceedings of the 12th International Conference on Language Resources and Evaluation (LREC 2020) ELRA 429--435 SFB-T3 https://www.aclweb.org/anthology/2020.lrec-1.54.pdf Matthias Kraus Fabian Fischbach Pascal Jansen Wolfgang Minker inproceedings QiAG20a 2020 Proceedings of the 23rd IEEE International Conference on Intelligent Transportation Systems (ITSC 2020) IEEE AutomatedReasoning,KnowledgeModelling t3://file?uid=431045 Best Paper Nomination Haonan Qiu Adel Ayara Birte Glimm inproceedings QiAG20c 2020 Proceedings of the ISWC 2020 Posters & Demonstrations Track 2721 CEUR-WS.org CEUR Workshop Proceedings Semantic Web AutomatedReasoning, KnowledgeModelling /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2020/QiAG20c.pdf Haonan Qiu Adel Ayara Birte Glimm inproceedings Kraus2020Umap 2020 Proceedings of the 28th ACM Conference on User Modeling, Adaptation and Personalization ACM 107--116 SFB-T3 https://dl.acm.org/doi/pdf/10.1145/3340631.3394840 Matthias Kraus Nicolas Wagner Wolfgang Minker article 2020 1 https://doi.org/10.1016/j.artint.2020.103350 Artificial Intelligence 287 Felix Lindner Robert �Ѳ��ٳٳ�ü������� Bernhard Nebel inproceedings Hoeller20HDDL The research in hierarchical planning has made considerable progress in the last few years. Many recent systems do not rely on hand-tailored advice anymore to find solutions, but are supposed to be domain-independent systems that come with sophisticated solving techniques. In principle, this development would make the comparison between systems easier (because the domains are not tailored to a single system anymore) and - much more important - also the integration into other systems, because the modeling process is less tedious (due to the lack of advice) and there is no (or less) commitment to a certain planning system the model is created for. However, these advantages are destroyed by the lack of a common input language and feature set supported by the different systems. In this paper, we propose an extension to PDDL, the description language used in non-hierarchical planning, to the needs of hierarchical planning systems. 2020 Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020) AAAI Press 9883--9891 SFB-TRR-62,Planning,SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2020/Hoeller2020HDDL.pdf Daniel ��ö������� Gregor Behnke Pascal Bercher Susanne Biundo Humbert Fiorino Damien Pellier Ron Alford inproceedings Hoeller2020HTNPlanRepair To make planning feasible, planning models abstract from many details of the modeled system. When executing plans in the actual system, the model might be inaccurate in a critical point, and plan execution may fail. There are two options to handle this case: the previous solution can be modified to address the failure (plan repair), or the planning process can be re-started from the new situation (re-planning). In HTN planning, discarding the plan and generating a new one from the novel situation is not easily possible, because the HTN solution criteria make it necessary to take already executed actions into account. Therefore all approaches to repair plans in the literature are based on specialized algorithms. In this paper, we discuss the problem in detail and introduce a novel approach that makes it possible to use unchanged, off-the-shelf HTN planning systems to repair broken HTN plans. That way, no specialized solvers are needed. 2020 Proceedings of the 43th German Conference on Artificial Intelligence (KI 2020) Springer /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2020/Hoeller20Repair.pdf Daniel ��ö������� Pascal Bercher Gregor Behnke Susanne Biundo article 2020 Journal of Artificial Intelligence Research (JAIR) 67 AAAI Press 835--880 https://jair.org/index.php/jair/article/view/11282/26578 Daniel ��ö������� Pascal Bercher Gregor Behnke Susanne Biundo inproceedings Behnke2020DIYAssistant 2020 Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020) AAAI Press 343--347 SFB-T3,Planning SFB-T3,Planning,KnowledgeModelling https://aaai.org/ojs/index.php/ICAPS/article/view/6679/6533 - - "Link to the AAAI Paper Version" /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2020/Behnke2020DIYAssistant.pdf Gregor Behnke Pascal Bercher Matthias Kraus Marvin R. G. Schiller Kristof Mickeleit Timo ��ä���� Michael Dorna Michael Dambier Wolfgang Minker Birte Glimm Susanne Biundo inproceedings Behnke2020SuccinctGrounding The research in hierarchical planning has made considerable progress in the last few years. Many recent systems do not rely on hand-tailored advice anymore to find solutions, but are supposed to be domain-independent systems that come with sophisticated solving techniques. In principle, this development would make the comparison between systems easier (because the domains are not tailored to a single system anymore) and - much more important - also the integration into other systems, because the modeling process is less tedious (due to the lack of advice) and there is no (or less) commitment to a certain planning system the model is created for. However, these advantages are destroyed by the lack of a common input language and feature set supported by the different systems. In this paper, we propose an extension to PDDL, the description language used in non-hierarchical planning, to the needs of hierarchical planning systems. 2020 Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020) AAAI Press 9775--9784 SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2020/AAAI-BehnkeG.1770.pdf Gregor Behnke Daniel ��ö������� Alexander Schmid Pascal Bercher Susanne Biundo inproceedings QiAG20b 2020 Proceedings of the 12th International Conference on Knowledge Engineering and Ontology Development (KEOD 2020) SciTePress AutomatedReasoning,KnowledgeModelling t3://file?uid=431048 Haonan Qiu Adel Ayara Birte Glimm inproceedings DBLP:conf/dlog/SteigmillerG20 2020 Proceedings of the 33rd International Workshop on Description Logics (DL 2020) 2663 CEUR-WS.org CEUR Workshop Proceedings Stefan Borgwardt and Thomas Meyer AutomatedReasoning,KnowledgeModelling http://ceur-ws.org/Vol-2663/abstract-21.pdf - - "CEUR WS" t3://file?uid=431054 Andreas Steigmiller conference 1 2020 1 RoboPhilosophy 2020 Felix Lindner inproceedings 2020 https://doi.org/10.1609/aaai.v34i06.6530 Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020) AAAI Press 9785--9793 SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2020/Bercher2020POPvsPOCL.pdf Pascal Bercher Conny Olz conference 2020 1 https://doi.org/10.1145/3319502.3374793 HRI '20: Proceedings of the 2020 ACM/IEEE International Conference on Human-Robot Interaction Suzanne Tolmeijer Astrid Weiss Marc Hanheide Felix Lindner Thomas M. Powers Clare Dixon Myrthe L. Tielman conference 1 2020 JOWO 2020 Proceedings of the FOIS Workshop Ontologies for Autonomous Robotics (ROBONTICS 2020) Felix Lindner conference 2020 1 Against Robot Dystopias: Thinking through the ethical, legal and societal issues of robotics and automation (AGAINST-20), Workshop at ICRA 2020 Benjamin Krarup Senka Krivic Felix Lindner Derek Long inproceedings Kraus2020ICMI Effectively supporting novices during performance of complex tasks, e.g. do-it-yourself (DIY) projects, requires intelligent assistants to be more than mere instructors. In order to be accepted as a competent and trustworthy cooperation partner, they need to be able to actively participate in the project and engage in helpful conversations with users when assistance is necessary. Therefore, a new proactive version of the DIY-assistant \textsc{Robert} is presented in this paper. It extends the previous prototype by including the capability to initiate reflective meta-dialogues using multimodal cues. Two different strategies for reflective dialogue are implemented: A progress-based strategy initiates a reflective dialogue about previous experience with the assistance for encouraging the self-appraisal of the user. An activity-based strategy is applied for providing timely, task-dependent support. Therefore, user activities with a connected drill driver are tracked that trigger dialogues in order to reflect on the current task and to prevent task failure. An experimental study comparing the proactive assistant against the baseline version shows that proactive meta-dialogue is able to build user trust significantly better than a solely reactive system. Besides, the results provide interesting insights for the development of proactive dialogue assistants. 2020 Proceedings of 22nd ACM International Conference on Multimodal Interaction (ICMI 2020) ACM SFB-T3 https://dl.acm.org/doi/pdf/10.1145/3382507.3418818 - - "Link to the Conference Paper" t3://file?uid=431053 Matthias Kraus Marvin R. G. Schiller Gregor Behnke Pascal Bercher Michael Dorna Michael Dambier Birte Glimm Susanne Biundo Wolfgang Minker phdthesis Behnke2019Thesis 2019 12 2 t3://file?uid=418459 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/thesis_behnke_main.pdf Gregor Behnke inbook Kraus2019CloudCompanion Companion systems are cooperative, cognitive systems aiming at assist-ing a user in everyday situations. Therefore, these systems require a high level ofavailability. One option to meet this requirement is to use a web-deployable archi-tecture. In this demo paper, we present a multimodal cloud-based dialogue frame-work for the development of a distributed, web-based companion system. The pro-posed framework is intended to provide an efficient, easily extensible, and scalableapproach for these kinds of systems and will be demonstrated in a do-it-yourselfassistance scenario. 2019 Springer A Multimodal Dialogue Framework for Cloud-Based Companion Systems Lecture Notes in Electrical Engineering Rafael Banchs and Luis Fernando D'Haro and Haizhou Li SFB-T3,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Kraus2019CloudCompanion.pdf Matthias Kraus Marvin R. G. Schiller Gregor Behnke Pascal Bercher Susanne Biundo Birte Glimm Wolfgang Minker inproceedings Bercher2019HierarchicalPlanningSurvey Hierarchical planning has attracted renewed interest in the last couple of years, which led to numerous novel formalisms, problem classes, and theoretical investigations. Yet it is important to differentiate between the various formalisms and problem classes, since they show -- sometimes fundamental -- differences with regard to their expressivity and computational complexity: Some of them can be regarded equivalent to non-hierarchical formalisms while others are clearly more expressive. We survey the most important hierarchical problem classes and explain their differences and similarities. We furthermore give pointers to some of the best-known planning systems capable of solving the respective problem classes. 2019 Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019) IJCAI 6267-6275 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Bercher2019HierarchicalPlanningSurvey.pdf Pascal Bercher Ron Alford Daniel ��ö������� inproceedings 10.1007/978-3-030-30793-6_34 Conjunctive query answering is an important reasoning task for logic-based knowledge representation formalisms, such as Description Logics, to query for instance data that is related in certain ways. Although many knowledge bases use language features of more expressive Description Logics, there are hardly any systems that support full conjunctive query answering for these logics. In fact, existing systems usually impose restrictions on the queries or only compute incomplete results. 2019 978-3-030-30793-6 Proceedings of the 18th International Semantic Web Conference (ISWC 2019) Band 11778 aus Lecture Notes in Computer Science Springer International Publishing

Cham

Chiara Ghidini, Olaf Hartig, Maria Maleshkova, Vojtěch Svátek,Isabel Cruz, Aidan Hogan 593--611 https://link.springer.com/chapter/10.1007%2F978-3-030-30793-6_34 t3://file?uid=429519 Andreas Steigmiller Birte Glimm inproceedings DBLP:conf/dlog/SteigmillerG19 2019 Proceedings of the 32nd International Workshop on Description Logics (DL 2019) Band 2373 aus CEUR Workshop Proceedings CEUR-WS.org http://ceur-ws.org/Vol-2373/paper-25.pdf http://ceur-ws.org/Vol-2373/paper-25.pdf Andreas Steigmiller Birte Glimm article Behnke2019bosch We present the interactive assistant Robert that provides situation-adaptive support in the realisation of do-it-yourself (DIY) home improvement projects. Robert assists its users by providing comprehensive step-by-step instructions for completing the DIY project. Each instruction is illustrated with detailed graphics, written and spoken text, as well as with videos. They explain how the steps of the project have to be prepared and assembled and give precise instructions on how to operate the required electric devices. The step-by-step instructions are generated by a hierarchical planner, which enables Robert to adapt to a multitude of environments easily. Parts of the underlying model are derived from an ontology storing information about the available devices and resources. A dialogue manager capable of natural language interaction is responsible for hands-free interaction. We explain the required background technology and present preliminary results of an empirical evaluation. 2019 10.3233/AIC-180604 AI Communications 32 IOS Press 31-57 1 SFB-T3,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Behnke2019bosch.pdf The final publication is available at IOS Press through http://dx.doi.org/10.3233/AIC-180604 The final publication is available at IOS Press through http://dx.doi.org/10.3233/AIC-180604 Gregor Behnke Marvin R. G. Schiller Matthias Kraus Pascal Bercher Mario Schmautz Michael Dorna Michael Dambier Wolfgang Minker Birte Glimm Susanne Biundo inproceedings SQAG19a 2019 Proceedings of the 2nd IEEE International Conference on Artificial Intelligence and Knowledge Engineering (AIKE 2019) IEEE 140--147 AutomatedReasoning,KnowledgeModelling https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8791704 - - "Link to conference paper" t3://file?uid=431057 Yogita Suryawanshi Haonan Qiu Adel Ayara Birte Glimm inproceedings Behnke2019orderCharos HTN planning provides an expressive formalism to model complex application domains and has been widely used in real-world applications. However, the development of domain-independent planning techniques for such models is still lacking behind. The need to be informed about both - state-transition and hierarchy - makes the realisation of search-based approaches difficult, especially with unrestricted partial ordering of tasks in HTN domains. Recently, a translation of HTN planning problems into propositional logic has shown promising empirical results. Such planners benefit from a unified representation of state and hierarchy, but until now require very large formulae to represent partial order. In this paper, we introduce a novel encoding of HTN Planning as SAT. In contrast to related work, most of the reasoning on ordering relations is not left to the SAT solver, but done beforehand. This results in much smaller formulae and, as shown in our evaluation, in a planner that outperforms previous SAT-based approaches as well as the state-of-the-art in search-based HTN planning. 2019 Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI 2019) AAAI Press 7520--7529 Planning SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Behnke2019orderchaos.pdf Gregor Behnke Daniel ��ö������� Susanne Biundo inproceedings DBLP:conf/rweb/GlimmK19 2019 10.1007/978-3-030-31423-1_1 Reasoning Web. Explainable Artificial Intelligence - 15th International Summer School 11810 Springer Lecture Notes in Computer Science Markus ����ö�ٳ������� and Daria Stepanova 1-64 KnowledgeModeling https://doi.org/10.1007/978-3-030-31423-1\_1 t3://file?uid=420338 Birte Glimm Yevgeny Kazakov inproceedings Olz2019PostOptimizing In this paper we study the computational complexity of post-optimizing partially ordered plans, i.e., we investigate the problem that is concerned with detecting and deleting unnecessary actions. For totally ordered plans it can easily be tested in polynomial time whether a single action can be removed without violating executability. Identifying an executable sub-plan, i.e., asking whether k plan steps can be removed, is known to be NP-hard. We investigate the same questions for partially ordered input plans, as they are created by many search algorithms or used by real-world applications -- in particular time-critical ones that exploit parallelism of non-conflicting actions. More formally, we investigate the computational complexity of removing an action from a partially ordered solution plan in which every linearization is a solution in the classical sense while allowing ordering insertions afterwards to repair arising executability issues. It turns out that this problem is NP-complete -- even if just a single action is removed -- and thereby show that this reasoning task is harder than for totally ordered plans. Moreover, we identify the structural properties responsible for this hardness by providing a fixed-parameter tractability (FPT) result. 2019 10.1609/icaps.v29i1.3493 Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019) AAAI Press 310--319 SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Olz2019StepElimination.pdf Conny Olz Pascal Bercher inproceedings Behnke2019SAToptimal Over the last years, several new approaches to Hierarchical Task Network (HTN) planning have been proposed that increased the overall performance of HTN planners. However, the focus has been on agile planning -- on finding a solution as quickly as possible. Little work has been done on finding \emph{optimal} plans. We show how the currently best-performing approach to HTN planning -- the translation into propositional logic -- can be utilised to find optimal plans. Such SAT-based planners usually bound the HTN problem to a certain depth of decomposition and then translate the problem into a propositional formula. To generate optimal plans, the \emph{length} of the solution has to be bounded instead of the decomposition \emph{depth}. We show the relationship between these bounds and how it can be handled algorithmically. Based on this, we propose an optimal SAT-based HTN planner and show that it performs favourably on a benchmark set. 2019 Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019) SFB-T3,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Behnke2019satoptimal.pdf Gregor Behnke Daniel ��ö������� Susanne Biundo inproceedings Hoeller2019HDDL The research in hierarchical planning has made considerable progress in the last few years. Many recent systems do not rely on hand-tailored advice anymore to find solutions, but are supposed to be domain-independent systems that come with sophisticated solving techniques. In principle, this development would make the comparison between systems easier (because the domains are not tailored to a single system anymore) and – much more important – also the integration into other systems, because the modeling process is less tedious (due to the lack of advice) and there is no (or less) commitment to a certain planning system the model is created for. However, these advantages are destroyed by the lack of a common input language and feature set supported by the different systems. In this paper, we propose an extension to PDDL, the description language used in non-hierarchical planning, to the needs of hierarchical planning systems. We restrict our language to a basic feature set shared by many recent systems, give an extension of PDDL’s EBNF syntax definition, and discuss our extensions, especially with respect to planner-specific input languages from related work. 2019 Proceedings of the Second ICAPS Workshop on Hierarchical Planning 6--14 SFB-T3 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Hoeller2019HDDL.pdf Daniel ��ö������� Gregor Behnke Pascal Bercher Susanne Biundo Humbert Fiorino Damien Pellier Ron Alford inproceedings Behnke2019ICP Over the last years, the amount of research in hierarchical planning has increased, leading to significant improvements in the performance of planners. However, the research is diverging and planners are somewhat hard to compare against each other. This is mostly caused by the fact that there is no standard set of benchmark domains, nor even a common description language for hierarchical planning problems. As a consequence, the available planners support a widely varying set of features and (almost) none of them can solve (or even parse) any problem developed for another planner. With this paper, we propose to create a new track for the IPC in which hierarchical planners will compete. This competition will result in a standardised description language, broader support for core features of that language among planners, a set of benchmark problems, a means to fairly and objectively compare HTN planners, and for new challenges for planners. 2019 Proceedings of the Workshop on the International Planning Competition Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Behnke2019HTNIPC.pdf Gregor Behnke Daniel ��ö������� Pascal Bercher Susanne Biundo Damien Pellier Humbert Fiorino Ron Alford inproceedings Behnke2019GroundingWS Planning systems usually operate on grounded representations of the planning problems during search. Further, planners that use translations into other combinatorial problems also often perform their translations based on a grounded model. Planning models, however, are commonly defined in a lifted formalism. As such, one of the first preprocessing steps a planner performs is to generate a grounded representation. In this paper we present a new approach for grounding HTN planning problems that produces smaller groundings than the previously published method. We expect this decrease in size to lead to more efficient planners. 2019 Proceedings of the Second ICAPS Workshop on Hierarchical Planning 40--48 SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Behnke2019Grounding.pdf Gregor Behnke Daniel ��ö������� Pascal Bercher Susanne Biundo inproceedings Hoeller2019OnGuiding Planning is the task of finding a sequence of actions that achieves the goal(s) of an agent. It is solved based on a model describing the environment and how to change it. There are several approaches to solve planning tasks, two of the most popular are classical planning and hierarchical planning. Solvers are often based on heuristic search, but especially regarding domain-independent heuristics, techniques in classical planning are more sophisticated. However, due to the different problem classes, it is difficult to use them in hierarchical planning. In this paper we describe how to use arbitrary classical heuristics in hierarchical planning and show that the resulting system outperforms the state of the art in hierarchical planning. 2019 Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019) IJCAI 6171--6175 SFB-T3 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2019/Hoeller2019ProgressionHeuristics.pdf Daniel ��ö������� Pascal Bercher Gregor Behnke Susanne Biundo proceedings Bercher2019HTNWorkshop 2019 https://icaps19.icaps-conference.org/workshops/Hierarchical-Planning/ https://icaps19.icaps-conference.org/workshops/Hierarchical-Planning/HPLAN2019Proceedings.pdf Pascal Bercher Gregor Behnke Vikas Shivashankar Ron Alford techreport Bercher2018AssemblyAssistant We show how techniques from various research areas --most notably hierarchical planning, dialog management, and interactionmanagement -- can be employed to realize individualized andsituation-adaptive user assistance. We introduce a modular systemarchitecture that is composed of domain-independent componentsimplementing techniques from the respective areas. Systems based on thisarchitecture -- so-called Companion-Systems -- can provideintelligent assistance in a broad variety of tasks. They provide a user-and situation-adapted sequence of instructions that show how achieve therespective task. Additional explanations are, like the instructionsthemselves, automatically derived based on a declarative model of thecurrent task. These systems can react to unforeseen execution failuresrepairing their underlying plans if required. We introduce a prototypesystem that assists with setting up a home theater and use it as arunning example as well as for an empirical evaluation with testsubjects that shows the usefulness of our approach. We summarize thework of more than half a decade of research and development done byvarious research groups from different disciplines. Here, for the firsttime, we explain the full integration of all components thereby showing``the complete picture" of our approach to provide individualized andsituation-adaptive user assistance. technical report 2018 10.18725/OPARU-11023 Ulm University planning SFB-TRR-62 https://oparu.uni-ulm.de/xmlui/bitstream/handle/123456789/11080/AssemblyAssistant.pdf Pascal Bercher Felix Richter Frank Honold Florian Nielsen Felix ������ü������� Thomas Geier Thilo ��ö���Ա��� Stephan Reuter Daniel ��ö������� Gregor Behnke Michael Weber Klaus Dietmayer Wolfgang Minker Susanne Biundo inproceedings Hoeller18Progression HTN planning combines actions that cause state transition with grammar-like decomposition of compound tasks that additionally restricts the structure of solutions. There are mainly two strategies to solve such planning problems: decomposition-based search in a plan space and progression-based search in a state space. Existing progression-based systems do either not rely on heuristics (e.g. SHOP2) or calculate their heuristics based on extended or modified models (e.g. GoDeL). Current heuristic planners for standard HTN models (e.g. PANDA) use decomposition-based search. Such systems represent search nodes more compactly due to maintaining a partial order between tasks, but they have no current state at hand during search. This makes the design of heuristics difficult. In this paper we present a progression-based heuristic HTN planning system: We (1) provide an improved progression algorithm, prove its correctness, and empirically show its efficiency gain; and (2) present an approach that allows to use arbitrary classical (non-hierarchical) heuristics in HTN planning. Our empirical evaluation shows that the resulting system outperforms the state-of-the-art in HTN planning. 2018 Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS 2018) AAAI Press 114--122 SFB-TRR-62,Planning,SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Hoeller18Progression.pdf This paper has won the ICAPS Best Student Paper Award Daniel ��ö������� Pascal Bercher Gregor Behnke Susanne Biundo inproceedings Kraus2018CompanionCloudDemo Abstract Companion systems are cooperative, cognitive systems aiming at assisting a user in everyday situations. Therefore, these systems require a high level of availability. One option to meet this requirement is to use a web-deployable architecture. In this demo paper, we present a multimodal cloud-based dialogue framework for the development of a distributed, web-based companion system. The proposed framework is intended to provide an efficient, easily extensible, and scalable approach for this kind of systems and will be demonstrated in a do-it-yourself assistance scenario. 2018 Proc. of the 10th International Workshop on Spoken Dialog Systems Technology (IWSDS 2018) SFB-TRR-62,SFB-T3,Planning,KnowledgeModeling /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Kraus2018CompanionCloudDemo.pdf Matthias Kraus Gregor Behnke Pascal Bercher Marvin R. G. Schiller Susanne Biundo Birte Glimm Wolfgang Minker inproceedings PSH2018 2018 Proceedings of DL 2018, CEUR Workshop Proceedings Vol. 2211 SFB-TRR-62,SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/PerlethSchillerGlimmDL2018.pdf Tanja Perleth Marvin R. G. Schiller Birte Glimm inproceedings BrGl18a Abstraction Refinement is a recently introduced technique which allows for reducing materialization of an ontology with a large ABox to materialization of a smaller (compressed) 'abstraction' of this ontology. In this paper, we show how Abstraction Refinement can be adopted for incremental ABox materialization by combining it with the well-known DRed algorithm for materialization maintenance. Such a combination is non-trivial and to preserve soundness and completeness, already Horn ALCHI requires more complex abstractions. Nevertheless, we show that significant benefits can be obtained for synthetic and real-world ontologies. 2018 Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018) AAAI Press AutomatedReasoning www.ijcai.org /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/BrGl18a.pdf Markus Brenner Birte Glimm conference KazSko:IJCAR18:Justifications If a conclusion follows from a set of axioms, then its justification is a minimal subset of axioms for which the entailment holds. An entailment can have several justifications. Such justifications are commonly used for the purpose of debugging of incorrect entailments in Description Logic ontologies. Recently a number of SAT-based methods have been proposed that can enumerate all justifications for entailments in light-weight ontologies languages, such as EL. These methods work by encoding EL inferences in propositional Horn logic, and finding minimal models that correspond to justifications using SAT solvers. In this paper, we propose a new procedure for enumeration of justifications that uses resolution with answer literals instead of SAT solvers. In comparison to SAT-based methods, our procedure can enumerate justifications in any user-defined order that extends the set inclusion relation. The procedure is easy to implement and, like resolution, can be parametrized with ordering and selection strategies. We have implemented this procedure in PULi - a new Java-based Proof Utility Library, and performed an empirical comparison of (several strategies of) our procedure and other SAT-based tools on popular EL ontologies. The experiments show that our procedure provides a comparable, if not better performance than those highly optimized tools. For example, using one of the strategies, we were able for the first time to compute all justifications for all entailed concept subsumptions in one of the largest commonly used medical ontology Snomed CT. 2018 978-3-319-94204-9 10.1007/978-3-319-94205-6 IJCAR 10900 Springer Lecture Notes in Computer Science Didier Galmiche and Stephan Schulz and Roberto Sebastiani 609--626 KnowledgeModeling LiveOntologies https://doi.org/10.1007/978-3-319-94205-6_40 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/KazSko18Justifications_IJCAR.pdf Yevgeny Kazakov Peter Skocovsky inproceedings schillerEtAlMCI2018 We report on the development of a companion system incorporating hierarchical planning, ontology-based knowledge modeling and multimodal cloud-based dialog. As an application scenario, we consider the domain of do-it-yourself (DIY) home improvement involving the use of power tools. To test and – if necessary – adjust the developed techniques, user studies are conducted throughout the development phase. We present fundamental considerations and open questions encountered when testing the implemented prototype with potential users and report first observations from a current study. 2018 Proceedings of MCI Workshop "Digital Companion" 925--930 SFB-TRR-62,SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/MCI-WS19-schillerEtAl2018.pdf Marvin R. G. Schiller Gregor Behnke Pascal Bercher Matthias Kraus Michael Dorna Felix Richter Susanne Biundo Birte Glimm Wolfgang Minker phdthesis Richter2018PhDThesis The recent years have seen significant progress in the fields of computer science and the engineering sciences, leading to a plethora of systems and services aimed at simplifying the organization of everyday life. The great potential of these utilities is however hindered by their complexity as well as the complexity of their interplay. Automated assistance systems can help users overcome this challenge. At the core of these systems lies planning functionality, needed for automatically generating courses of action, or policies, that represent, e.g., step-by-step instructions. Often, planning requires accounting for uncertainty inherent in a given application domain, making the process of generating such instructions computationally difficult. Fortunately, many assistance tasks exhibit hierarchical structure that allows understanding planning tasks as a hierarchy of subtasks, each of which can be solved using a limited number of solution recipes. The Hierarchical Task Network planning approach can already exploit such structures in deterministic planning domains by representing subtasks and recipes using abstract actions and methods, respectively, and generating plans by iteratively refining an initial abstract plan. The main goal of this thesis is to create a similar planning approach suited for planning domains that exhibit uncertainty, modeled as Partially Observable Markov Decision Processes. Based on a newly introduced suitable policy representation formalism called logical finite state controllers, the concepts of abstract actions and methods are reintroduced to create the Partially Observable Hierarchical Task Network planning approach. Next, Monte-Carlo tree search in the space of partially abstract controllers is identified as a suitable means for planning. The approach is then empirically evaluated on four domains by comparing it to search in the space of histories, a state-of-the-art non-hierarchical planning approach also based on Monte-Carlo tree search. This reveals that, with comparable computational effort, the proposed approach leads to policies of superior quality, and that it scales well with problem size. Two further techniques are then proposed enhance the presented approach: one that further reduces the required controller construction effort during search by refining controllers only selectively where required, and one that combines hierarchical and non-hierarchical search in order to combine the advantages of both. Dissertation 2018 10.18725/OPARU-5243 Ulm University

Germany

SFB-TRR-62, Planning https://oparu.uni-ulm.de/xmlui/bitstream/handle/123456789/5300/dissertation_richter.pdf Felix Richter inproceedings Hoeller18Repair To make planning feasible, planning models abstract from many details of the modeled system. When executing plans in the actual system, the model might be inaccurate in a critical point, and plan execution may fail. There are two options to handle this case: the previous solution can be modified to address the failure (Plan Repair), or the planning process can be re-started from the new situation (Re-Planning). In HTN planning, discarding the plan and generating a new one from the novel situation is not easily possible, because the HTN solution criteria make it necessary to take already executed actions into account. Therefore all approaches to repair plans in the literature are based on specialized algorithms. In this paper, we discuss the problem in detail and introduce a novel approach that makes it possible to use unchanged, off-the-shelf HTN planning systems to repair broken HTN plans. That way, no specialized solvers are needed. 2018 Proceedings of the First ICAPS Workshop on Hierarchical Planning 26--30 SFB-TRR-62,SFB-T3,Planning http://icaps18.icaps-conference.org/hierarchicalplanning/ www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Hoeller18Repair.pdf Daniel ��ö������� Pascal Bercher Gregor Behnke Susanne Biundo phdthesis Bercher2018Dissertation This work lays fundamental groundwork for the development of so-called Companion Systems - cognitive technical systems that are capable to reason about themselves, their users and environment, and to plan a course of action to achieve their users' goals. They are intelligent devices that assist their users in operating them: instead of the user having to learn how to operate the respective system, the system is intelligent and flexible enough to provide its functionality in a truly user-friendly way. To fully meet a user's demands, Companion Systems rely on a multi-facet of capabilities that stem from different disciplines, such as Artificial Intelligence (AI) planning, knowledge representation and reasoning, dialog management, and user interaction management, to name just a few. This thesis focuses on the relevant aspects of AI planning technology that are of importance for such systems. AI planning is the central technology for many \emph{Companion Systems} as it allows to compute a course of action that, if followed by its user, achieves his or her goals and therefore serves as a basis of providing advanced user assistance. This thesis is concerned with \emph{hybrid planning} -- a hierarchical planning formalism that is especially suited for the basis of providing assistance to human users. Based on this formalism we will investigate the full endeavor of developing Companion Systems -- from theory to practice. The thesis presents a novel formalization for hierarchical planning problems, which has become a standard in the field. We present a categorization of different problem classes into which hybrid planning as well as other well-known problem classes fall. This formalization allowed to prove a series of novel complexity results that are of interest both for theoretical and practical considerations. For many of the identified classes we introduce novel heuristics that are used to speed up the solution generation process. Some of them are the very first for the respective problem class, and some are the first admissible ones, thereby allowing to find optimal solutions -- which is especially important when plans are generated for human users. We apply hybrid planning in a prototypical Companion System. It assists a user in the task of setting up a complex home entertainment system. Based on a declarative (planning) model of the available hardware and its functionality, the assistant computes a sequence of actions that the user simply needs to follow to complete the setup task. Several so-called user-centered planning capabilities are applied in this system, such as a technique for generating user-friendly linearizations of non-linear plans or the capability to answer questions about the necessity of actions -- an essential property to ensure transparency of the system's behavior. In conclusion: Most modern technical devices are still lacking true intelligence -- since no research such as AI planning is sufficiently applied, so there is still huge potential in making such devices really smart by implementing them as cognitive systems that effectively assist their human users. Applying the research presented in this thesis is one step towards achieving this goal. Dissertation 2018 10.18725/OPARU-5242 Ulm University SFB-TRR-62, Planning https://oparu.uni-ulm.de/xmlui/handle/123456789/5299 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/DissertationBercher.pdf Pascal Bercher inproceedings Bercher2018DissertationAbstract Die Dissertation legt Grundlagen, die es erlauben, Planungstechnologie der KünstlichenIntelligenz als Basis für flexible Assistenzsysteme einzusetzen. Die Aufgabe der automatischenHandlungsplanung ist es hierbei, selbständig einen Plan zu entwickeln, der dem Nutzer Schritt fürSchritt präsentiert wird und ihn oder sie bei der Bearbeitung einer entsprechenden Aufgabe anleitet.Durch die starke Miteinbeziehung eines menschlichen Nutzers ergeben sich viele neue Herausforde-rungen: Pläne müssen schnell gefunden werden; und sie sollen nicht nur korrekt sein, sondern auchkostengünstig und dem Nutzer plausibel erscheinen; und sie sollen erklärbar sein, um Transparenzzu schaffen. Aus diesem Grund wurde das hybride Planen gewählt, ein hierarchischer, nicht-linearerPlanungsansatz. Es wurden neue Komplexitätsergebnisse für das Planexistenz- und das Planverifika-tionsproblem erzielt; die ersten zulässigen Heuristiken erforscht, welche das Finden optimaler Plänegarantieren; und es wurde ein prototypisches Assistenzsystem realisiert, das seinen Nutzer bei demAufbau einer komplexen Heimkinoanlage unterstützt. 2018 Proc. of Ausgezeichnete Informatikdissertationen Gesellschaft für Informatik /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Bercher2018DissertationAbstract.pdf Pascal Bercher inproceedings Behnke2018HomeImprovementSystem Novice users require assistance when performing handicraft tasks. Adequate instruction ensures task completion and conveys knowledge and abilities required to perform the task. We present an assistant teaching novice users how to operate electronic tools, such as drills, saws, and sanders, in the context of Do-It-Yourself (DIY) home improvement projects. First, the actions that need to be performed for the project are determined by a planner. Second, a dialogue manager capable of natural language interaction presents these actions as instructions to the user. Third, questions on these actions and involved objects are answered by generating appropriate ontology-based explanations. 2018 10.24963/ijcai.2018/844 Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018) IJCAI 5805--5807 SFB-T3 www.ijcai.org /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Behnke2018DIY.pdf Gregor Behnke Marvin R. G. Schiller Matthias Kraus Pascal Bercher Mario Schmautz Michael Dorna Wolfgang Minker Birte Glimm Susanne Biundo inproceedings Hoeller2018PlanRecPAIR Plan- and Goal Recognition (PGR) is the task of inferring the goals and plans of an agent based on its actions. A few years ago, an approach has been introduced that successfully exploits the performance of planning systems to solve it. That way, no specialized solvers are needed and PGR benefits from present and future research in planning. The approach uses classical planning systems and needs to plan (at least) once for every possible goal. However, models in PGR are often structured in a hierarchical way, similar to Hierarchical Task Networks (HTNs). These models are strictly more expressive than those in classical planning and can describe partially ordered sets of tasks or multiple goals with interleaving plans. We present the approach PGR as HTN Planning that enables the recognition of complex agent behavior by using unmodified, off-the-shelf HTN planners. Planning is thereby needed only once, regardless of how many possible goals there are. Our evaluation shows that current planning systems are able to handle large models with thousands of possible goals and that the approach results in high recognition rates. 2018 Proceedings of the AAAI 2018 Workshop on Plan, Activity, and Intent Recognition (PAIR 2018) 607--613 SFB-TRR-62,Planning http://www.planrec.org/PAIR/PAIR18/Resources.html http://www.planrec.org/PAIR/PAIR18/Papers/HollerPair18.pdf Daniel ��ö������� Pascal Bercher Gregor Behnke Susanne Biundo inproceedings Hoeller2018PlanRec Plan- and Goal Recognition (PGR) is the task of inferring the goals and plans of an agent based on its actions. Traditional approaches in PGR are based on a plan library including pairs of plans and corresponding goals. In recent years, the field successfully exploited the performance of planning systems for PGR. The main benefits are the presence of efficient solvers and well-established, compact formalisms for behavior representation. However, the expressivity of the STRIPS planning models used so far is limited, and models in PGR are often structured in a hierarchical way. We present the approach Plan and Goal Recognition as HTN Planning that combines the expressive but still compact grammar-like HTN representation with the advantage of using unmodified, off-the-shelf planning systems for PGR. Our evaluation shows that - using our approach - current planning systems are able to handle large models with thousands of possible goals, that the approach results in high recognition rates, and that it works even when the environment is partially observable, i.e., if the observer might miss observations. 2018 Proceedings of the 30th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2018) IEEE Computer Society 466--473 Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Hoeller2018PlanRec.pdf Daniel ��ö������� Gregor Behnke Pascal Bercher Susanne Biundo proceedings HierarchicalPlanningWorkshop2018 The motivation for using hierarchical planning formalisms is manifold. It ranges from an explicit and predefined guidance of the plan generation process and the ability to represent complex problem solving and behavior patterns to the option of having different abstraction layers when communicating with a human user or when planning cooperatively. This led to a large set of different hierarchical formalisms and systems. With this workshop, we want to bring together scientists working on any aspect related to hierarchical planning to exchange ideas and foster cooperation. Hierarchies induce fundamental differences from classical, non-hierarchical planning, creating distinct computational properties and requiring separate algorithms for plan generation, plan verification, plan repair, and practical applications. Many of these aspects of hierarchical planning are still unexplored. This wide range of important yet insufficiently solved problems is reflected in the topics presented in this proceedings. Though the main focus lies on the development of planning systems, these tackle quite different classes of hierarchical problems and use several solving techniques. It includes work on real-time planning, planning with task insertion, distributed planning, and extensions of formalisms to enable real-world application. Beside solvers, the presented work includes techniques for the plan repair problem and discussions of the application in real-world problems. 2018 Pascal Bercher and Daniel ��ö������� and Susanne Biundo and Ron Alford Planning http://icaps18.icaps-conference.org/hierarchicalplanning/ http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/HierarchicalPlanningProceedings.pdf Pascal Bercher Daniel ��ö������� Susanne Biundo Ron Alford inproceedings Behnke2018totSAT In this paper, we propose a novel SAT-based planning approach for hierarchical planning by introducing the SAT-based planner totSAT for the class of totally-ordered HTN planning problems. We use the same general approach as SAT planning for classical planning does: bound the problem, translate the problem into a formula, and if the formula is not satisfiable, increase the bound. In HTN planning, a suitable bound is the maximum depth of decomposition. We show how totally-ordered HTN planning problems can be translated into a SAT formula, given this bound. Furthermore, we have conducted an extensive empirical evaluation to compare our new planner against state-of-the-art HTN planners. It shows that our technique outperforms any of these systems. 2018 Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018) AAAI Press 6110--6118 AAAI 2018 New Orleans SFB-TRR-62,Planning SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Behnke2018totSAT.pdf Gregor Behnke Daniel ��ö������� Susanne Biundo inproceedings Leichtmann2018HumanPlanning User-friendly Companion Systems require Artificial Intelligence planning to take into account human planning behavior. We conducted a qualitative exploratory study of human planning in a knowledge rich, real-world scenario. Participants were tasked with setting up a home theater. The effect of strategy knowledge on problem solving was investigated by comparing the performance of two groups: one group (n = 23) with strategy instructions for problem-solving and a control group without such instructions (n = 16). We inductively identify behavioral patterns for human strategy use through Markov matrices. Based on the results, we derive implications for the design of planning-based assistance systems. 2018 Proceedings der dritten transdisziplinären Konferenz "Technische Unterstützungssysteme, die die Menschen wirklich wollen" (engl: Proceedings of the 3rd "Transdisciplinary Conference on Support Technologies"), TCST 2018 89--98 SFB-TRR-62,Planning,SFB-T3 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Leichtmann2018HumanPlanningBehavior.pdf This paper won the Best Paper Award. Benedikt Leichtmann Pascal Bercher Daniel ��ö������� Gregor Behnke Susanne Biundo Verena Nitsch Martin Baumann inproceedings Behnke2018treeSATICTAI Planning via SAT has proven to be an efficient and versatile planning technique. Its declarative nature allows for an easy integration of additional constraints and can harness the progress made in the SAT community without the need to adapt the planner. However, there has been only little attention to SAT planning for hierarchical domains. To ease encoding, existing approaches for HTN planning require additional assumptions, like non-recursiveness or totally-ordered methods. Both limit the expressiveness of HTN planning severely. We propose the first propositional encodings which are able to solve general, i.e., partially-ordered, HTN planning problems, based on a previous encoding for totally-ordered problems. The empirical evaluation of our encoding shows that it outperforms existing HTN planners significantly. 2018 Proceedings of the 30th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2018) IEEE Computer Society 73--80 SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Behnke2018treeSAT.pdf Gregor Behnke Daniel ��ö������� Susanne Biundo inproceedings Behnke2018TreeSAT Planning via SAT has proven to be an efficient and versatile planning technique. Its declarative nature allows for an easy integration of additional constraints and can harness the progress made in the SAT community without the need to adapt the planner. However, there has been only little attention to SAT planning for hierarchical domains. To ease encoding, existing approaches for HTN planning require additional assumptions, like non-recursiveness or totally-ordered methods. Both limit the expressiveness of HTN planning severely. We propose the first propositional encodings which are able to solve general, i.e., partially-ordered, HTN planning problems, based on a previous encoding for totally-ordered problems. The empirical evaluation of our encoding shows that it outperforms existing HTN planners significantly. 2018 Proceedings of the First ICAPS Workshop on Hierarchical Planning 40--47 SFB-TRR-62,SFB-T3 http://icaps18.icaps-conference.org/hierarchicalplanning/ /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Behnke2018partSAT.pdf Gregor Behnke Daniel ��ö������� Susanne Biundo inproceedings Behnke2018MoreParallelLTL Linear temporal logic (LTL) provides expressive means to specify temporally extended goals as well as preferences. Recent research has focussed on compilation techniques, i.e., methods to alter the domain ensuring that every solution adheres to the temporally extended goals. This requires either new actions or an construction that is exponential in the size of the formula. A translation into boolean satisfiability (SAT) on the other hand requires neither. So far only one such encoding exists, which is based on the parallel ∃-step encoding for classical planning. We show a connection between it and recently developed compilation techniques for LTL, which may be exploited in the future. The major drawback of the encoding is that it is limited to LTL without the X operator. We show how to integrate X and describe two new encodings, which allow for more parallelism than the original encoding. An empirical evaluation shows that the new encodings outperform the current state-of-the-art encoding. 2018 Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS) 1--10 SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Behnke2018satltl.pdf Gregor Behnke Susanne Biundo article Behnke2018SATltljournal 2018 10.4114/intartif.vol21iss62pp75-90 Inteligencia Artificial 21 75--90 62 SFB-T3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2018/Behnke2018SATltljournal.pdf Gregor Behnke Susanne Biundo inproceedings Schiller17CouplingKnowledge Companion systems are technical systems that adjust their functionality to the needs and the situation of an individual user. Consequently, companion systems are strongly knowledge-based. We propose a modelling paradigm for integrating procedural and conceptual knowledge which is targeted at companion systems that require a combination of planning and reasoning capabilities. The presented methodology couples the hierarchical task network (HTN) planning formalism with an ontology-based knowledge representation, thereby minimising redundancies in modelling and enabling the use of state-of-the-art reasoning and planning tools on the shared knowledge model. The approach is applied within a prototype of a companion system that assists novice users in the do-it-yourself (DIY) domain with the planning and execution of home improvement projects involving the use of power tools. 2017 10.1109/COMPANION.2017.8287072 Proceedings of the 2nd International Conference on Companion Technology (ICCT 2017) IEEE SFB-TRR-62,SFB-T3,Planning,KnowledgeModeling http://ieeexplore.ieee.org/document/8287072/ /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/SBSBKDMGB-ICCT2017.pdf Marvin R. G. Schiller Gregor Behnke Mario Schmautz Pascal Bercher Matthias Kraus Michael Dorna Wolfgang Minker Birte Glimm Susanne Biundo inbook Richter2017UserCenteredPlanningUnderUncertainty Companion-Systems need to reason about dynamic properties of their users, e.g., their emotional state, and the current state of the environment. The values of these properties are often not directly accessible; hence information on them must be pieced together from indirect, noisy or partial observations. To ensure probability-based treatment of partial observability on the planning level, planning problems can be modeled as Partially Observable Markov Decision Processes (POMDPs). While POMDPs can model relevant planning problems, it is algorithmically difficult to solve them. A starting point for mitigating this is that many domains exhibit hierarchical structures where plans consist of a number of higher-level activities, each of which can be implemented in different ways that are known a priori. We show how to make use of such structures in POMDPs using the Partially Observable HTN (POHTN) planning approach by developing a Partially Observable HTN (POHTN) action hierarchy for an example domain derived from an existing deterministic demonstration domain. We then apply Monte-Carlo Tree Search to POHTNs for generating plans and evaluate both the developed domain and the POHTN approach empirically. 2017 10.1007/978-3-319-43665-4_6 Companion Technology -- A Paradigm Shift in Human-Technology Interaction Springer 6 Cognitive Technologies Susanne Biundo and Andreas Wendemuth 101--121 SFB-TRR-62, Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Richter2017UserCenteredPlanningUnderUncertainty.pdf Felix Richter Susanne Biundo inbook Bercher2017CompBookHomeTheater In many situations of daily life, such as in educational, work-related, or social contexts, one can observe an increasing demand for intelligent assistance systems. In this chapter, we show how such assistance can be provided in a wide range of application scenarios—based on the integration of user-centered planning with advanced dialog and interaction management capabilities. Our approach is demonstrated by a system that assists a user in the task of setting up a complex home theater. The theater consists of several hi-fi devices that need to be connected with each other using the available cables and adapters. In particular for technically inexperienced users, the task is quite challenging due to the high number of different ports of the devices and because the used cables might not be known to the user. Support is provided by presenting a detailed sequence of instructions that solves the task. 2017 10.1007/978-3-319-43665-4_24 Companion Technology -- A Paradigm Shift in Human-Technology Interaction Springer 24 Cognitive Technologies Susanne Biundo and Andreas Wendemuth 485--491 SFB-TRR-62 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Bercher2017CompBookHomeTheater.pdf Pascal Bercher Felix Richter Thilo ��ö���Ա��� Thomas Geier Daniel ��ö������� Gregor Behnke Florian Nielsen Frank Honold Felix ������ü������� Stephan Reuter Wolfgang Minker Michael Weber Klaus Dietmayer Susanne Biundo inproceedings Bercher17AdmissibleHTNHeuristic Hierarchical task network (HTN) planning is well-known for being an efficient planning approach. This is mainly due to the success of the HTN planning system SHOP2. However, its performance depends on hand-designed search control knowledge. At the time being, there are only very few domain-independent heuristics, which are designed for differing hierarchical planning formalisms. Here, we propose an admissible heuristic for standard HTN planning, which allows to find optimal solutions heuristically. It bases upon the so-called task decomposition graph (TDG), a data structure reflecting reachable parts of the task hierarchy. We show (both in theory and empirically) that rebuilding it during planning can improve heuristic accuracy thereby decreasing the explored search space. The evaluation further studies the heuristic both in terms of plan quality and coverage. 2017 Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017) IJCAI 480--488 SFB-TRR-62,Planning,SFB-T3 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Bercher17AdmissibleHTNHeuristicTalk.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Bercher17AdmissibleHTNHeuristicPoster.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Bercher17AdmissibleHTNHeuristic.pdf Pascal Bercher Gregor Behnke Daniel ��ö������� Susanne Biundo inbook Biundo2017CompBookIntro Companion-technology enables a new generation of intelligent systems. These Companion-systems smartly adapt their functionality to a user’s individual requirements. They comply with his or her abilities, preferences, and current needs and adjust their behavior as soon as critical changes of the environment or changes of the user’s emotional state or disposition are observed. Companion-systems are distinguished by characteristics such as competence, individuality, adaptability, availability, cooperativeness, and trustworthiness. These characteristics are realized by integrating the technical functionality of systems with a combination of cognitive processes. Companion-systems are able to perceive the user and the environment; they reason about the current situation, exploit background knowledge, and provide and pursue appropriate plans of action; and they enter into a dialog with the user where they select the most suitable modes of interaction in terms of media, modalities and dialog strategies. This chapter introduces the essence of Companion-technology and sheds light on the huge range of its prospective applications. 2017 10.1007/978-3-319-43665-4_1 Companion Technology -- A Paradigm Shift in Human-Technology Interaction Springer 1 Cognitive Technologies Susanne Biundo and Andreas Wendemuth 1--15 SFB-TRR-62 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Biundo2017CompBookIntro.pdf Susanne Biundo Andreas Wendemuth book Biundo2017ParadigmShift Future technical systems will be companion systems, competent assistants that provide their functionality in a completely individualized way, adapting to a user’s capabilities, preferences, requirements, and current needs, and taking into account both the emotional state and the situation of the individual user. This book presents the enabling technology for such systems. It introduces a variety of methods and techniques to implement an individualized, adaptive, flexible, and robust behavior for technical systems by means of cognitive processes, including perception, cognition, interaction, planning, and reasoning. The technological developments are complemented by empirical studies from psychological and neurobiological perspectives. 2017 10.1007/978-3-319-43665-4 Springer Susanne Biundo and Andreas Wendemuth Companion Systems, Cognitive Systems, Artificial Intelligence (AI), Automated Planning, Knowledge Representation (KR), Human-Computer Interaction (HCI), Multimodal Interaction, Dialogue Management, Emotion Recognition, Information Fusion SFB-TRR-62,Planning https://link.springer.com/book/10.1007/978-3-319-43665-4 https://link.springer.com/book/10.1007/978-3-319-43665-4 Susanne Biundo Andreas Wendemuth inbook Hoernle2017CompBookReferenceArchitecture Companion-Technology for cognitive technical systems consists of a multitude of components that implement different properties. A primary point is the architecture which is responsible for the interoperability of all components. It defines the capabilities of the systems crucially. For research concerning the requirements and effects of the architecture, several demonstration scenarios were developed. Each of these demonstration scenarios focuses on some aspects of a Companion-System. For the implementation a middleware concept was used, having the capability to realize the major part of the Companion-Systems. Currently the system architecture takes up only a minor property in projects which are working on related research topics. For the description of an architecture representing the major part of possible Companion-Systems, the demonstration scenarios are studied with regard to their system structure and the constituting components. A monolithic architecture enables a simple system design and fast direct connections between the components, such as: sensors with their processing and fusion components, knowledge bases, planning components, dialog systems and interaction components. Herein, only a limited number of possible Companion-Systems can be represented. In a principled approach, a dynamic architecture, capable of including new components during run time, is able to represent almost all Companion-Systems. Furthermore, an approach for enhancing the architecture is introduced. 2017 10.1007/978-3-319-43665-4_22 Companion Technology -- A Paradigm Shift in Human-Technology Interaction Springer 22 Cognitive Technologies Susanne Biundo and Andreas Wendemuth 449-469 SFB-TRR-62 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Hoernle2017CompBookReferenceArchitecture.pdf Thilo ��ö���Ա��� Michael Tornow Frank Honold Reinhard Schwegler Ralph Heinemann Susanne Biundo Andreas Wendemuth inbook Nothdurft17UserInvolvement Abstract Mixed-initiative assistants are systems that support humans in their decision-making and problem-solving capabilities in a collaborative manner. Such systems have to integrate various artificial intelligence capabilities, such as knowledge representation, problem solving and planning, learning, discourse and dialog, and human-computer interaction. These systems aim at solving a given problem autonomously for the user, yet involve the user into the planning process for a collaborative decision-making, to respect e. g. user preferences. However, how the user is involved into the planning can be framed in various ways, using different involvement strategies, varying e. g. in their degree of user freedom. Hence, here we present results of a study examining the effects of different user involvement strategies on the user experience in a mixed-initiative system. 2017 10.1007/978-981-10-2585-3_10 Dialogues with Social Robots: Enablements, Analyses, and Evaluation Springer User Involvement in Collaborative Decision-Making Dialog Systems Kristiina Jokinen and Graham Wilcock 129--141 SFB-TRR-62,Planning http://www.springer.com/us/book/9789811025846 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Nothdurft2016UserInvolvement.pdf This book chapter was accepted at the 7th International Workshop On Spoken Dialogue Systems (IWSDS 2016) Florian Nothdurft Pascal Bercher Gregor Behnke Wolfgang Minker inproceedings KazSko:DL17:Justifications We propose a new procedure that can enumerate justifications of a logical entailment given a set of inferences using which this entailment can be derived from axioms in the ontology. The procedure is based on the extension of the resolution method with so-called answer literals. In comparison to other (SAT-based) methods for enumerating justifications, our procedure can enumerate justifications in any user-defined order that extends the subset relation. The procedure is easy to implement and can be parametrized with ordering and selection strategies used in resolution. We describe an implementation of the procedure provided in PULi—a new Java-based Proof Utility Library, and provide an em- pirical comparison of (several strategies of) our procedure and other SAT-based tools on popular EL ontologies. The experiments show that our procedure provides a comparable, if not better performance than those highly optimized tools. For example, using one of the strategies, we were able to compute all justifications for all direct subsumptions of Snomed CT in about 1.5 hour. No other tool used in our experiments was able to do it even within a much longer period. 2017 Proceedings of the 30th International Workshop on Description Logics (DL 2017) 1879 CEUR-WS.org CEUR Workshop Proceedings Alessandro Artale and Birte Glimm and Roman Kontchakov KnowledgeModeling, LiveOntologies http://ceur-ws.org/Vol-1879/paper38.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/KazSko17Justifications_DL.pdf Yevgeny Kazakov Peter Skocovsky inbook Reuter2017CompBookEnvironmentAdaption One of the key characteristics of a Companion-System is the adaptation of its functionality to the user’s preferences and the environment. On the one hand, a dynamic environment model facilitates the adaption of output modalities in human computer interaction (HCI) to the current situation. On the other hand, continuous tracking of users in the proximity of the system allows for resuming a previously interrupted interaction. Thus, an environment perception system based on a robust multi-object tracking algorithm is required to provide these functionalities. In typical Companion-System applications, persons in the proximity are closely spaced, which leads to statistical dependencies in their behavior. The multi-object Bayes filter allows for modeling these statistical dependencies by representing the multi-object state using random finite sets. Based on the social force model and the knowledge base of the companion system, an approach to modeling object interactions is presented. In this work, the interaction model is incorporated into the prediction step of the sequential Monte Carlo (SMC) of the multi-object Bayes filter. Further, an alternative implementation of the multi-object Bayes filter based on labeled random finite sets is outlined. 2017 10.1007/978-3-319-43665-4_15 Springer 15 Cognitive Technologies Susanne Biundo and Andreas Wendemuth 301--320 SFB-TRR-62 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Reuter2017CompBookEnvironmentAdaption.pdf Stephan Reuter Alexander Scheel Thomas Geier Klaus Dietmayer inproceedings Behnke2017Challenge A promising field of application for cognitive technical systems is individualised user assistance for complex tasks. Here, a companion system usually uses an AI planner to solve the underlying combinatorial problem. Often, the use of a bare black-box planning system is not sufficient to provide individualised assistance, but instead the user has to be able to control the process that generates the presented advice. Such an integration guarantees that the user will be satisfied with the assistance s/he is given, trust the advice more, and is thus more likely to follow it. In this paper, we provide a general theoretical view on this process, called mixed-initiative planning, and derive several research challenges from it. 2017 Proceedings of the 2nd International Conference on Companion Technology (ICCT 2017) IEEE SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Behnke2017Challenge.pdf Gregor Behnke Benedikt Leichtmann Pascal Bercher Daniel ��ö������� Verena Nitsch Martin Baumann Susanne Biundo inproceedings BrGl17a 2017 Proceedings of the 30th International Workshop on Description Logics (DL 2017) 1879 CEUR-WS.org CEUR Workshop Proceedings AutomatedReasoning http://ceur-ws.org/Vol-1879/paper19.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/GlBr17a.pdf Markus Brenner Birte Glimm inproceedings Ulmschneider.2017 Innovative capacity is highly dependent upon knowledge and the possession of unique competences can be an important source of enduring strategic advantage. Hence, being able to identify, locate, measure, and assess competence occupants can be a decisive competitive edge. In this work, we introduce a framework that assists with performing such tasks. To achieve this, NLP-, rule-based, and machine learning techniques are employed to process raw data such as academic publications or patents. The framework gains normalized person and organization profiles and compiles identified entities (such as persons, organizations, or locations) into dedicated objects disambiguating and unifying where needed. The objects are then mapped with conceptual systems and stored along with identified semantic relations in a Knowledge Graph, which is constituted by RDF triples. An OWL reasoner allows for answering complex business queries, and in particular, to analyze and evaluate competences on multiple aggregation levels (i.e., single vs. collective) and dimensions (e.g., region, technological field of interest, time). In order to prove the general applicability of the framework and to illustrate how to solve concrete business cases from the automotive domain, it is evaluated with different datasets. 2017 978-3-319-69547-1 10.1007/978-3-319-69548-8_15 Proceedings of the 8th International Conference on Knowledge Engineering and Semantic Web (KESW 2017) Springer

Berlin, Germany

Communications in Computer and Information Science (CCIS) Rozewski, Przemyslaw and Lange, Christoph 211--226 Competence Analysis;Competence Assessment;Competence Detection;Computational Linguistics;Corporate Strategy;Data Mining;Decision Making;Expert Matching;Expert Mining;Information Extraction;Information Retrieval;Innovation Ecosystem;Knowledge Graph;Knowledge Representation;Machine Learning;Name Disambiguation;Name Normalization;Natural Language Processing;Ontology;Patent Analysis;Question Answering;Reasoning;Semantic Analysis;Semantic Technologies AutomatedReasoning,KnowledgeModelling https://link.springer.com/chapter/10.1007/978-3-319-69548-8_15 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/UlGl17a.pdf Klaus Ulmschneider Birte Glimm inbook Geier2017CompBookMLKP Companion-Systems are composed of different modules that have to share a single, sound estimate of the current situation. While the long-term decision-making of automated planning requires knowledge about the user’s goals, short-term decisions, like choosing among modes of user-interaction, depend on properties such as lighting conditions. In addition to the diverse scopes of the involved models, a large portion of the information required within such a system cannot be directly observed, but has to be inferred from background knowledge and sensory data—sometimes via a cascade of abstraction layers, and often resulting in uncertain predictions. In this contribution, we interpret an existing cognitive technical system under the assumption that it solves a factored, partially observable Markov decision process. Our interpretation heavily draws from the concepts of probabilistic graphical models and hierarchical reinforcement learning, and fosters a view that cleanly separates between inference and decision making. The results are discussed and compared to those of existing approaches from other application domains. 2017 10.1007/978-3-319-43665-4_2 Companion Technology -- A Paradigm Shift in Human-Technology Interaction Springer 2 Cognitive Technologies Susanne Biundo 17--36 SFB-TRR-62 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Geier2017CompBookMLKP.pdf Thomas Geier Susanne Biundo inbook Siegert2017CompBookTicketSystem We demonstrate a successful multimodal dynamic human-computer interaction (HCI) in which the system adapts to the current situation and the user’s state is provided using the scenario of purchasing a train ticket. This scenario demonstrates that Companion Systems are facing the challenge of analyzing and interpreting explicit and implicit observations obtained from sensors under changing environmental conditions. In a dedicated experimental setup, a wide range of sensors was used to capture the situative context and the user, comprising video and audio capturing devices, laser scanners, a touch screen, and a depth sensor. Explicit signals describe a user’s direct interaction with the system, such as interaction gestures, speech and touch input. Implicit signals are not directly addressed to the system; they comprise the user’s situative context, his or her gesture, speech, body pose, facial expressions and prosody. Both multimodally fused explicit signals and interpreted information from implicit signals steer the application component, which was kept deliberately robust. The application offers stepwise dialogs gathering the most relevant information for purchasing a train ticket, where the dialog steps are sensitive and adaptable within the processing time to the interpreted signals and data. We further highlight the system’s potential for a fast-track ticket purchase when several pieces of information indicate a hurried user. A video of the complete scenario in German language is available at: http://www.uni-ulm.de/en/in/sfb-transregio-62/pr-and-press/videos.html All authors contributed equally. 2017 10.1007/978-3-319-43665-4_25 Companion Technology -- A Paradigm Shift in Human-Technology Interaction Springer 25 Cognitive Technologies Susanne Biundo and Andreas Wendemuth 493--500 SFB-TRR-62 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Siegert2017CompBookTicketSystem.pdf Ingo Siegert Felix ������ü������� Miriam Schmidt Stephan Reuter Sascha Meudt Georg Layher Gerald Krell Thilo ��ö���Ա��� Sebastian Handrich Ayoub Al-Hamadi Klaus Dietmayer Heiko Neumann ��ü�Գٳ��� Palm Friedhelm Schwenker Andreas Wendemuth inproceedings KazPon:DL17:Integration We propose a new mechanism for integration of OWL ontologies using semantic import relations. In contrast to the standard OWL importing, we do not require all axioms of the imported ontologies to be taken into account for reasoning tasks, but only their logical implications over a chosen signature. This property comes natural in many ontology integration scenarios. In this paper, we study the complexity of reasoning over ontologies with semantic import relations and establish a range of tight complexity bounds for various fragments of OWL. 2017 Proceedings of the 30th International Workshop on Description Logics (DL 2017) 1879 CEUR-WS.org CEUR Workshop Proceedings Alessandro Artale and Birte Glimm and Roman Kontchakov KnowledgeModeling, LiveOntologies http://ceur-ws.org/Vol-1879/paper59.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/KazPon17Integration_DL.pdf Yevgeny Kazakov Denis Ponomaryov conference GliKazTra:17:Abstraction:Horn:SHOIF:AAAI Abstraction refinement is a recently introduced technique using which reasoning over large ABoxes is reduced to reasoning over small abstract ABoxes. Although the approach is sound for any classical Description Logic such as {SROIQ}, it is complete only for Horn {ALCHOI}. In this paper, we propose an extension of this method that is now complete for Horn {SHOIF} and also handles role- and equality-materialization. To show completeness, we use a tailored set of materialization rules that loosely decouple the ABox from the TBox. An empirical evaluation demonstrates that, despite the new features, the abstractions are still significantly smaller than the original ontologies and the materialization can be computed efficiently. 2017 Proceedings of the 31st AAAI Conference on Artificial Intelligence AAAI Press Satinder P. Singh and Shaul Markovitch 1114--1120 31st AAAI Conference on Artificial Intelligence San Francisco, California, USA AutomatedReasoning http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14726 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/GlKT17a.pdf Birte Glimm Yevgeny Kazakov Trung-Kien Tran proceedings ArGK17a 2017 1879 CEUR-WS.org CEUR Workshop Proceedings Artale, Alessandro and Glimm, Birte and Kontchakov, Roman http://ceur-ws.org/Vol-1879/ article Ponomaryov:2017:PDL:3091105.3091119 2017 10.1145/3091119 ACM Transactions on Computational Logic 18 ACM 1--41 2 SFB-TRR-62,AutomatedReasoning http://doi.acm.org/10.1145/3091119 Denis Ponomaryov Mikhail Soutchanski inproceedings MaKG17a This paper presents a novel approach, QSMat, for efficient RDF data stream querying with flexible query-based materialization. Previous work accelerates either the maintenance of a stream window materialization or the evaluation of a query over the stream. QSMat exploits knowledge of a given query and entailment rule-set to accelerate window materialization by avoiding inferences that provably do not affect the evaluation of the query. We prove that stream querying over the resulting partial window materializations with QSMat is sound and complete with regard to the query. A comparative experimental performance evaluation based on the Berlin SPARQL benchmark and with selected representative systems for stream reasoning shows that QSMat can significantly reduce window materialization size, reasoning overhead, and thus stream query evaluation time. 2017 10.1007/978-3-319-69548-8_12 Proceedings of the 8th International Conference on Knowledge Engineering and Semantic Web (KESW 2017) 786 Springer-Verlag Communications in Computer and Information Science 159-174 AutomatedReasoning https://link.springer.com/chapter/10.1007/978-3-319-69548-8_12 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/MaKG17a.pdf Christian Mathieu Matthias Klusch Birte Glimm inproceedings GlKT17b 2017 Proceedings of the 30th International Workshop on Description Logics (DL 2017) 1879 CEUR-WS.org CEUR Workshop Proceedings AutomatedReasoning http://ceur-ws.org/Vol-1879/paper57.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/GlKT17b.pdf Birte Glimm Yevgeny Kazakov Trung-Kien Tran inproceedings Behnke2017Sloth We present the mixed-initiative planning system SLOTH, which is designed to assist users in planning a fitness workout. Mixed-initiative planning systems are especially useful for companion systems, as they allow the seamless integration of the complex cognitive ability of planning into ambient assistance systems. This is achieved by integrating the user directly into the process of plan generation and thereby allowing him to specify these objectives and to be assisted in generating a plan that not only achieves his objectives, but at the same time also fits his preferences. We present the capabilities that are integrated into SLOTH and discuss the design choices and considerata that have to be taken into account when constructing a mixed-initiative planning system. 2017 10.1109/COMPANION.2017.8287077 Proceedings of the 2nd International Conference on Companion Technology (ICCT 2017) IEEE SFB-TRR-62,Planning http://ieeexplore.ieee.org/document/8287077/ http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Behnke2017Sloth.pdf Gregor Behnke Florian Nielsen Marvin R. G. Schiller Pascal Bercher Matthias Kraus Wolfgang Minker Susanne Biundo Birte Glimm inproceedings ScSG17a 2017 Proceedings of the 30th International Workshop on Description Logics (DL 2017) 1879 CEUR-WS.org CEUR Workshop Proceedings AutomatedReasoning,KnowledgeModelling http://ceur-ws.org/Vol-1879/paper43.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/ScSG17a.pdf Birte Glimm Marvin R. G. Schiller Florian Schiller article PMGG17a The OWL Reasoner Evaluation competition is an annual competition (with an associated workshop) that pits OWL 2 compliant reasoners against each other on various standard reasoning tasks over naturally occurring problems. The 2015 competition was the third of its sort and had 14 reasoners competing in six tracks comprising three tasks (consistency, classification, and realisation) over two profiles (OWL 2 DL and EL). In this paper, we discuss the design, execution and results of the 2015 competition with particular attention to lessons learned for benchmarking, comparative experiments, and future competitions. 2017 10.1007/s10817-017-9406-8 Journal of Automated Reasoning (JAR) 59 455-482 4 Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning https://doi.org/10.1007/s10817-017-9406-8 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/PMGG17a.pdf Bijan Parsia Nicolas Matentzoglu Rafael S. Goncalves Birte Glimm Andreas Steigmiller inproceedings Behnke17Verify Plan-Verification is the task of determining whether a plan is a solution to a given planning problem. Any plan verifier has, apart from showing that verifying plans is possible in practice, a wide range of possible applications. These include mixed-initiative planning, where a user is integrated into the planning process, and local search, e.g., for post-optimising plans or for plan repair. In addition to its practical interest, plan verification is also a problem worth investigating for theoretical reasons. Recent work showed plan verification for hierarchical planning problems to be NP-complete, as opposed to classical planning where it is in P. As such, plan verification for hierarchical planning problem was – until now – not possible. We describe the first plan verifier for hierarchical planning. It uses a translation of the problem into a SAT formula. Further we conduct an empirical evaluation, showing that the correct output is produced within acceptable time. 2017 Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017) AAAI Press 20--28 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Behnke17Verify_Talk.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Behnke17Verify.pdf Gregor Behnke Daniel ��ö������� Susanne Biundo inbook Behnke2017CompBookMIP Settings where systems and users work together to solve problems collaboratively are among the most challenging applications of Companion-Technology. So far we have seen how planning technology can be exploited to realize Companion-Systems that adapt flexibly to changes in the user’s situation and environment and provide detailed help for users to realize their goals. However, such systems lack the capability to generate their plans in cooperation with the user. In this chapter we go one step further and describe how to involve the user directly into the planning process. This enables users to integrate their wishes and preferences into plans and helps the system to produce individual plans, which in turn let the Companion-System gain acceptance and trust from the user. Such a Companion-System must be able to manage diverse interactions with a human user. A so-called mixed-initiative planning system integrates several Companion-Technologies which are described in this chapter. For example, a—not yet final—plan, including its flaws and solutions, must be presented to the user to provide a basis for her or his decision. We describe how a dialog manager can be constructed such that it can handle all communication with a user. Naturally, the dialog manager and the planner must use coherent models. We show how an ontology can be exploited to achieve such models. Finally, we show how the causal information included in plans can be used to answer the questions a user might have about a plan. The given capabilities of a system to integrate user decisions and to explain its own decisions to the user in an appropriate way are essential for systems that interact with human users. 2017 10.1007/978-3-319-43665-4_7 Companion Technology -- A Paradigm Shift in Human-Technology Interaction Springer 7 Cognitive Technologies Susanne Biundo and Andreas Wendemuth 123--144 SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Behnke2017CompBookMIP.pdf Gregor Behnke Florian Nielsen Marvin R. G. Schiller Denis Ponomaryov Pascal Bercher Birte Glimm Wolfgang Minker Susanne Biundo inproceedings KazKliStu:DL17:Explanations We present several extensions of the explanation facility of the ontology editor Protege. Currently, explanations of OWL entailments in Protege are provided as justifications—minimal subsets of axioms that entail the given axiom. The plugin called ‘explanation workbench’ computes justifications using a black-box algorithm and displays them in a convenient way. Recently, several other (mostly glass-box) tools for computing justifications have been developed, and it would be of interest to use such tools in Protege. To facilitate the development of justification-based explanation plugins for Protege, we have separated the explanation workbench into two reusable components—a plugin for black- box computation of justifications and a plugin for displaying (any) justifications. Many glass-box methods compute justifications from proofs, and we have also developed a reusable plugin for this service that can be used with (any) proofs. In addition, we have developed an explanation plugin that displays such proofs directly. Both plugins can be used, e.g., with the proofs provided by the ELK reasoner. This paper describes design, features, and implementation of these plugins. 2017 Proceedings of the 30th International Workshop on Description Logics (DL 2017) 1879 CEUR-WS.org CEUR Workshop Proceedings Alessandro Artale and Birte Glimm and Roman Kontchakov KnowledgeModeling, ELK, LiveOntologies http://ceur-ws.org/Vol-1879/paper31.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/KazKliStu17Explanations_DL.pdf Yevgeny Kazakov Pavel Klinov Alexander Stupnikov inbook Bercher2017CompBookUCPlanning User-centered planning capabilities are core elements of Companion-Technology. They are used to implement the functional behavior of technical systems in a way that makes those systems Companion-able – able to serve users individually, to respect their actual requirements and needs, and to flexibly adapt to changes of the user’s situation and environment. This book chapter presents various techniques we have developed and integrated to realize user-centered planning. They are based on a hybrid planning approach that combines key principles also humans rely on when making plans: stepwise refining complex tasks into executable courses of action and considering causal relationships between actions. Since the generated plans impose only a partial order on actions, they allow for a highly flexible execution order as well. Planning for Companion-Systems may serve different purposes, depending on the application for which the system is created. Sometimes, plans are just like control programs and executed automatically in order to elicit the desired system behavior; but sometimes they are made for humans. In the latter case, plans have to be adequately presented and the definite execution order of actions has to coincide with the user’s requirements and expectations. Furthermore, the system should be able to smoothly cope with execution errors. To this end, the plan generation capabilities are complemented by mechanisms for plan presentation, execution monitoring, and plan repair. 2017 10.1007/978-3-319-43665-4_5 Companion Technology -- A Paradigm Shift in Human-Technology Interaction Springer 5 Cognitive Technologies Susanne Biundo and Andreas Wendemuth 79--100 SFR-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2017/Bercher2017CompBookUCPlanning.pdf Pascal Bercher Daniel ��ö������� Gregor Behnke Susanne Biundo article GlSt2016a 2016 0933-1875 10.1007/s13218-016-0424-1 KI - Künstliche Intelligenz 30 117--130 2 Reasoning, Description Logics, Semantic Web AutomatedReasoning http://dx.doi.org/10.1007/s13218-016-0424-1 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/GlSt2016a.pdf Birte Glimm Heiner Stuckenschmidt inproceedings Hoeller16Expressivity From a theoretical perspective, judging the expressivity of planning formalisms helps to understand the relationship of different representations and to infer theoretical properties. From a practical point of view, it is important to be able to choose the best formalism for a problem at hand, or to ponder the consequences of introducing new representation features. Most work on the expressivity is based either on compilation approaches, or on the computational complexity of the plan existence problem. Recently, we introduced a new notion of expressivity. It is based on comparing the structural complexity of the set of solutions to a planning problem by interpreting the set as a formal language and classifying it with respect to the Chomsky hierarchy. This is a more direct measure than the plan existence problem and enables also the comparison of formalisms that can not be compiled into each other. While existing work on that last approach focused on different hierarchical problem classes, this paper investigates STRIPS with and without conditional effects; though we also tighten some existing results on hierarchical formalisms. Our second contribution is a discussion on the language-based expressivity measure with respect to the other approaches. 2016 Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS 2016) AAAI Press 158--165 26th International Conference on Automated Planning and Scheduling London SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Hoeller16Expressivity.pdf Daniel ��ö������� Gregor Behnke Pascal Bercher Susanne Biundo inproceedings Alford16BoundToPlan Hierarchical Task Network (HTN) planning is a formalism that can express constraints which cannot easily be expressed by classical (non-hierarchical) planning approaches. It enables reasoning about procedural structures and domain-specific search control knowledge. Yet the cornucopia of modern heuristic search techniques remains largely unincorporated in current HTN planners, in part because it is not clear how to estimate the goal distance for a partially-ordered task network. When using SHOP2-style progression, a task network of yet unprocessed tasks is maintained during search. In the general case it can grow arbitrarily large. However, many – if not most – existing HTN domains have a certain structure (called tail-recursive) where the network’s size is bounded. We show how this bound can be calculated and exploited to automatically translate tail-recursive HTN problems into non-hierarchical STRIPS representations, which allows using both hierarchical structures and classical planning heuristics. In principle, the approach can also be applied to non-tail-recursive HTNs by incrementally increasing the bound. We give three translations with different advantages and present the results of an empirical evaluation with several HTN domains that are translated to PDDL and solved by two current classical planning systems. Our results show that we can automatically find practical bounds for solving partially-ordered HTN problems. We also show that classical planners perform similarly with our automatic translations versus a previous hand-bounded HTN translation which is restricted to totally-ordered problems. 2016 Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS 2016) AAAI Press 20--28 26th International Conference on Automated Planning and Scheduling London SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Alford16BoundToPlan.pdf Ron Alford Gregor Behnke Daniel ��ö������� Pascal Bercher Susanne Biundo David Aha inproceedings Behnke16ChangeThePlan Interaction with users is a key capability of planning systems that are applied in real-world settings. Such a system has to be able to react appropriately to requests issued by its users. Most of these systems are based on a generated plan that is continually criticised by him, resulting in a mixed-initiative planning system. We present several practically relevant requests to change a plan in the setting of hierarchical task network planning and investigate their computational complexity. On the one hand, these results provide guidelines when constructing algorithms to execute the respective requests, but also provide translations to other well-known planning queries like plan existence or verification. These can be employed to extend an existing planner such that it can form the foundation of a mixed-initiative planning system simply by adding a translation layer on top. 2016 Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS 2016) AAAI Press 38--46 26th International Conference on Automated Planning and Scheduling London SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Behnke16Change_Talk.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Behnke16ChangeThePlan.pdf Gregor Behnke Daniel ��ö������� Pascal Bercher Susanne Biundo article Biundo16CompanionTechnology We introduce the Transregional Collaborative Research Centre “Companion-Technology for Cognitive Technical Systems” – a cross-disciplinary endeavor towards the development of an enabling technology for Companion-systems. These systems completely adjust their functionality and service to the individual user. They comply with his or her capabilities, preferences, requirements, and current needs and adapt to the individual’s emotional state and ambient conditions. Companion-like behavior of technical systems is achieved through the investigation and implementation of cognitive abilities and their well-orchestrated interplay. 2016 10.1007/s13218-015-0414-8 Künstliche Intelligenz 30 Springer 71-75 1 SFB-TRR-62 http://link.springer.com/article/10.1007/s13218-015-0414-8 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Biundo16CompanionTechnology.pdf Special Issue on Companion Technologies Special Issue on Companion Technologies Susanne Biundo Andreas Wendemuth article Biundo2016CompanionSurvey Companion-technology is an emerging field of cross-disciplinary research. It aims at developing technical systems that appear as "Companions'' to their users. They serve as co-operative agents assisting in particular tasks or, in a more general sense, even give companionship to humans. Overall, Companion-technology enables technical systems to smartly adapt their services to individual users' current needs, their requests, situation, and emotion. We give an introduction to the field, discuss the most relevant application areas that will benefit from its developments, and review the related research projects. 2016 10.1007/s13218-015-0419-3 Künstliche Intelligenz 30 Springer 11-20 1 SFB-TRR-62,Planning http://link.springer.com/article/10.1007/s13218-015-0419-3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Biundo2016CompanionSurvey.pdf Special Issue on Companion Technologies Susanne Biundo Daniel ��ö������� Bernd Schattenberg Pascal Bercher inproceedings ZhQG16a Materialization is an important reasoning service for applications built on the Web Ontology Language (OWL). To make materialization efficient in practice, current research focuses on deciding tractability of an ontology language and designing parallel reasoning algorithms. However, some well-known large-scale ontologies, such as YAGO, have been shown to have good performance for parallel reasoning, but they are expressed in ontology languages that are not parallelly tractable, i.e., the reasoning is inherently sequential in the worst case. This motivates us to study the problem of parallel tractability of ontology materialization from a theoretical perspective. That is, we aim to identify the ontologies for which materialization is parallelly tractable, i.e., in NC complexity. In this work, we focus on datalog rewritable ontology languages. We identify several classes of datalog rewritable ontologies (called parallelly tractable classes) such that materialization over them is parallelly tractable. We further investigate the parallel tractability of materialization of a datalog rewritable OWL fragment DHL (Description Horn Logic) and an extension of DHL that allows complex role inclusion axioms. Based on the above results, we analyze real-world datasets and show that many ontologies expressed in DHL or its extension belong to the parallelly tractable classes. 2016 10.3233/978-1-61499-672-9-73 Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016) 285 IOS Press Frontiers in Artificial Intelligence and Applications 73-81 Reasoning, Description Logics, Optimisations, Optimizations,Materialization, Materialisation, Paralellisation, Paralellization AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/ZhQG16a.pdf Zhangquan Zhou Guilin Qi Birte Glimm article Smith2016Interview David E. Smith is a senior Researcher in the Intelligent Systems Division at NASA Ames Research Center. He received his Ph.D. in 1985 from Stanford University, and spent time as a Research Associate at Stanford, a Scientist at the Rockwell Palo Alto Science Center, and a Visiting Scholar at the University of Washington before joining NASA in 1997. Beginning in 1999, he served as the lead of the 18 member planning and scheduling group at NASA Ames for six years before abdicating to devote more time to research. Much of his research has focused on pushing the boundaries of AI planning technology to handle richer models of time, concurrency, exogenous events, uncertainty, and oversubscription. Smith served as an Associate Editor for the Journal of Artificial Intelligence Research (JAIR) from 2001-2004, and as Guest Editor for the JAIR Special Issue and Special Track on the 3rd and 4th International Planning Competitions. He served on the JAIR Advisory Board 2004-2007. Smith was recognized as a AAAI Fellow in 2005, and served on the AAAI Executive Council 2007-2010. 2016 10.1007/s13218-015-0403-y Künstliche Intelligenz 30 Springer 101--105 1 SFB-TRR-62,Planning http://link.springer.com/article/10.1007/s13218-015-0403-y /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Smith2016Interview.pdf Special Issue on Companion Technologies Pascal Bercher Daniel ��ö������� article Glim2016a 2016 0933-1875 10.1007/s13218-016-0428-x KI - Künstliche Intelligenz 30 201--203 2 Reasoning, Description Logics, Semantic Web AutomatedReasoning http://dx.doi.org/10.1007/s13218-016-0428-x /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Glim2016a.pdf Birte Glimm inproceedings Bercher16HybridPlanningComplexities There are several formalizations for hierarchical planning. Many of them allow to specify preconditions and effects for compound tasks. They can be used, e.g., to assist during the modeling process by ensuring that the decomposition methods' plans ``implement'' the compound tasks' intended meaning. This is done based on so-called legality criteria that relate these preconditions and effects to the method's plans and pose further restrictions. Despite the variety of expressive hierarchical planning formalisms, most theoretical investigations are only known for standard HTN planning, where compound tasks are just names, i.e., no preconditions or effects can be specified. Thus, up to know, a direct comparison to other hierarchical planning formalisms is hardly possible and fundamental theoretical properties are yet unknown. We therefore investigate the theoretical impact of such preconditions and effects -- depending on the legality criteria known from the literature -- for two of the most basic questions to planning: plan existence and plan verification. It turns out that for all investigated legality criteria, the respective problems are as hard as in the HTN setting and therefore equally expressive. 2016 Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016) IOS Press 225--233 SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Bercher16HybridPlanningComplexitiesSlides.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Bercher16HybridPlanningComplexities.pdf Pascal Bercher Daniel ��ö������� Gregor Behnke Susanne Biundo inproceedings DS3ESSV:2016DS3 The demonstration scenario of the SFB/TRR-62 shows multimodal, dynamic interactions between a human being and a technical system that are adaptive to the situation and the emotional state. It uses the example of purchasing a train ticket to demonstrate how a companion system is able to adapt its dialog with the user according to the situational context and the emotions of the user. One special feature of this scenario are the simultaneous analyses and evaluations of explicit and implicit input data. The scenario demonstrates further how background knowledge about the user can be included; for example often visited destinations, the user's timetable or the number of travelers. 2016 Elektronische Sprachsignalverarbeitung 2016. Tagungsband der 27. Konferenz 81 TUDpress

Leipzig, Germany

Studientexte zur Sprachkommunikation Jokisch, Oliver 111--118 SFB-TRR-62 Ingo Siegert Stephan Reuter Felix ������ü������� Georg Layher Thilo ��ö���Ա��� Sascha Meudt Andreas Wendemuth inproceedings GlKT16a 2016 Proceedings of the 29th International Workshop on Description Logics (DL 2016) 1577 CEUR-WS.org CEUR Workshop Proceedings AutomatedReasoning http://ceur-ws.org/Vol-1577/invited_paper_1.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/GlKT16a.pdf Birte Glimm Yevgeny Kazakov Trung-Kien Tran phdthesis DBLP:phd/dnb/Steigmiller16 2016 University of Ulm, Germany https://oparu.uni-ulm.de/xmlui/handle/123456789/4042?locale-attribute=en http://nbn-resolving.de/urn:nbn:de:bsz:289-oparu-4042-6 Andreas Steigmiller inproceedings GlKT16b 2016 Proceedings of the 10th International Conference on Web Reasoning and Rule Systems (RR 2016) 9898 Springer-Verlag Lecture Notes in Computer Science Magdalena Ortiz and Stefan Schlobach 77--93 Reasoning, Description Logics, Optimisations, Optimizations, Materialization, Materialisation, Abstraction AutomatedReasoning http://dx.doi.org/10.1007/978-3-319-45276-0_7 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/GlKT16b.pdf Best Student Paper Award Birte Glimm Yevgeny Kazakov Trung-Kien Tran inproceedings Ulmschneider.2016 In recent years patents have become increasingly important for businesses to protect their intellectual capital and as a valuable source of information. Patent information is, however, not employed to its full potential and the interpretation of structured and unstructured patent information in large volumes remains a challenge. We address this by proposing an integrated interdisciplinary approach that uses natural language processing and machine learning techniques to formalize multilingual patent information in an ontology. The ontology further contains patent and domain specific knowledge, which allows for aligning patents with technological fields of interest and other business-related artifacts. Our empirical evaluation shows that for categorizing patents according to well-known technological fields of interest, the approach achieves high accuracy with selected feature sets compared to related work focussing on monolingual patents. We further show that combining OWL RL reasoning with SPARQL querying over the patent knowledge base allows for answering complex business queries and illustrate this with real-world use cases from the automotive domain. 2016 9781509042395 10.1109/SSCI.2016.7849943 Proceedings of the 7th IEEE Symposium Series on Computational Intelligence (SSCI'16) IEEE Computer Society

Red Hook, United States

Jin, Yaochu and Kollias, Stefanos 1-8 Computational Intelligence;Computational Linguistics;Corporate Strategy;Data Mining;Decision Making;Information Extraction;Information Retrieval;Knowledge Graph;Knowledge Representation;Machine Learning;Natural Language Processing;Patent Analysis;Reasoning;Semantic Analysis;Semantic Technologies AutomatedReasoning,KnowledgeModelling http://ieeexplore.ieee.org/document/7849943/ /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/UlGl16a.pdf Klaus Ulmschneider Birte Glimm article Biundo2016Editorial Dear reader, at present, we observe a rapid growth in the development of increasingly complex “intelligent” systems that serve users throughout all areas of their daily lives. They range from classical technical systems such as household appliances, cars, or consumer electronics through mobile apps and services to advanced service robots in various fields of application. While many of the rather conventional systems already provide multiple modalities to interact with, the most advanced are even equipped with cognitive abilities such as perception, cognition, and reasoning. However, the use of such complex technical systems and in particular the actual exploitation of their rich functionality remain challenging and quite often lead to users’ cognitive overload and frustration. Companion Technologies bridge the gap between the extensive functionality of technical systems and human users’ individual requirements and needs. They enable the construction of really smart – adaptive, flexible, and cooperative – technical systems by applying and fusing techniques from different areas of research. In our special issue we present interesting pieces of work – quite a number of new technical contributions, ongoing and completed research projects, several dissertation abstracts, as well as an interview – that are related to, or even fundamental for, Companion-Technology. In the community part of this issue, there is also a conference report on the first International Symposium on Companion-Technology. 2016 10.1007/s13218-015-0421-9 Künstliche Intelligenz 30 Springer 5-9 1 SFB-TRR-62,Planning http://link.springer.com/article/10.1007/s13218-015-0421-9 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/Biundo2016Editorial.pdf Special Issue on Companion Technologies Susanne Biundo Daniel ��ö������� Pascal Bercher article GlSt2016b 2016 1610-1987 10.1007/s13218-016-0430-3 KI - Künstliche Intelligenz 30 113--115 2 Reasoning, Description Logics, Semantic Web AutomatedReasoning http://dx.doi.org/10.1007/s13218-016-0430-3 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/GlSt2016b.pdf Birte Glimm Heiner Stuckenschmidt inproceedings PMGG16a 2016 Proceedings of the 15th International Semantic Web Conference (ISWC 2016) 9982 Springer-Verlag Lecture Notes in Computer Science Paul T. Groth and Elena Simperl and Alasdair J. G. Gray and Marta Sabou and Markus ����ö�ٳ������� and Freddy Lécué and Fabian Flöck and Yolanda Gil 159--167 Benchmarking, Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning http://link.springer.com/chapter/10.1007%2F978-3-319-46547-0_17 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2016/PMGG16a.pdf Best Resource Track Paper Award Bijan Parsia Nicolas Matentzoglu Rafael S. Goncalves Birte Glimm Andreas Steigmiller inproceedings BrGl15a Current approaches to stream reasoning neglect knowledge about the system as a whole. We present first steps towards self-describing streams by outlining a possible definition of the data produced by differ- ent streams. We give an outlook on future paths and how such descrip- tions can be used to improve reasoning about the streamed data. 2015 9 Proceedings of the International Symposium on Companion Technology (ISCT 2015) SFB-TRR-62,AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/BrGl15a.pdf Markus Brenner Birte Glimm inproceedings Bercher2015DemoSystem Modern technical devices are often too complex for many users to be able to use them to their full extent. Based on planning technology, we are able to provide advanced user assistance for operating technical devices. We present a system that assists a human user in setting up a complex home theater consisting of several HiFi devices. For a human user, the task is rather challenging due to a large number of different ports of the devices and the variety of available cables. The system supports the user by giving detailed instructions how to assemble the theater. Its performance is based on advanced user-centered planning capabilities including the generation, repair, and explanation of plans. 2015 Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) AAAI Press 4264--4265 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Bercher15DemoSystem.pdf Pascal Bercher Felix Richter Thilo ��ö���Ա��� Thomas Geier Daniel ��ö������� Gregor Behnke Florian Nothdurft Frank Honold Wolfgang Minker Michael Weber Susanne Biundo inproceedings Behnke15MIPDiscussion Companion systems aim to extend the abilities of ordinary technical systems, for instance by modeling the user's situation, by recognizing the user's intentions, and by being able to interact with the user and to adapt to her/him. Such a system depends on planning capabilities to determine which actions are necessary to achieve a particular goal. In many situations it may not be appropriate for a companion system to develop plans on its own, but instead it has to integrate the user while creating the plan, i.e., it needs to be mixed-initiative. Based on earlier work, we demonstrate how a central knowledge base for a mixed-initiative planning system can be designed. We outline various benefts our approach brings to bear within a companion system. Lastly, we present several requests a user might issue towards the mixed-initiative planning system and how they can be answered by harnessing the knowledge base. 2015 Proceedings of the First International Symposium on Companion Technology (ISCT 2015) 43--48 First International Symposium on Companion Technology (ISCT 2015) Ulm, Germany SFB-TRR-62,Planning,AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Behnke15MIPDiscussion.pdf Gregor Behnke Marvin R. G. Schiller Denis Ponomaryov Florian Nothdurft Pascal Bercher Wolfgang Minker Birte Glimm Susanne Biundo inproceedings KazKli:2015:Advancing-ELK:DL This paper reports on the recent development of ELK, a consequence-based reasoner for $\mathcal{EL^+_\bot}$ ontologies. It covers novel reasoning techniques which aim at improving efficiency and providing foundation for new reasoning services. On the former front we present a simple optimization for handling of role composition axioms, such as transitivity, which substantially reduces the number of rule applications. For the latter, we describe a new rule application strategy that takes advantage of concept definitions to avoid many redundant inferences without making rules dependent on derived conclusions. This improvement is not visible to the end user but considerably simplifies implementation for incremental reasoning and proof generation. We also present a rewriting of low-level inferences used by ELK to higher-level proofs that can be defined in the standard DL syntax, and thus be used for automatic verification of reasoning results or (visual) ontology debugging. We demonstrate the latter capability using a new ELK Prot\'eg\'e plugin. 2015 DL 1350 CEUR-WS.org CEUR Workshop Proceedings Diego Calvanese and Boris Konev KnowledgeModeling, ELK, LiveOntologies http://ceur-ws.org/Vol-1350/paper-27.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/KazKli15Advancing-ELK_DL.pdf Yevgeny Kazakov Pavel Klinov inproceedings Richter2015believing Partially observable Markov decision processes (POMDP) are well-suited for realizing sequential decision making capabilities that respect uncertainty in Companion systems that are to naturally interact with and assist human users. Unfortunately, their complexity prohibits modeling the entire Companion system as a POMDP. We therefore propose an approach that makes use of abstraction to enable employing POMDPs in Companion systems and discuss challenges for applying it. 2015 Proceedings of the First International Symposium on Companion Technology (ISCT 2015) First International Symposium on Companion Technology Ulm, Germany POMDP, cognitive technical systems SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/believingPOMDPs.pdf Felix Richter Thomas Geier Susanne Biundo inproceedings Behnke2015Coherence The integration of the various specialized components of cognitive systems poses a challenge, in particular for those architectures that combine planning, inference, and human-computer interaction (HCI). An approach is presented that exploits a single source of common knowledge contained in an ontology. Based upon the knowledge contained in it, specialized domain models for the cognitive systems’ components can be generated automatically. Our integration targets planning in the form of hierarchical planning, being well-suited for HCI as it mimics planning done by humans. We show how the hierarchical structures of such planning domains can be (partially) inferred from declarative background knowledge. The same ontology furnishes the structure of the interaction between the cognitive system and the user. First, explanations of plans presented to users are enhanced by ontology explanations. Second, a dialog domain is created from the ontology coherent with the planning domain. We demonstrate the application of our technique in a fitness training scenario. 2015 Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2015) AAAI Press 1442-1449 IJCAI 2015 Buenos Aires SFB-TRR-62,Planning,AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Behnke15IJCAI-poster.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/BPSB15a.pdf Gregor Behnke Denis Ponomaryov Marvin R. G. Schiller Pascal Bercher Florian Nothdurft Birte Glimm Susanne Biundo inproceedings StGL15a 2015 Proceedings of the 28th International Workshop on Description Logics (DL 2015) CEUR Workshop Proceedings AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/StGL15a.pdf Andreas Steigmiller Birte Glimm Thorsten Liebig article Glodek201517 Abstract Recent trends in human–computer interaction (HCI) show a development towards cognitive technical systems (CTS) to provide natural and efficient operating principles. To do so, a CTS has to rely on data from multiple sensors which must be processed and combined by fusion algorithms. Furthermore, additional sources of knowledge have to be integrated, to put the observations made into the correct context. Research in this field often focuses on optimizing the performance of the individual algorithms, rather than reflecting the requirements of CTS. This paper presents the information fusion principles in CTS architectures we developed for Companion Technologies. Combination of information generally goes along with the level of abstractness, time granularity and robustness, such that large CTS architectures must perform fusion gradually on different levels — starting from sensor-based recognitions to highly abstract logical inferences. In our CTS application we sectioned information fusion approaches into three categories: perception-level fusion, knowledge-based fusion and application-level fusion. For each category, we introduce examples of characteristic algorithms. In addition, we provide a detailed protocol on the implementation performed in order to study the interplay of the developed algorithms. 2015 0925-2312 10.1016/j.neucom.2015.01.076 Neurocomputing 161 17 - 37 Human–computer interaction SFB-TRR-62 http://www.sciencedirect.com/science/article/pii/S0925231215002155/pdfft?md5=0f4a009f3f5ba7b155a82192be2a0dbe&pid=1-s2.0-S0925231215002155-main.pdf Michael Glodek Frank Honold Thomas Geier Gerald Krell Florian Nothdurft Stephan Reuter Felix ������ü������� Thilo ��ö���Ա��� Klaus Dietmayer Wolfgang Minker Susanne Biundo Michael Weber ��ü�Գٳ��� Palm Friedhelm Schwenker inproceedings Bercher15DissertationAbstractDC The thesis presents a novel set-theoretic formalization of (propositional) hybrid planning – a planning framework that fuses Hierarchical Task Network (HTN) planning with Partial-Order Causal-Link (POCL) planning. Several sub classes thereof are identified that capture well-known problems such as HTN planning and POCL planning. For these problem classes, the complexity of the plan-existence problem is investigated, i.e., the problem of deciding whether there exists a solution for a given planning problem. For solving the problems of the respective problem classes, a hybrid planning algorithm is presented. Its search is guided by informed heuristics. Several such heuristics are introduced, both for POCL planning problems (i.e., problems without task hierarchy) and for hybrid planning problems (i.e., heuristics that are "hierarchy-aware"). 2015 Doctoral Consortium at ICAPS 2015 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Bercher15DissertationAbstractDC.pdf Pascal Bercher proceedings DGGH2015a 2015 1387 CEUR-WS.org CEUR Workshop Proceedings Michel Dumontier and Birte Glimm and Rafael S. Goncalves and Matthew Horridge and Ernesto Jimenez-Ruiz and Nicolas Matentzoglu and Bijan Parsia and Giorgos B. Stamou and Giorgos Stoilos Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning http://ceur-ws.org/Vol-1387 inproceedings BBBGPS2015OntologiesAndPlanning We present an approach for integrating ontological reasoning and planning within cognitive systems. Patterns and mechanisms that suitably link planning domains and interrelated knowledge in an ontology are devised. In particular, this enables the use of (standard) ontology reasoning for extending a (hierarchical) planning domain. Furthermore, explanations of plans generated by a cognitive system benefit from additional explanations relying on background knowledge in the ontology and inference. An application of this approach in the domain of fitness training is presented. 2015 Proceedings of the 28th International Workshop on Description Logics (DL 2015) CEUR Workshop Proceedings AutomatedReasoning, Planning, SFB-TRR-62 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/BBBG15a.pdf Gregor Behnke Pascal Bercher Susanne Biundo Birte Glimm Denis Ponomaryov Marvin R. G. Schiller inproceedings Geier2015 Conditioned Belief Propagation (CBP) is an algorithm for approximate inference in probabilistic graphical models. It works by conditioning on a subset of variables and solving the remainder using loopy Belief Propagation. Unfortunately, CBP's runtime scales exponentially in the number of conditioned variables. Locally Conditioned Belief Propagation (LCBP) approximates the results of CBP by treating conditions locally, and in this way avoids the exponential blow-up. We formulate LCBP as a variational optimization problem and derive a set of update equations that can be used to solve it. We show empirically that LCBP delivers results that are close to those obtained from CBP, while the computational cost scales favorably with problem size. 2015 Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (UAI) AUAI Press 296--305 Amsterdam probablistic inference, belief propagation, approximate inference, graphical models SFB-TRR-62 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Geier2015Lcbp.pdf Thomas Geier Felix Richter Susanne Biundo inproceedings GKKS14a 2015 Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) AAAI Press Description Logics, Query Answering, Semantic Web, SPARQL AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/GKKS15a.pdf Birte Glimm Yevgeny Kazakov Ilianna Kollia Giorgos Stamou inproceedings GKKS15b 2015 Proceedings of the 28th International Workshop on Description Logics (DL 2015) CEUR Workshop Proceedings Description Logics, Query Answering, Semantic Web, SPARQL AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/GKKS15a.pdf Birte Glimm Yevgeny Kazakov Ilianna Kollia Giorgos Stamou article UMGM15a 2015 10.1108/IJWIS-04-2015-0014 International Journal of Web Information Systems 11 291-326 3 AutomatedReasoning http://dx.doi.org/10.1108/IJWIS-04-2015-0014 Klaus Ulmschneider Bernd Michelberger Birte Glimm Bela Mutschler Manfred Reichert inproceedings Behnke2015Verification In classical planning it is easy to verify if a given sequence of actions is a solution to a planning problem. It has to be checked whether the actions are applicable in the given order and if a goal state is reached after executing them. In this paper we show that verifying whether a plan is a solution to an HTN planning problem is much harder. More specifically, we prove that this problem is NP-complete, even for very simple HTN planning problems. Furthermore, this problem remains NP-complete if an executable sequence of tasks is already provided. HTN-like hierarchical structures are commonly used to represent plan libraries in plan and goal recognition. By applying our result to plan and goal recognition we provide insight into its complexity. 2015 Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015) AAAI Press Ronen Brafman, Carmel Domshlak, Patrik Haslum, Shlomo Zilberstein 25-33 25th International Conference on Automated Planning and Scheduling Jerusalem SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Behnke15Verify_Talk.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Behnke2015HTNVerification.pdf Gregor Behnke Daniel ��ö������� Susanne Biundo inproceedings KPLT15a 2015 Proceedings of the ISWC 2015 Posters & Demonstrations Track 1486 CEUR-WS.org CEUR Workshop Proceedings Semantic Web AutomatedReasoning, SFB-TRR-62 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/KPLT15a.pdf Michael Kotzyba Denis Ponomaryov Thomas Low Marcus Thiel Andreas ��ü���Բ��������� article StGl15b 2015 10.1613/jair.4897 Journal of Artificial Intelligence Research 54 535--592 Reasoning, Description Logics, Optimisations, Optimizations SFB-TRR-62,AutomatedReasoning http://jair.org/media/4897/live-4897-9009-jair.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/StGl15b.pdf Andreas Steigmiller Birte Glimm inproceedings Hoernle15ArchitectureApproach This paper focuses on an approach of a reference architecture for a Companion-System (CS). It enhances a technical system by a user adaptive interaction and a situation adjustive behavior. To generate a reference architecture existing demonstration systems were analyzed and combined in order to find the essential system components. All aspects of the architecture of a CS will be considered in detail. It is finally enhanced by a system controller which enables a dynamic adaption to the current system state in order to allow future extensions of the architecture. 2015 Proc. of the Int. Symposium on Companion Technology (ISCT 2015) SFB-TRR-62 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Hoernle15Architecture.pdf Thilo ��ö���Ա��� Michael Tornow inproceedings Nothdurft2015InterplayDialogPlanning Technical systems evolve from simple dedicated task solvers to cooperative and competent assistants, helping the user with increasingly complex and demanding tasks. For this, they may proactively take over some of the users responsibilities and help to find or reach a solution for the user’s task at hand, using e.g., Artificial Intelligence (AI) Planning techniques. However, this intertwining of user-centered dialog and AI planning systems, often called mixed-initiative planning (MIP), does not only facilitate more intelligent and competent systems, but does also raise new questions related to the alignment of AI and human problem solving. In this paper, we describe our approach on integrating AI Planning techniques into a dialog system, explain reasons and effects of arising problems, and provide at the same time our solutions resulting in a coherent, userfriendly and efficient mixed-initiative system. Finally, we evaluate our MIP system and provide remarks on the use of explanations in MIP-related phenomena. 2015 Proceedings of the 16th Annual Meeting of the Special Interest Group on Discourse and Dialogue (SIGDIAL) Association for Computational Linguistics 344--353 Prague, Czech Republic SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Nothdurft15MIP.pdf Florian Nothdurft Gregor Behnke Pascal Bercher Susanne Biundo Wolfgang Minker inproceedings DBLP:conf/semweb/ParsiaMGGS15 2015 Proceedings of the 11th International Workshop on Scalable Semantic Web Knowledge Base Systems co-located with 14th International Semantic Web Conference (ISWC 2015) 1457 CEUR-WS.org CEUR Workshop Proceedings Thorsten Liebig and Achille Fokoue 2-15 Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/PMGG15a.pdf Bijan Parsia Nicolas Matentzoglu Rafael S. Goncalves Birte Glimm Andreas Steigmiller inproceedings Alford15TightHTNBounds Although HTN planning is in general undecidable, there are many syntactically identifiable sub-classes of HTN problems that can be decided. For these sub-classes, the decision procedures provide upper complexity bounds. Lower bounds were often not investigated in more detail, however. We generalize a propositional HTN formalization to one that is based upon a function-free first-order logic and provide tight upper and lower complexity results along three axes: whether variables are allowed in operator and method schemas, whether the initial task and methods must be totally ordered, and where recursion is allowed (arbitrary recursion, tail-recursion, and acyclic problems). Our findings have practical implications, both for the reuse of classical planning techniques for HTN planning, and for the design of efficient HTN algorithms 2015 Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015) AAAI Press 7--15 SFB-TRR-62,Planning https://www.youtube.com/watch?v=EFnsTzIVvUo http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Alford15TightHTNBounds.pdf Ron Alford Pascal Bercher David Aha inproceedings Alford15TightTIHTNBounds Hierarchical Task Network (HTN) planning with Task Insertion (TIHTN planning) is a formalism that hybridizes classical planning with HTN planning by allowing the insertion of operators from outside the method hierarchy. This additional capability has some practical benefits, such as allowing more flexibility for design choices of HTN models: the task hierarchy may be specified only partially, since ``missing required tasks'' may be inserted during planning rather than prior planning by means of the (predefined) HTN methods. While task insertion in a hierarchical planning setting has already been applied in practice, its theoretical properties have not been studied in detail, yet -- only \EXPSPACE{} membership is known so far. We lower that bound proving \NEXPTIME-completeness and further prove tight complexity bounds along two axes: whether variables are allowed in method and action schemas, and whether methods must be totally ordered. We also introduce a new planning technique called {\em acyclic progression}, which we use to define provably efficient TIHTN planning algorithms. 2015 Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2015) AAAI Press 1502--1508 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Alford15TightTIHTNBounds.pdf Ron Alford Pascal Bercher David Aha inproceedings Alford15TightTIHTNBoundsAbstract Hierarchical Task Network (HTN) planning with task insertion (TIHTN planning) is a variant of HTN planning. In HTN planning, the only means to alter task networks is to decompose compound tasks. In TIHTN planning, tasks may also be inserted directly. In this paper we provide tight complexity bounds for TIHTN planning along two axis: whether variables are allowed and whether methods must be totally ordered. 2015 Proceedings of the Eighth Annual Symposium on Combinatorial Search (SoCS) AAAI Press 221--222 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Alford15TightTIHTNBoundsAbstract.pdf Ron Alford Pascal Bercher David Aha inproceedings Bercher15UserCenteredDiscussion AI planning forms a core capability of intelligent systems. It enables goal directed behavior and allows systems to react adequately and flexibly to the current situation. Further, it allows systems to provide advice to a human user on how to reach his or her goals. Though the process of finding a plan is, by itself, a hard computational problem, some new challenges arise when involving a human user into the process. Plans have to be generated in a certain way, so that the user can be included into the plan generation process in case he or she wishes to; the plans should be presented to the user in an adequate way to prevent confusion or even rejection; to improve the trust in the system, it needs to be able to explain its behavior or presented plans. Here, we discuss these challenges and give pointers on how to solve them. 2015 Proceedings of the First International Symposium on Companion Technology (ISCT 2015) 79--82 First International Symposium on Companion Technology (ISCT 2015) Ulm, Germany SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Bercher15ISCTPoster.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/Bercher15UserCenteredDiscussion.pdf Pascal Bercher Daniel ��ö������� Gregor Behnke Susanne Biundo techreport Geier2014CBPTR Belief Propagation (BP) applied to cyclic problems is a well known approximate inference scheme for probabilistic graphical models. To improve its accuracy, Conditioned Belief Propagation (CBP) has been proposed, which splits a problem into subproblems by conditioning on variables, applies BP to subproblems, and merges the results to produce an answer to the original problem. In this work, we propose a reformulated version of CBP that exhibits anytime behavior and allows for more specific tuning by formalizing a further aspect of the algorithm through the use of a leaf selection heuristic. We propose several simple and easy to compute heuristics and demonstrate their performance using an empirical evaluation on randomly generated problems. 2014 8 Ulm University UIB 2014-03 SFB-TRR-62,KnowledgeModeling http://vts.uni-ulm.de/doc.asp?id=9201 http://vts.uni-ulm.de/docs/2014/9201/vts_9201_13795.pdf Thomas Geier Felix Richter Susanne Biundo article Glodek2014 The recognition of complex patterns is nowadays one of the most challenging tasks in machine learning, and it promises to be of great benefit for many applications, e.g. by allowing advanced human computer interaction to access the user’s situative context. This work examines a layered architecture that operates on different temporal granularities to infer complex patterns of user preferences. Classical hidden Markov models (HMM), conditioned HMM (CHMM) and fuzzy CHMM (FCHMM) are compared to find the best configuration in the lower architecture layers. In the uppermost layer, a Markov logic network (MLN) is applied to infer the user preference in a probabilistic rule-based manner. For each layer a comprehensive evaluation is given. We provide empirical evidence showing that the layered architecture using FCHMM and MLN is well-suited to recognize patterns on different layers. 2014 10.1016/j.bica.2014.06.003 Neural-Symbolic Networks for Cognitive Capacities SFB-TRR-62 http://www.sciencedirect.com/science/article/pii/S2212683X14000486 Michael Glodek Thomas Geier Susanne Biundo ��ü�Գٳ��� Palm inproceedings GKLT14a 2014 Proceedings of the 27th International Workshop on Description Logics (DL 2014) 1193 CEUR-WS.org CEUR Workshop Proceedings 180-195 Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning http://ceur-ws.org/Vol-1193/paper_6.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/GKLT14a.pdf Birte Glimm Yevgeny Kazakov Thorsten Liebig Trung-Kien Tran Vincent Vialard inproceedings GKLT14b 2014 10.1007/978-3-319-11915-1_12 Proceedings of the 13th International Semantic Web Conference (ISWC 2014) 8797 Springer-Verlag Lecture Notes in Computer Science 180-195 Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning http://link.springer.com/chapter/10.1007%2F978-3-319-11915-1_12 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/GKLT14b.pdf Birte Glimm Yevgeny Kazakov Thorsten Liebig Trung-Kien Tran Vincent Vialard inproceedings KazKli:2014:Tableau-CB:DL We present a non-deterministic consequence-based procedure for the description logic ALCHI. Just like the similar style (deterministic) procedures for EL and Horn-SHIQ, our procedure explicitly derives subsumptions between concepts, but due to non-deterministic rules, not all of these subsumptions are consequences of the ontology. Instead, the consequences are only those subsumptions that can be derived regardless of the choices made in the application of the rules. This is similar to tableau-based procedures, for which an ontology is inconsistent if every expansion of the tableau eventually results in a clash. We report on a preliminary experimental evaluation of the procedure using a version of SNOMED CT with disjunctions, which demonstrates some promising potential. 2014 DL 1193 CEUR-WS.org CEUR Workshop Proceedings Meghyn Bienvenu and Magdalena Ortiz and Riccardo Rosati and Mantas Simkus 579-590 KnowledgeModeling, ELK, LiveOntologies http://ceur-ws.org/Vol-1193/paper_10.pdf fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2015/KazKli15Advancing-ELK_DL.pdf Yevgeny Kazakov Pavel Klinov inproceedings honold2014b The properties of multimodality, individuality, adaptability, availability, cooperativeness and trustworthiness are at the focus of the investigation of Companion Systems. In this article, we describe the involved key components of such a system and the way they interact with each other. Along with the article comes a video, in which we demonstrate a fully functional prototypical implementation and explain the involved scientific contributions in a simplified manner. The realized technology considers the entire situation of the user and the environment in current and past states. The gained knowledge reflects the context of use and serves as basis for decision-making in the presented adaptive system. 2014 10.1109/IE.2014.60 10th International Conference on Intelligent Environments (IE 2014) IEEE 378--381 Adaptive HCI; AI Planning; Dialog Management; Interaction Management; Companion Technology SFB-TRR-62,Planning,KnowledgeModeling https://mirkwood.informatik.uni-ulm.de/sfbtrr62/companion-system.mp4 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Honold2014HomeTheaterVideo.pdf Frank Honold Pascal Bercher Felix Richter Florian Nothdurft Thomas Geier Roland Barth Thilo ��ö���Ա��� Felix ������ü������� Stephan Reuter Matthias Rau Gregor Bertrand Bastian Seegebarth Peter Kurzok Bernd Schattenberg Wolfgang Minker Michael Weber Susanne Biundo inproceedings Geier2014CBP Belief Propagation (BP) applied to cyclic problems is a well known approximate inference scheme for probabilistic graphical models. To improve the accuracy of BP, a divide-and-conquer approach termed Conditioned Belief Propagation (CBP) has been proposed in the literature. It recursively splits a problem by conditioning on variables, applies BP to subproblems, and merges the results to produce an answer to the original problem. In this essay, we propose a reformulated version of CBP that exhibits anytime behavior, and allows for more specific tuning by formalizing a further decision point that decides which subproblem is to be decomposed next. We propose some simple and easy to compute heuristics, and demonstrate their performance using an empirical evaluation on randomly generated problems. 2014 10.3233/978-1-61499-419-0-1011 Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014) 263 IOS Press

Amsterdam

Frontiers in Artificial Intelligence and Applications Schaub, Torsten and Friedrich, Gerhard and O'Sullivan, Barry 1011-1012 21st European Conference on Artificial Intelligence (ECAI 2014) Prague, Czech Republic SFB-TRR-62,KnowledgeModeling http://ebooks.iospress.nl/volumearticle/37095 Thomas Geier Felix Richter Susanne Biundo inproceedings StGL14a 2014 10.1007/978-3-319-08587-6_35 Proceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR 2014) 8562 Springer-Verlag Lecture Notes in Computer Science ����é��󲹲Ա� Demri, Deepak Kapur and Christoph Weidenbach 449-463 Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning http://link.springer.com/chapter/10.1007/978-3-319-08587-6_35# /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/StGL14a.pdf Andreas Steigmiller Birte Glimm Thorsten Liebig inproceedings Hoeller14PlanLinearization Planning models usually do not discriminate between different possible execution orders of the actions within a plan, as long as the sequence remains executable. As the formal planning problem is an abstraction of the real world, it can very well occur that one linearization is more favorable than the other for reasons not captured by the planning model --- in particular if actions are performed by a human. Post-hoc linearization of plans is thus a way to improve the quality of a plan enactment. The cost of this transformation decouples from the planning process, and it allows to incorporate knowledge that cannot be expressed within the limitations of a certain planning formalism. In this paper we discuss the idea of finding useful plan linearizations within the formalism of hybrid planning (although the basic ideas are applicable to a broader class of planning models). We propose three concrete models for plan linearization, discuss their ramifications using the application domain of automated user-assistance, and sketch out ways how to empirically validate the assumptions underlying these user-centric models. 2014 28th PuK Workshop "Planen, Scheduling und Konfigurieren, Entwerfen" (PuK 2014) Hybrid Planning, POCL Planning, HTN Planning, Plan Linearization, User-centered Planning, User Assistance, Plan Execution SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Hoeller14PlanLinearizationSlides.pdf http://www.puk-workshop.de/puk2014/prog.html http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Hoeller14PlanLinearization.pdf Daniel ��ö������� Pascal Bercher Felix Richter Marvin R. G. Schiller Thomas Geier Susanne Biundo inproceedings Kaz:Kli:2014:Tracing:DL EL is a family of tractable Description Logics (DLs) that is the basis of the OWL 2 EL profile. Unlike for many expressive DLs, reasoning in EL can be performed by computing a deductively-closed set of logical consequences of some specific form. In some ontology-based applications, e.g., for ontology debugging, knowing the logical consequences of the ontology axioms is often not sufficient. The user also needs to know from which axioms and how the consequences were derived. Although it is possible to keep track of all inferences applied during reasoning, this is usually not done in practice to avoid the overheads. In this paper, we present a goal-directed method that can generate inferences for selected consequences in the deductive closure without re-applying all rules from scratch. We provide an empirical evaluation demonstrating that the method is fast and economical for large EL ontologies. Although the main benefits are demon- strated for EL reasoning, the method can be easily extended to other procedures based on deductive closure computation using fixed sets of rules. 2014 DL 1193 CEUR-WS.org CEUR Workshop Proceedings Meghyn Bienvenu and Magdalena Ortiz and Riccardo Rosati and Mantas Simkus 221-232 KnowledgeModeling, ELK, LiveOntologies http://ceur-ws.org/Vol-1193/paper_26.pdf fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/KazKli14Tracing_DL.pdf Yevgeny Kazakov Pavel Klinov inproceedings KazKli:14:ELK:Tracing:ISWC EL is a family of tractable Description Logics (DLs) that is the basis of the OWL 2 EL profile. Unlike for many expressive DLs, reasoning in EL can be performed by computing a deductively-closed set of logical consequences of some specific form. In some ontology-based applications, e.g., for ontology debugging, knowing the logical consequences of the ontology axioms is often not sufficient. The user also needs to know from which axioms and how the consequences were derived. Although it is possible to record all inference steps during the application of rules, this is usually not done in practice to avoid the overheads. In this paper, we present a goal-directed method that can generate inferences for selected consequences in the deductive closure without re-applying all rules from scratch. We provide an empirical evaluation demonstrating that the method is fast and economical for large EL ontologies. Although the main benefits are demonstrated for EL reasoning, the method can be potentially applied to many other procedures based on deductive closure computation using fixed sets of rules. 2014 ISWC 8797 Springer Lecture Notes in Computer Science 196--211 KnowledgeModeling, ELK, LiveOntologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/KazKli14Tracing_ISWC.pdf Yevgeny Kazakov Pavel Klinov article GHMS14a 2014 10.1007/s10817-014-9305-1 Journal of Automated Reasoning (JAR) 53 245-269 3 Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning http://link.springer.com/article/10.1007%2Fs10817-014-9305-1 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/GHMS14a.pdf Birte Glimm Ian Horrocks Boris Motik Giorgos Stoilos Zhe Wang inproceedings Bercher14TDGHeuristics Hybrid Planning combines Hierarchical Task Network (HTN) planning with concepts known from Partial-Order Causal-Link (POCL) planning. We introduce novel heuristics for Hybrid Planning that estimate the number of necessary modifications to turn a partial plan into a solution. These estimates are based on the task decomposition graph that contains all decompositions of the abstract tasks in the planning domain. Our empirical evaluation shows that the proposed heuristics can significantly improve planning performance. 2014 Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014) AAAI Press 35--43 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Bercher14HybridHeuristicsSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Bercher14HybridHeuristics.pdf Pascal Bercher Shawn Keen Susanne Biundo inproceedings Pragst14CyberSecurity Hierarchical planning approaches are often pursued when it comes to a real-world application scenario, because they allow for incorporating additional expert knowledge into the domain. That knowledge can be used both for improving plan explanations and for reducing the explored search space. In case a non-hierarchical planning model is already available, for instance because a bottom-up modeling approach was used, one has to concern oneself with the question of how to introduce a hierarchy. This paper discusses the points to consider when adding a hierarchy to a non-hierarchical planning model using the example of the BAMS Cyber Security domain. 2014 28th PuK Workshop "Planen, Scheduling und Konfigurieren, Entwerfen" (PuK 2014) Hybrid Planning, Hierarchical Planning, POCL Planning, Domain Modeling, Task Hierarchy, Abstractions SFB-TRR-62,Planning,KnowledgeModeling http://www.puk-workshop.de/puk2014/prog.html http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Pragst14CyberSecurity.pdf Louisa Pragst Felix Richter Pascal Bercher Bernd Schattenberg Susanne Biundo article StLG14a 2014 Journal of Web Semantics: Science, Services and Agents on the World Wide Web 27 1 Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning http://www.websemanticsjournal.org/index.php/ps/article/view/366/388 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/StLG14a.pdf Andreas Steigmiller Thorsten Liebig Birte Glimm inproceedings Hoeller2014HTNLanguage Theoretical results on HTN planning are mostly related to the plan existence problem. In this paper, we study the structure of the generated plans in terms of the language they produce. We show that such languages are always context-sensitive. Furthermore we identify certain subclasses of HTN planning problems which generate either regular or context-free languages. Most importantly we have discovered that HTN planning problems, where preconditions and effects are omitted, constitute a new class of languages that lies strictly between the context-free and context-sensitive languages. 2014 10.3233/978-1-61499-419-0-447 Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014) 263 IOS Press

Amsterdam

Frontiers in Artificial Intelligence and Applications Schaub, Torsten and Friedrich, Gerhard and O'Sullivan, Barry 447-452 21st European Conference on Artificial Intelligence (ECAI 2014) Prague, Czech Republic SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Hoeller2014HtnLanguages.pdf Daniel ��ö������� Gregor Behnke Pascal Bercher Susanne Biundo inproceedings MUGM14a 2014 Proceedings of the 16th International Conference on Information Integration and Web-Based Applications & Services (iiWAS 2014) ACM ACM International Conference Proceedings Semantic Networks AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/MUGM14a.pdf Bernd Michelberger Klaus Ulmschneider Birte Glimm Bela Mutschler Manfred Reichert inproceedings StGL14b 2014 Proceedings of the 27th International Workshop on Description Logics (DL 2014) 1193 CEUR-WS.org CEUR Workshop Proceedings Meghyn Bienvenu, Magdalena Ortiz, Riccardo Rosati, and Mantas Simkus Reasoning, Description Logics, Optimisations, Optimizations AutomatedReasoning http://ceur-ws.org/Vol-1193/paper_49.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/StGL14b.pdf Andreas Steigmiller Birte Glimm Thorsten Liebig inproceedings Bercher14HybridPlanningApplication In various social, work-related, or educational contexts, an increasing demand for intelligent assistance systems can be observed. In this paper, we present a domain-independent approach that combines a number of planning and interaction components to realize advanced user assistance. Based on a hybrid planning formalism, the components provide facilities including the generation, execution, and repair as well as the presentation and explanation of plans. We demonstrate the feasibility of our approach by means of a system that aims to assist users in the assembly of their home theater. An empirical evaluation shows the benefit of such a supportive system, in particular for persons with a lack of domain expertise. 2014 Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014) AAAI Press 386--394 SFB-TRR-62,Planning,KnowledgeModeling http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Bercher14PlanRepairExecuteExplainSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/movie.zip http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Bercher14PlanRepairExecuteExplain.pdf The domain can be downloaded from http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Bercher14PlanRepairExecuteExplain.zip Pascal Bercher Susanne Biundo Thomas Geier Thilo Hoernle Florian Nothdurft Felix Richter Bernd Schattenberg inproceedings Nothdurft2014ProbabilisticExplanation 2014 Proceedings of the 10th International Conference on Intelligent Environments (IE), 2014 IEEE 392 - 395 SFB-TRR-62, Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/Nothdurft2014ProbabilisticExplanation.pdf Florian Nothdurft Felix Richter Wolfgang Minker inproceedings Nothdurft2014HCT Human-computer trust has shown to be a critical factor in influencing the complexity and frequency of interaction in technical systems. Particularly incomprehensible situations in human-computer interaction may lead to a reduced users trust in the system and by that influence the style of interaction. Analogous to human-human interaction, explaining these situations can help to remedy negative effects. In this paper we present our approach of augmenting task-oriented dialogs with selected explanation dialogs to foster the human-computer trust relationship in those kinds of situations. We have conducted a web-based study testing the effects of different goals of explanations on the components of human-computer trust. Subsequently, we show how these results can be used in our probabilistic trust handling architecture to augment pre-defined task-oriented dialogs. 2014 Proceedings of the 15th Annual Meeting of the Special Interest Group on Discourse and Dialogue (SIGDIAL) Association for Computational Linguistics 51--59 SFB-TRR-62, Planning http://www.aclweb.org/anthology/W/W14/W14-4307.pdf Florian Nothdurft Felix Richter Wolfgang Minker article StGL14c Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisation of absorption as well as the standard tableau calculus to directly handle the (absorbed) nominal schema axioms. We implement the resulting extension of standard tableau calculi in a novel reasoning system and we integrate further optimisations. In our empirical evaluation, we show the effect of these optimisations and we find that the proposed approach performs well even when compared to other DL reasoners with dedicated rule support. 2014 10.1007/s10817-014-9310-4 Journal of Automated Reasoning 53 Springer-Verlag 351-405 4 Nominal Schema, Reasoning, Description Logics, Tableau, Optimisations, Optimizations AutomatedReasoning http://link.springer.com/article/10.1007/s10817-014-9310-4 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/StGL14c.pdf Andreas Steigmiller Birte Glimm Thorsten Liebig article KazKroSim:14:ELK:JAR EL is a simple tractable Description Logic that features conjunctions and existential restrictions. Due to its favorable computational properties and relevance to existing ontologies, EL has become the language of choice for terminological reasoning in biomedical applications, and has formed the basis of the OWL EL profile of the Web ontology language OWL. This paper describes ELK - a high performance reasoner for OWL EL ontologies - and details various aspects from theory to implementation that make ELK one of the most competitive reasoning systems for EL ontologies available today. 2014 10.1007/s10817-013-9296-3 JAR 53 1-61 1 KnowledgeModeling, ELK, LiveOntologies /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2014/KazKroSim13ELK_JAR.pdf Yevgeny Kazakov Markus ����ö�ٳ������� ������Գپ�š��� ����������čí�� article KoGl13a The SPARQL query language is currently being extended by the World Wide Web Consortium (W3C) with so-called entailment regimes. An entailment regime defines how queries are evaluated under more expressive semantics than SPARQL's standard simple entailment, which is based on sub-graph matching. The queries are very expressive since variables can occur within complex class expressions and can also bind to class or property names.In this paper, we describe a sound and complete algorithm for the OWL Direct Semantics entailment regime. We further propose several novel optimizations such as strategies for determining a good query execution order, query rewriting techniques, and show how specialized OWL reasoning tasks and the class and property hierarchy can be used to reduce the query execution time. For determining a good execution order, we propose a cost-based model, where the costs are based on information about the instances of classes and properties that are extracted from a model abstraction built by an OWL reasoner. We present two ordering strategies: a static and a dynamic one. For the dynamic case, we improve the performance by exploiting an individual clustering approach that allows for computing the cost functions based on one individual sample from a cluster.We provide a prototypical implementation and evaluate the efficiency of the proposed optimizations. Our experimental study shows that the static ordering usually outperforms the dynamic one when accurate statistics are available. This changes, however, when the statistics are less accurate, e.g., due to non-deterministic reasoning decisions. For queries that go beyond conjunctive instance queries we observe an improvement of up to three orders of magnitude due to the proposed optimizations. 2013 9 10.1613/jair.3872 Journal of Artificial Intelligence Research (JAIR) 48 253-303 Reasoning, Description Logics, Optimisations, Optimizations SFB-TRR-62,AutomatedReasoning https://www.jair.org/media/3872/live-3872-7402-jair.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/KoGl13a.pdf Ilianna Kollia Birte Glimm inproceedings ConcDefinability 2013 Proceedings of the 26th International Workshop on Description Logics (DL 2013) CEUR Workshop Proceedings AutomatedReasoning http://persons.iis.nsk.su/files/persons/pages/conceptinterpolation.pdf Denis Ponomaryov Dmitry Vlasov inproceedings Bercher13EncodingPlans We propose a technique that allows any planning system that searches in the space of partial plans to make use of heuristics from the literature which are based on search in the space of states. The technique uses a problem encoding that reduces the problem of finding a heuristic value for a partial plan to finding a heuristic value for a state: It encodes a partial plan into a new planning problem, s.t. solutions for the new problem correspond to solutions reachable from the partial plan. Evaluating the goal distance of the partial plan then corresponds to evaluating the goal distance of the initial state in the new planning problem. 2013 Proceedings of the 4th Workshop on Knowledge Engineering for Planning and Scheduling (KEPS 2013) at ICAPS 2013 11--15 SFB-TRR-62,Planning,KnowledgeModeling http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/Bercher13EncodingPlansSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/Bercher13EncodingPlans.pdf Pascal Bercher Susanne Biundo inproceedings Kaz:Kli:2013:Android:ORE This paper presents results of a preliminary evaluation of the OWL EL reasoner ELK running on a Google Nexus 4 cell phone under Android 4.2 OS. The results show that economic and well-engineered ontology reasoners can demonstrate acceptable performance when classifying ontologies with thousands of axioms and take advantage of multi-core CPUs of modern mobile devices. The paper emphasizes the engineering aspects of ELK's design and implementation which make this performance possible. 2013 ORE 1015 CEUR-WS.org CEUR Workshop Proceedings 68-74 KnowledgeModeling, ELK, LiveOntologies http://ceur-ws.org/Vol-1015/paper_9.pdf fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/KazKli13Android_ORE.pdf Yevgeny Kazakov Pavel Klinov inproceedings StGL13b Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisation of absorption \hlas well as the standard tableau calculus to directly handle the (absorbed) nominal schema axioms. We implement the resulting extension of standard tableau calculi in a novel reasoning system and we integrate further optimisations. In our empirical evaluation, we show the effect of these optimisations and we find that the proposed approach performs well even when compared to other DL reasoners with dedicated rule support. 2013 Proceedings of the 26th International Description Logic Workshop (DL 2013) CEUR Workshop Proceedings Nominal Schema, Reasoning, Description Logics, Tableau, Optimisations, Optimizations AutomatedReasoning http://ceur-ws.org/Vol-1014/paper_20.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/StGL13b.pdf Andreas Steigmiller Birte Glimm Thorsten Liebig inproceedings KazKli:13:Incremental:DL We describe a method for updating the classification of ontologies expressed in the EL family of Description Logics after some axioms have been added or deleted. While incremental classification modulo additions is relatively straightforward, handling deletions is more problematic since it requires retracting logical consequences that no longer hold. Known algorithms address this problem using various forms of bookkeeping to trace the consequences back to premises. But such additional data can consume memory and place an extra burden on the reasoner during application of inferences. In this paper, we present a technique, which avoids this extra cost while being still very efficient for small incremental changes in ontologies. 2013 DL 1014 CEUR-WS.org CEUR Workshop Proceedings 294-315 KnowledgeModeling, ELK, LiveOntologies http://ceur-ws.org/Vol-1014/paper_33.pdf fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/KazKli13Incremental_DL.pdf Yevgeny Kazakov Pavel Klinov inproceedings KazKli:13:ELK:Incremental:ISWC We describe a method for updating the classification of ontologies expressed in the EL family of Description Logics after some axioms have been added or deleted. While incremental classification modulo additions is relatively straightforward, handling deletions is more problematic since it requires retracting logical consequences that are no longer valid. Known algorithms address this problem using various forms of bookkeeping to trace the consequences back to premises. But such additional data can consume memory and place an extra burden on the reasoner during application of inferences. In this paper, we present a technique, which avoids this extra cost while being very efficient for small incremental changes in ontologies. The technique is freely available as a part of the open-source EL reasoner ELK and its efficiency is demonstrated on naturally occurring and synthetic data. 2013 10.1007/978-3-642-41335-3_15 ISWC 8218 Springer Lecture Notes in Computer Science 232-247 KnowledgeModeling, ELK, LiveOntologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/KazKli13Incremental_ISWC.pdf Yevgeny Kazakov Pavel Klinov inproceedings CTSG13a 2013 Proceedings of the International Workshop on Big Web Data (BigWebData 2013) Springer Lecture Notes in Computer Science Axel Tenschert and Alexey Cheptsov Big Data, Text Mining, Ontologies AutomatedReasoning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/CTSG13a.pdf Alexey Cheptsov Axel Tenschert Paul Schmidt Birte Glimm Mauricio Matthesius Thorsten Liebig inproceedings StGL13a Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisation of absorption as well as the standard tableau calculus to directly handle the (absorbed) nominal schema axioms. We implement the resulting extension of standard tableau calculi in a novel reasoning system and we integrate further optimisations. In our empirical evaluation, we show the effect of these optimisations and we find that the proposed approach performs well even when compared to other DL reasoners with dedicated rule support. 2013 Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013) AAAI Press/The MIT Press Nominal Schema, Reasoning, Description Logics, Tableau, Optimisations, Optimizations AutomatedReasoning http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6629 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/StGL13a.pdf Andreas Steigmiller Birte Glimm Thorsten Liebig inproceedings Bercher13SampleFF We prove a new complexity result for Partial-Order Causal-Link (POCL) planning, in which we study the hardness of refining a search node (i.e., a partial plan) to a valid solution given a delete effect-free domain model. While the corresponding decision problem is known to be polynomial in state-based search (where search nodes are states), it turns out to be intractable in the POCL setting. Since both the currently best-informed heuristics for POCL planning are based on delete relaxation, we hope that our result sheds some new light on the problem of designing heuristics for POCL planning. Based on this result, we developed a new variant of one of these heuristics which incorporates more information of the current partial plan. We evaluate our heuristic on several domains of the early International Planning Competitions and compare it with other POCL heuristics from the literature. 2013 Proceedings of the 2013 IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI 2013) IEEE Computer Society 674--681 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/Bercher13SampleFFSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/Bercher13SampleFF.pdf Pascal Bercher Thomas Geier Felix Richter Susanne Biundo proceedings EGKK13a 2013 Proceedings of the 2013 International Description Logic Workshop (DL 2013) 1014 CEUR-WS.org CEUR Workshop Proceedings Eiter, Thomas and Glimm, Birte and Kazakov, Yevgeny and ����ö�ٳ�������, Markus Description Logics AutomatedReasoning inproceedings ProgrDecompSC 2013 AAAI, The Twenty-Seventh Conference on Artificial Intelligence AutomatedReasoning http://persons.iis.nsk.su/files/persons/pages/decprog-short.pdf Denis Ponomaryov Mikhail Soutchanski inproceedings Glodek2013LayeredLogic Only few cognitive architectures have been proposed that cover the complete range from recognizers working on the direct sensor input, to logical inference mechanisms of classical artificial intelligence (AI). Logical systems operate on abstract predicates, which are often related to an action-like state transition, especially when compared to the classes recognized by pattern recognition approaches. On the other hand, pattern recognition is often limited to static patterns, and temporal and multi-modal aspects of a class are often not regarded, e.g. by testing only on pre-segmented data. Recent trends in AI aim at developing applications and methods that are motivated by data-driven real world scenarios, while the field of pattern recognition attempts to push forward the boundary of pattern complexity. We propose a new generic architecture to close the gap between AI and pattern recognition approaches. In order to detect abstract complex patterns, we process sequential data in layers. On each layer, a set of elementary classes is recognized and the outcome of the classification is passed to the successive layer such that the time granularity increases. Layers can combine modalities, additional symbolic information or make use of reasoning algorithms. We evaluated our approach in an on-line scenario of activity recognition using three layers. The obtained results show that the combination of concepts from pattern recognition and high-level symbolic information leads to a prosperous and powerful symbiosis. 2013 10.1109/ICTAI.2013.101 Proceedings of the 2013 IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI 2013) 648-653 Conditioned hidden Markov model;Layered architecture;Markov logic network SFB-TRR-62 http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6735312 Michael Glodek Thomas Geier Susanne Biundo Friedhelm Schwenker ��ü�Գٳ��� Palm inproceedings Bercher13POCLPreferences This paper studies how to solve classical planning problems with preferences by means of a partial-order causal-link (POCL) planning algorithm. Preferences are given by soft goals -- optional goals which increase a plan's benefit if satisfied at the end of a plan. Thus, we aim at finding a plan with the best \textitnet-benefit, which is the difference of the achieved preferences' benefit minus the cost of all actions in the plan that achieves them. While many approaches compile soft goals away, we study how they can be addressed natively by a POCL planning system. We propose novel search and flaw selection strategies for that problem class and evaluate them empirically. 2013 27th PuK Workshop "Planen, Scheduling und Konfigurieren, Entwerfen" (PuK 2013) 29--40 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/Bercher13POCLPreferencesSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/Bercher13POCLPreferences.pdf Pascal Bercher Fabian Ginter Susanne Biundo inproceedings CGHM13a The EMA (Energy Management Adviser) aims to produce personalised energy saving advice for EDF’s customers. The advice takes the form of one or more ``tips", and personalisation is achieved using semantic technologies: customers are described using RDF, an OWL ontology provides a conceptual model of the relevant domain (housing, environment, and so on) and the different kinds of tips, and SPARQL query answering is used to identify relevant tips. The current prototype provides tips to more than 300,000 EDF customers in France at least twice a year. The main challenges for our future work include providing a timely service for all of the 35 million EDF customers in France, simplifying the system's maintenance, and providing new ways for interacting with customers such as via a Web site. 2013 10.1007/978-3-642-41338-4_4 Proceedings of the 12th International Semantic Web Conference (ISWC 2013) 8219 Springer-Verlag Lecture Notes in Computer Science 49-64 OWL, Description Logics, Explanations, Justifications AutomatedReasoning http://link.springer.com/chapter/10.1007%2F978-3-642-41338-4_4 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/CGHM13a.pdf Pierre Chaussecourte Birte Glimm Ian Horrocks Boris Motik Laurent Pierre inproceedings SG13 Automated reasoning in OWL is capable of inferences that are nontrivial for people to understand. We argue that the understanding of inferences would benefit from stepwise explanations. To build a system that supports such explicative inference, we propose a framework based on inference rules and proof tactics for OWL ontologies. In particular, the goal is to present inferences in a suitable and adaptable way to human users, and to predict whether certain inferences are harder to understand than others. This article outlines the conception of this framework and its benefits whose implementation is currently work in progress. 2013 Proceedings of the 2013 International Description Logic Workshop (DL 2013) CEUR Workshop Proceedings OWL, Description Logics, Explanations, Justifications AutomatedReasoning http://ceur-ws.org/Vol-1014/paper_36.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/ScGl13a.pdf Marvin R. G. Schiller Birte Glimm inproceedings Bercher13POCLHeuristics We present a technique which allows partial-order causal-link (POCL) planning systems to use heuristics known from state-based planning to guide their search. The technique encodes a given partially ordered partial plan as a new classical planning problem that yields the same set of solutions reachable from the given partial plan. As heuristic estimate of the given partial plan a state-based heuristic can be used estimating the goal distance of the initial state in the encoded problem. This technique also provides the first admissible heuristics for POCL planning, simply by using admissible heuristics from state-based planning. To show the potential of our technique, we conducted experiments where we compared two of the currently strongest heuristics from state-based planning with two of the currently best-informed heuristics from POCL planning. 2013 Advances in Artificial Intelligence, Proceedings of the 36th German Conference on Artificial Intelligence (KI 2013) Springer 1--12 SFB-TRR-62,Planning,KnowledgeModeling http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/Bercher13POCLHeuristicsSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/Bercher13POCLHeuristics.pdf Pascal Bercher Thomas Geier Susanne Biundo inproceedings GKKS13a We present an approach for using schema knowledge from the TBox to optimize the evaluation of SPARQL queries. The queries are evaluated over an OWL ontology using the OWL Direct Semantics entailment regime. For conjunctive instance queries, we proceed by transforming the query into an ABox. We then show how the TBox and this (small) query ABox can be used to build a maximal equivalent query where the additional query atoms can be used for reducing the set of possible mappings for query variables. We also consider arbitrary SPARQL queries and show how the concept and role hierarchies can be used to prune the search space of possible answers based on the polarity of variable occurrences in the query. We provide a prototypical implementation and evaluate the efficiency of the proposed optimizations. Our experimental study shows that the use of the proposed optimizations leads to a significant improvement in the execution times of many queries. 2013 Proceedings of the 2013 International Description Logic Workshop (DL 2013) CEUR Workshop Proceedings SPARQL, OWL, Description Logics, Query Answering, Optimisations, Optimizations AutomatedReasoning http://ceur-ws.org/Vol-1014/paper_80.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2013/GKKS13a.pdf Birte Glimm Yevgeny Kazakov Ilianna Kollia Giorgos Stamou inproceedings KoGl12b The paper presents an approach for cost-based query planning for SPARQL queries issued over an OWL ontology using the OWL Direct Semantics entailment regime of SPARQL 1.1. The costs are based on information about the instances of classes and properties that are extracted from a model abstraction built by an OWL reasoner. A static and a dynamic algorithm are presented which use these costs to find optimal or near optimal execution orders for the atoms of a query. For the dynamic case, we exploit an individual clustering approach and compute the cost functions based only on at most one individual (sample) from each of the used clusters. We provide an experimental study which shows that, for queries for which accurate estimates are available from the beginning, the static usually outperforms the dynamic algorithm. However, when queries are issued over ontologies with disjunctive information and contain many atoms for which no accurate statistics can be extracted a-priori, then dynamic ordering is more promising. The use of cluster based sampling techniques leads to a performance improvement for queries with large intermediate result sizes. 2012 11 10.1007/978-3-642-35176-1_15 Proceedings of the 11th International Semantic Web Conference (ISWC 2012) 7649 Springer-Verlag Lecture Notes in Computer Science 231-246 Reasoning, Description Logics, Optimisations, Optimizations SFB-TRR-62,AutomatedReasoning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/KoGl12b.pdf Ilianna Kollia Birte Glimm inproceedings NiGl12a In this paper, we consider the task of knowledge base extraction with its three conflicting requirements: the size of the extracted knowledge base, the size of the corresponding signature and the syntactic similarity of the extracted knowledge base with the originally given one. We demonstrate that, both, minimal module extraction and uniform interpolation, assign an absolute priority to one of these requirements, thereby limiting the possibilities to influence the other two. To account for scenarios, in which such an extreme prioritization is not necessary, we investigate the task of knowledge base extraction for EL based on two alternative, less restrictive notions of syntactic similarity with the second highest priority given to the knowledge base size. Moreover, to address scenarios, where computation time is important, we propose a tractable rewriting approach based on the chosen prioritization of requirements and empirically compare this novel technique with the existing implemented approaches with encouraging results. 2012 11 10.1007/978-3-642-35176-1_25 Proceedings of the 11th International Semantic Web Conference (ISWC 2012) 7649 Springer-Verlag Lecture Notes in Computer Science 394-409 Reasoning, Description Logics, Optimisations, Optimizations, Modularisation, Modularization, Uniform Interpolation AutomatedReasoning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/NiGl12a.pdf Nadeschda Nikitina Birte Glimm inproceedings Mueller2012HPOMDPs Decision support in real-world applications is often challenging because one has to deal with large and only partially observable domains. In case of full observability, large domains are successfully tackled by making use of expert knowledge and employing methods like Hierarchical Task Network (HTN) planning. In this paper, we present an approach that transfers the advantages of HTN planning to partially observable domains. Experimental results for two implemented algorithms, UCT and A* search, show that our approach significantly speeds up the generation of high-quality policies: the policies generated by our approach consistently outperform policies generated by Symbolic Perseus and can be computed in less than 10% of its runtime on average. 2012 8 Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012) IOS Press 606--611 SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Mueller12HierarchicalFSCsReloadedSlides.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Mueller12HierarchicalFSCsReloaded.pdf Felix ��ü������� Christian ����ä�ٳ� Thomas Geier Susanne Biundo inproceedings Geier2012PersonTracking This work addresses the problem of person tracking using additional background information. We augment a particle filter-based tracking algorithm with a first-order probabilistic model expressed through Markov Logic Networks to tackle the data association problem in domains with a high occlusion rate. Using a high-level model description allows us to easily integrate additional information like a floor plan or goal information into a joint model and resolve occlusion situations that would otherwise result in the loss of association. We discuss the engineered model in detail and give an empirical evaluation using an indoor setting. 2012 8 Proceedings of the Ninth UAI Bayesian Modeling Applications Workshop (UAI-AW 2012) SFB-TRR-62, KnowledgeModeling http://ceur-ws.org/Vol-962 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Geier12TrackingGoals.pdf Thomas Geier Stephan Reuter Klaus Dietmayer Susanne Biundo article GHMS11a Ontology classification - the computation of the subsumption hierarchies for classes and properties - is a core reasoning service provided by all OWL reasoners known to us. A popular algorithm for computing the class hierarchy is the so-called Enhanced Traversal (ET) algorithm. In this paper we present a new classification algorithm that attempts to address certain shortcomings of ET and improve its performance. Apart from classification of classes, we also consider object and data property classification. Using several simple examples, we show that the algorithms commonly used to implement these tasks are incomplete even for relatively weak ontology languages. Furthermore, we show that property classification problems can be reduced to class classification problems, which allows us to classify properties using our optimised algorithm. We implemented all our algorithms in the OWL reasoner HermiT. The results of our performance evaluation show significant performance improvements on several well-known ontologies. 2012 7 1570-8268 10.1016/j.websem.2011.12.007 Journal of Web Semantics: Science, Services and Agents on the World Wide Web 14 Elsevier Science Publishers (North-Holland)

Amsterdam

84-101 Ontologies, OWL, Class Classification, Property Classification, Optimizations SFB-TRR-62,AutomatedReasoning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/GHMS12a.pdf Special Issue on Dealing with the Messiness of the Web of Data Birte Glimm Ian Horrocks Boris Motik Rob Shearer Giorgos Stoilos inproceedings Elkawkagy12LandmarkStrategies Hierarchical landmarks can be extracted and used to reduce hierarchical domain models, thereby leading to substantial runtime improvements. In this work, we present novel domain-independent planning strategies based on these landmarks. Our empirical evaluation on four benchmark domains shows that these landmark-aware strategies outperform established search strategies in many cases, even for reduced domain models. 2012 7 Proceedings of the 26th AAAI Conference on Artificial Intelligence ({AAAI} 2012) AAAI Press 1763--1769 SFB-TRR-62,Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Elkawkagy12LandmarkStrategiesPoster.pdf /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Elkawkagy12LandmarkStrategies.pdf Mohamed Elkawkagy Pascal Bercher Bernd Schattenberg Susanne Biundo inproceedings Seegebarth12Explanation Human users who execute an automatically generated plan want to understand the rationale behind it. Knowledge-rich plans are particularly suitable for this purpose, because they provide the means to give reason for causal, temporal, and hierarchical relationships between actions. Based on this information, focused arguments can be generated that constitute explanations on an appropriate level of abstraction. In this paper, we present a formal approach to plan explanation. Information about plans is represented as first-order logic formulae and explanations are constructed as proofs in the resulting axiomatic system. With that, plan explanations are provably correct w.r.t. the planning system that produced the plan. A prototype plan explanation system implements our approach and first experiments give evidence that finding plan explanations is feasible in real-time. 2012 6 27 Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012) AAAI Press 225--233 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Seegebarth12PlanExplanationSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Seegebarth12PlanExplanation.pdf Bastian Seegebarth Felix ��ü������� Bernd Schattenberg Susanne Biundo inproceedings KoGl12a The paper presents an approach for cost-based query planning for SPARQL queries issued over an OWL ontology using OWL's Direct Semantics. The costs are based on information about the instances of classes and properties that are extracted from a model abstraction built by an OWL reasoner. A static and a dynamic algorithm are presented which use these costs to find optimal or near optimal execution orders for the atoms of a query. For the dynamic case, we exploit an individual clustering approach and compute the cost functions based only on at most one individual (sample) from each of the used clusters. We provide an experimental study which shows that, for queries for which accurate estimates are available from the beginning, the static usually outperforms the dynamic algorithm. However, when queries are issued over ontologies with disjunctive information and contain many atoms for which no accurate statistics can be extracted a-priori, then dynamic ordering is more promising. The use of cluster based sampling techniques leads to a performance improvement for queries with huge intermediate result sizes. 2012 6 Proceedings of the 25th International Description Logic Workshop (DL 2012) 846 CEUR Workshop Proceedings Reasoning, Description Logics, Tableau, Optimisations, Optimizations SFB-TRR-62,AutomatedReasoning http://ceur-ws.org/Vol-846/paper_40.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/KoGl12a.pdf Ilianna Kollia Birte Glimm inproceedings StLG12b With this contribution we push the boundary of some known optimisations such as caching to the very expressive Description Logic SROIQ.The developed method is based on a sophisticated dependency management and a precise unsatisfiability caching technique, which further enables better informed tableau backtracking and more efficient pruning. We empirically evaluate the proposed optimisation within the novel reasoning system Konclude and show that the proposed optimisations indeed result in significant performance improvements. 2012 6 Proceedings of the 25th International Description Logic Workshop (DL 2012) 846 CEUR Workshop Proceedings Reasoning, Description Logics, Tableau, Optimisations, Optimizations AutomatedReasoning http://ceur-ws.org/Vol-846/paper_36.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/StLG12b.pdf Andreas Steigmiller Thorsten Liebig Birte Glimm inproceedings StLG12a With this contribution we push the boundary of some known optimisations such as caching to the very expressive Description Logic SROIQ.The developed method is based on a sophisticated dependency management and a precise unsatisfiability caching technique, which further enables better informed tableau backtracking and more efficient pruning. Additionally, we optimise the handling of cardinality restrictions, by introducing a strategy called pool-based merging. We empirically evaluate the proposed optimisations within the novel reasoning system Konclude and show that the proposed optimisations indeed result in significant performance improvements. 2012 6 10.1007/978-3-642-31365-3_40 Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR 2012) 7364 Lecture Notes in Computer Science 514-529 Reasoning, Description Logics, Tableau, Optimisations, Optimizations AutomatedReasoning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/StLG12a.pdf Andreas Steigmiller Thorsten Liebig Birte Glimm inproceedings Bercher12PreferenceHeuristic In this paper, we introduce an admissible heuristic for hybrid planning with preferences. Hybrid planning is the fusion of hierarchical task network (HTN) planning with partial order causal link (POCL) planning. We consider preferences to be soft goals - facts one would like to see satisfied in a goal state, but which do not have to hold necessarily. Our heuristic estimates the best quality of any solution that can be developed from the current plan under consideration. It can thus be used by any branch-and-bound algorithm that performs search in the space of plans to prune suboptimal plans from the search space. 2012 5 Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2012) AAAI Press 120--123 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Bercher12PreferenceHeuristicPoster.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Bercher12PreferenceHeuristic.pdf Pascal Bercher Susanne Biundo proceedings GHKP12a 2012 4 16 937 CEUR Workshop Proceedings Proceedings of the 5th Linked Data on the Web Workshop (LDOW2012) Ontologies, OWL, Linked Data, Semantic Web AutomatedReasoning http://ceur-ws.org/Vol-937/ldow2012-paper-16.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/GHKP12a.pdf Birte Glimm Aidan Hogan Markus ����ö�ٳ������� Axel Polleres article NiRG11c When ontological knowledge is acquired automatically, quality control is essential. Which part of the automatically acquired knowledge is appropriate for an application often depends on the context in which the knowledge base or ontology is used. In order to determine relevant and irrelevant or even wrong knowledge, we support the tightest possible quality assurance approach - an exhaustive manual inspection of the acquired data. By using automated reasoning, this process can be partially automatized: after each expert decision, axioms that are entailed by the already confirmed statements are automatically approved, whereas axioms that would lead to an inconsistency are declined. Starting from this consideration, this paper provides theoretical foundations, heuristics, optimization strategies and comprehensive experimental results for our approach to efficient reasoning-supported interactive ontology revision. We introduce and elaborate on the notions of revision states and revision closure as formal foundations of our method. Additionally, we propose a notion of axiom impact which is used to determine a beneficial order of axiom evaluation in order to further increase the effectiveness of ontology revision. The initial notion of impact is then further refined to take different validity ratios - the proportion of valid statements within a dataset - into account. Since the validity ratio is generally not known a priori - we show how one can work with an estimate that is continuously improved over the course of the inspection process.Finally, we develop the notion of decision spaces, which are structures for calculating and updating the revision closure and axiom impact. We optimize the computation performance further by employing partitioning techniques and provide an implementation supporting these optimizations as well as featuring a user front-end. Our evaluation shows that our ranking functions almost achieve the maximum possible automatization and that the computation time needed for each reasoning-based, automatic decision takes less than one second on average for our test dataset of over 25,000 statements. 2012 4 1570-8268 10.1016/j.websem.2011.12.002 Journal of Web Semantics: Science, Services and Agents on the World Wide Web 12-13 Elsevier Science Publishers (North-Holland), Amsterdam 118-130 Ontologies, Knowledge Representation, Automated Reasoning, Quality Assurance, OWL SFB-TRR-62,AutomatedReasoning http://www.sciencedirect.com/science/article/pii/S1570826811001028 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/NiRG12a.pdf Special Issue on Reasoning with Context in the Semantic Web Nadeschda Nikitina Sebastian Rudolph Birte Glimm inproceedings Schattenberg12Mice Reinforcement learning models can explain various aspects of two-way avoidance learning but do not provide a rationale for the relationship found between the dynamics of initial learning and those of reversal learning. Artificial Intelligence planning offers a novel way to conceptualize the learners’ cognitive processes by providing an explicit representation of and reasoning about internal processing stages. Our hybrid planning and plan repair approach demonstrates that the empirically found relationships could be motivated from a consistent theoretical framework. 2012 2 Proceedings of the 7th Vienna International Conference on Mathematical Modelling (MATHMOD 2012)

Vienna, Austria

SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Schattenberg12PlanningModels.pdf Bernd Schattenberg Andreas L. Schulz ���Ի��é Brechmann Frank W. Ohl Susanne Biundo inproceedings Wendemuth2012CompanionTechnology The Transregional Collaborative Research Centre SFB/TRR 62 "A Companion Technology for Cognitive Technical Systems", funded by the German Research Foundation (DFG) at Ulm and Magdeburg sites, deals with the systematic and interdisciplinary study of cognitive abilities and their implementation in technical systems. The properties of multimodality, individuality, adaptability, availability, cooperativeness and trustworthiness are at the focus of the investigation. These characteristics show a new type of interactive device which is not only practical and efficient to operate, but as well agreeable, hence the term ”companion”. The realisation of such a technology is supported by technical advancement as well as by neurobiological findings. Companion technology has to consider the entire situation of the user, machine, environment and (if applicable) other people or third interacting parties, in current and historical states. This will reflect the mental state of the user, his embeddedness in the task, and how he is situated in the current process. 2012 10.1007/978-3-642-34584-5_7 Cognitive Behavioural Systems: COST 2102 International Training School, Revised Selected Papers Springer Berlin Heidelberg Lecture Notes in Computer Science Anna Esposito, Alessandro Vinciarelli, Rüdiger Hoffman, Vincent C. ��ü������� 89--103 SFB-TRR-62,Planning http://link.springer.com/chapter/10.1007%2F978-3-642-34584-5_7 Andreas Wendemuth Susanne Biundo inproceedings honold2012companion We present a context adaptive approach for multimodal interaction for the use in cognitive technical systems, so called Companion Systems. Such systems yield properties of multimodality, individuality, adaptability, availability, cooperativeness and trustworthiness. These characteristics represent a new type of interactive systems that are not only practical and efficient to operate, but as well agreeable, hence the term "companion". Companion technology has to consider the entire situation of the user, machine, and environment. The presented prototype depicts a system that offers assistance in the task of wiring the components of a home cinema system. The user interface for this task is not predefined, but built on the fly by dedicated fission and fusion components, thereby adapting the system's multimodal output and input capabilities to the user and the environment. 2012 ACM Proceedings of the 14th ACM international conference on Multimodal interaction 67--68 SFB-TRR-62 http://dl.acm.org/citation.cfm?id=2388676.2388696&coll=DL&dl=GUIDE http://delivery.acm.org/10.1145/2390000/2388696/p67-honold.pdf Frank Honold Felix ������ü������� Florian Nothdurft Peter Kurzok inproceedings KazKroSim12ELK_ORE ELK is a specialized reasoner for the lightweight ontology language OWL EL. The practical utility of ELK is in its combination of high performance and comprehensive support for language features. At its core, ELK employs a consequence-based reasoning engine that can take advantage of multi-core and multi-processor systems. A modular ar- chitecture allows ELK to be used as a stand-alone application, Protégé plug-in, or programming library (either with or without the OWL API). This system description presents the current state of ELK and experi- mental results with some difficult OWL EL ontologies. 2012 Proceedings of the 1st International Workshop on OWL Reasoner Evaluation ({ORE} 2012) SemanticTechnologies, AutomatedReasoning, ELK http://ceur-ws.org/Vol-858/ore2012_paper10.pdf fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/KazKroSim12ELK_ORE.pdf Yevgeny Kazakov Markus ����ö�ٳ������� ������Գپ�š��� ����������čí�� techreport KazKroSim12ELK_TR ELK is a specialized reasoner for the lightweight ontology language OWL EL. The practical utility of ELK is in its combination of high performance and comprehensive support for language features. At its core, ELK employs a consequence-based reasoning engine that can take advantage of multi-core and multi-processor systems. A modular architecture allows ELK to be used as a stand-alone application, Protégé plug-in, or programming library (either with or without the OWL API). This system description presents the current state of ELK. 2012 University of Oxford AutomatedReasoning, ELK fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/KazKroSim12ELK_TR.pdf Yevgeny Kazakov Markus ����ö�ٳ������� ������Գپ�š��� ����������čí�� techreport StLG12c With this contribution we push the boundary of some known optimisations such as caching to the very expressive Description Logic SROIQ.The developed method is based on a sophisticated dependency management and a precise unsatisfiability caching technique, which further enables better informed tableau backtracking and more efficient pruning. Additionally, we optimise the handling of cardinality restrictions, by introducing a strategy called pool-based merging.We empirically evaluate the proposed optimisations within the novel reasoning system Konclude and show that the proposed optimisations indeed result in significant performance improvements. 2012 University of Ulm TR-2012-01 Reasoning, Description Logics, Tableau, Optimisations, Optimizations AutomatedReasoning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui/Ulmer_Informatik_Berichte/2012/UIB-2012-01.pdf Andreas Steigmiller Thorsten Liebig Birte Glimm proceedings GlKr12a 2012 978-3-642-33346-0 KI 7526 Springer Lecture Notes in Artificial Intelligence Glimm, Birte and Krüger, Antonio Artificial Intelligence AutomatedReasoning conference KazKroSim12NominalsEL_KR The EL family of description logics (DLs) has been designed to provide a restricted syntax for commonly used DL constructors with the goal to guarantee polynomial complexity of reasoning. Yet, polynomial complexity does not always mean that the underlying reasoning procedure is efficient in practice. In this paper we consider a simple DL ELO from the EL family that admits nominals, and argue that existing polynomial reasoning procedures for ELO can be impractical for many realistic ontologies. To solve the problem, we describe an optimization strategy in which the inference rules required for reasoning with nominals are avoided as much as possible. The optimized procedure is evaluated within the reasoner ELK and demonstrated to perform well in practice. 2012 978-1-57735-560-1 Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning ({KR} 2012) AAAI Press Gerhard Brewka and Thomas Eiter and Sheila A. McIlraith KnowledgeModeling, ELK, LiveOntologies http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4540 fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/KazKroSim12NominalsEL_KR.pdf Yevgeny Kazakov Markus ����ö�ٳ������� ������Գپ�š��� ����������čí�� proceedings GlHu12a 2012 ISWC-PD International Semantic Web Conference (Posters & Demos) 914 CEUR-WS.org CEUR Workshop Proceedings Glimm, Birte and Huynh, David Semantic Web AutomatedReasoning inproceedings geier2012association 2012 10.1109/ICTAI.2013.101 Proceedings of the 24th IEEE International Conference on Tools with Artificial Intelligence (ICTAI) 844--851 Tools with Artificial Intelligence Athens, Greece SFB-TRR-62, KnowledgeModeling http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6495131&tag=1 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2012/Geier2012TrackingB.pdf Thomas Geier Stephan Reuter Klaus Dietmayer Susanne Biundo inproceedings nothdurft2012using In this demo paper we present a system that is capable of adapting the dialogue between human and so-called companion systems in real-time. Companion systems are continually available, co-operative, and reliable assistants which adapt to a user's capabilities, preferences, requirements, and current needs. Typically state-of-the art Human-Computer interfaces adapt the interaction only to pre-defined levels of expertise. In contrast, the presented system adapts the structure and content of the interaction to each user by including explanations to prepare him for upcoming tasks he has to solve together with the companion system. 2012 ACM Proceedings of the 14th ACM international conference on Multimodal interaction 63--64 SFB-TRR-62 http://dl.acm.org/citation.cfm?id=2388676.2388694&coll=DL&dl=GUIDE http://delivery.acm.org/10.1145/2390000/2388694/p63-nothdurft.pdf Florian Nothdurft Frank Honold Peter Kurzok article Biundo2011CognitiveSystems Artificial Intelligence technologies enable the implementation of cognitive systems with advanced planning and reasoning capabilities. This article presents an approach to use hybrid planning - a method that combines reasoning about procedural knowledge and causalities - to provide user-centered assistance.Based on a completely declarative description of actions, tasks, and solution methods, hybrid planning allows for the generation of knowledge-rich plans of action. The information those plans comprise includes causal dependencies between actions on both abstract and primitive levels as well as information about their hierarchical and temporal relationships.We present the hybrid planning approach in detail and show its potential by describing the realization of various assistance functionalities based on complex cognitive processes like the generation, repair, and explanation of plans. Advanced user assistance is demonstrated by means of a practical application scenario where an innovative electronic support mechanism helps a user to operate a complex mobile communication device. 2011 1389--0417 10.1016/j.cogsys.2010.12.005 Cognitive Systems Research 12 219--236 3-4 Cognitive technical systems, Companion-technology, Hybrid planning, Plan repair, Plan explanation, Real-world planning SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Biundo11AdvancedUserAssistance.pdf Special Issue on Complex Cognition Susanne Biundo Pascal Bercher Thomas Geier Felix ��ü������� Bernd Schattenberg inproceedings Geier2011OnlineInference We examine the problem of filtering for dynamic probabilistic systems using Markov Logic Networks. We propose a method to approximately compute the marginal probabilities for the current state variables that is suitable for online inference. Contrary to existing algorithms, our approach does not work on the level of belief propagation, but can be used with every algorithm suitable for inference in Markov Logic Networks, such as MCSAT. We present an evaluation of its performance on two dynamic domains. 2011 10.1109/ICTAI.2011.120 Proceedings of the 23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI) 764--768 dmln, mln, dynamic, inference SFB-TRR-62, KnowledgeModeling http://www.cse.fau.edu/ictai2011/ http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6103411 /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Geier11ApproxDMLNs.pdf Thomas Geier Susanne Biundo incollection Bidot2011AmbientEnvironments In this chapter, we describe how Artificial Intelligence planning techniques are used in The Adapted and TRusted Ambient eCOlogies (ATRACO) in order to provide Sphere Adaptation . We introduce the Planning Agent (PA) which plays a central role in the realization and the structural adaptation of activity spheres. Based on the particular information included in the ontology of the execution environment, the PA delivers workflows that consist of the basic activities to be executed in order to achieve a user’s goals. The PA encapsulates a search engine for hybrid planning—the combination of hierarchical task network (HTN) planning and partial-order causal-link (POCL) planning . In this chapter, we describe a formal framework and a development platform for hybrid planning, PANDA. This platform allows for the implementation of many search strategies, and we explain how we realize the search engine of the PA by adapting and configuring PANDA specifically for addressing planning problems that are part of the ATRACO service composition. We describe how the PA interacts with the Sphere Manager and the Ontology Manager in order to create planning problems dynamically and generate workflows in the ATRACO-BPEL language. In addition, an excerpt of a planning domain for ATRACO is provided. 2011 10.1007/978-3-319-23452-6_8 Next Generation Intelligence Environments - Ambient Adaptive Systems 1 Springer 6 Tobias Heinroth and Wolfgang Minker 195--225 SFB-TRR-62,Planning Julien Bidot Susanne Biundo inproceedings Mueller2011HierarchicalFSCs n this paper, a novel approach to hierarchical planning under partial observability in relational domains is presented. It combines hierarchical task network planning with the finite state controller (FSC) policy representation for partially observable Markov decision processes. Based on a new first-order generalization of FSCs, action hierarchies are defined as in traditional hierarchical planning, so that planning corresponds to finding the best plan in a given decomposition hierarchy of predefined, partially abstract FSCs. Finally, we propose an algorithm for solving planning problems in this setting. Our approach offers a way of practically dealing with real-world partial observability planning problems: it avoids the complexity originating from the dynamic programming backup operation required in many present-day policy generation algorithms. 2011 Proceedings of the 34th Annual German Conference on Artificial Intelligence (KI 2011) Springer Joscha Bach and Stefan Edelkamp 216--227 SFB-TRR-62,Planning http://www.springerlink.com/content/g051ht236j73761m/ http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/paper-hierarchicalFOFSCs.pdf Felix ��ü������� Susanne Biundo inproceedings Elkawkagy2011HybridMultiAgent2 Although several approaches have been constructed for multi-agent planning, solving large planning problems is still quite difficult. In this paper, we present a new approach that integrates landmark preprocessing technique in the context of hierarchical planning with multi-agent planning. Our approach uses Dependent and Independent clustering techniques to break up the planning problem into smaller clusters. These clusters are solved individually according to landmark information, then the obtained individual plans are merged according to the notion of fragments to generate a final solution plan. In hierarchical planning, landmarks are those tasks that occur in the decomposition refinements on every plan development path. Hierarchical landmark technique shows how a preprocessing step that extracts landmarks from a hierarchical planning domain and problem description can be used to prune the search space that is to be explored before actual search is performed. The methodologies in this paper have been implemented successfully, and we will present some experimental results that give evidence for the considerable performance increase gained through our system. 2011 Proceedings of the of the Ninth German Conference on Multi-Agent System Technologies (MATES 2011) IOS Press 16--28 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Elkawkagy11HybridMultiAgentSlides.pdf http://www.springerlink.com/content/e73066483x2j7502/ http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Elkawkagy11HybridMultiAgent.pdf Mohamed Elkawkagy Susanne Biundo inproceedings Bercher2011Preferences This paper is concerned with the problem of finding preferred plans in a hybrid planning setting, which is the fusion of classical and hierarchical planning. Here, we define preferences as weighted soft goals - facts one would like to see satisfied in a goal state, but which do not have to hold necessarily. We present a branch-and-bound algorithm that allows a broad variety of search strategies, as opposed to the majority of existing planning systems which usually perform progression. The algorithm prunes task networks from the search space which will never lead to a better solution than the best solution found so far. To this end, we developed an admissible heuristic, based on a combination of the h^2 heuristic and delete relaxation, which takes as input a task network and estimates the best quality of any solution that can be developed from it. 2011 26th PuK Workshop "Planen, Scheduling und Konfigurieren, Entwerfen" (PuK 2011) SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Bercher11PreferencesSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Bercher11Preferences.pdf Pascal Bercher Susanne Biundo inproceedings Elkawkagy2011LandmarkStrategies In hierarchical planning, landmarks are abstract tasks the decomposition of which are mandatory when trying to find a solution to a given problem. In this paper, we present novel domain-independent strategies that exploit landmark information to speed up the planning process. The empirical evaluation shows that the landmark-aware strategies outperform established search strategies for hierarchical planning. 2011 Workshop on Heuristics for Domain-independent Planning (HDIP 2011) at ICAPS 2011 73--79 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Elkawkagy11LandmarkStrategiesSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Elkawkagy11LandmarkStrategies.pdf Mohamed Elkawkagy Pascal Bercher Bernd Schattenberg Susanne Biundo inproceedings Geier2011HybridDecidability The field of deterministic AI planning can roughly be divided into two approaches - classical state-based planning and hierarchical task network (HTN) planning. The plan existence problem of the former is known to be decidable while it has been proved undecidable for the latter. When extending HTN planning by allowing the unrestricted insertion of tasks and ordering constraints, one obtains a form of planning which is often referred to as "hybrid planning".We present a simplified formalization of HTN planning with and without task insertion. We show that the plan existence problem is undecidable for the HTN setting without task insertion and that it becomes decidable when allowing task insertion. In the course of the proof, we obtain an upper complexity bound of EXPSPACE for the plan existence problem for propositional HTN planning with task insertion. 2011 Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011) AAAI Press 1955--1961 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Geier11HybridDecidabilityPoster.pdf http://www.aaai.org/ocs/index.php/IJCAI/IJCAI11/paper/view/3194 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/Geier11HybridDecidability.pdf Thomas Geier Pascal Bercher article owllink!11 A semantic application typically is a heterogenous system of interconnected components, most notably a reasoner. OWLlink is an implementation-neutral protocol for communication between OWL 2 components, published as a W3C Member Submission. It specifies how to manage reasoning engines and their Knowledge Bases, how to assert axioms, and how to query inference results. A key feature of OWLlink is its extensibility, which allows the addition of required functionality to the protocol. We introduce the OWLlink structural specification as well as three bindings which use HTTP as concrete transport protocol for exchanging OWLlink messages rendered according to selected OWL 2 syntaxes. Finally, we report on existing APIs, reasoners and applications that implement OWLlink. 2011 1570-0844 10.3233/SW-2011-0027 Journal Semantic Web - Interoperability, Usability, Applicability 2 23--32 1 OWL, OWL 2, protocol, reasoning, Semantic Web SemanticTechnologies, AutomatedReasoning http://www.semantic-web-journal.net/sites/default/files/swj64_0.pdf Thorsten Liebig Marko Luther Olaf Noppens Michael Wessel article Biundo2011RealWorldPlanning In this article, we describe how real world planning problems can be solved by employing Artificial Intelligence planning techniques. We introduce the paradigm of hybrid planning, which is particularly suited for applications where plans are not intended to be automatically executed by systems, but are made for humans. Hybrid planning combines hierarchical planning – the stepwise refinement of complex tasks – with explicit reasoning about causal dependencies between actions, thereby reflecting exactly the kinds of reasoning humans perform when developing plans. We show how plans are generated and how failed plans are repaired in a way that guarantees stability. Our illustrating examples are taken from a domain model for disaster relief missions enforced upon extensive floods. Finally, we present a tool to support the challenging task of constructing planning domain models. The article ends with an overview of a wide varity of actual planning applications and outlines further such in the area of cognitive technical systems. 2011 10.1007/s00287-011-0562-7 Informatik-Spektrum 34 443--454 5 SFB-TRR-62,Planning http://www.springerlink.com/content/514981j48161127x/ http://www.springerlink.com/content/514981j48161127x/fulltext.pdf Susanne Biundo Julien Bidot Bernd Schattenberg inproceedings liebig_rscale!11 We introduce Rscale, a secondary storage-aware OWL 2 RL reasoning system capable of dealing with incremental additions and deletions of facts. Our initial evaluation indicates that Rscale is suitable for stream reasoning scenarios characterized by expressive reasoning tasks triggered by a moderate change frequency. 2011 Proceedings of Workshop on Ordering and Reasoning (OrdRing 2011) OWL 2 RL, stream reasoning, incremental updates SemanticTechnologies,AutomatedReasoning fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/ordring11-liebig.pdf Thorsten Liebig Michael Opitz inproceedings Schulz2011ReversalLearning The framework of reinforcement learning (RL), in particular temporal difference (TD) learning, is traditionally utilized to model Pavlovian and Instrumental Learning in animal and human subjects. Neurophysiological correlates model parameters, on the level of both single cells and fMRI data, support this approach ( Barto and Sutton 1998, Schulz 2001, Doya 2008). Notably, most of these models are applied to appetitive learning, as their nature demands that reinforcement is directly related to an action. In aversive learning this is not the case, at least not for directly observable actions of the animal. Therefore RL models of avoidance learning are studied only relatively recently (e.g. Moutoussis et al. 2008). The first aim of the present study was the investigation of RL models in the context of two-way avoidance and reversal learning. We used a well-established animal model for two-way avoidance, the Mongolian gerbil trained in a shuttle box Go/NoGo paradigm (Wetzel 1998; Ohl et al. 2001). We have extended the RL model of Moutoussis et al. and compared the results to the animal behavior.We also found, that Reinforcement Learning models can explain various aspects of two-way avoidance learning but do not provide a rationale for the relationship found between dynamics of initial learning and dynamics of reversal learning. However, the Artificial Intelligence (AI) paradigm of Automated Planning can provide a rationale for explaining such relationships. As the second aim of this study, we therefore modeled the avoidance learning by a Hybrid Planning ( Biundo and Schattenberg 2001) and plan repair approach (Bidot et al. 2008) and demonstrated that the empirically found relationships could be motivated from a consistent theoretical framework. The AI planning framework has the additional advantage over mere Reinforcement models to provide an explicit representation of and reasoning about "internal" processing stages. 2011 Proceedings of the Annual Meeting of the Society For Neuroscience avoidance,reinforcement learning, modeling SFB-TRR-62,Planning,KnowledgeModeling http://www.abstractsonline.com/Plan/ViewAbstract.aspx?sKey=36dc39eb-9262-472e-9ee0-df4fc3c6abd5&cKey=f1c0c307-ad80-41c9-b32f-f5def2a643e0&mKey=%7b8334BE29-8911-4991-8C31-32B32DD5E6C8%7d Andreas Schulz Bernd Schattenberg Marie Woldeit ���Ի��é Brechmann Susanne Biundo Frank W. Ohl inproceedings LKR+11 In the light of an increasing demand on business process compliance, the verification of process models against compliance rules has become essential in enterprise computing. The SeaFlows Toolset featured in this paper extends process-aware information systems with compliance checking functionality. It provides a user-friendly environment for modeling compliance rules using a graph-based formalism and for enriching process models with these rules. To address a multitude of verification settings, we provide two complementary compliance checking approaches: The structural compliance checking approach derives structural criteria from compliance rules and applies them to detect incompliance. The data-aware behavioral compliance checking approach addresses the state explosion problem that can occur when the data dimension is explored during compliance checking. It performs context-sensitive automatic abstraction to derive an abstract process model which is more compact with regard to the data dimension enabling more efficient compliance checking. Altogether, SeaFlows Toolset constitutes a comprehensive and extensible framework for compliance checking of process models. 2011 Information Systems Evolution -- CAiSE Forum 2010, Selected Extended Papers 72 Springer Lecture Notes in Business Information Processing Aalst, Will and Mylopoulos, John and Sadeh, Norman M. and Shaw, Michael J. and Szyperski, Clemens and Soffer, Pnina and Proper, Erik 76--91 http://dbis.eprints.uni-ulm.de/687/1/Ly10_CAiSEForume.pdf Linh Thao Ly David Knuplesch Stefanie Rinderle-Ma Kevin ��ö����� Holger Pfeifer Manfred Reichert Peter Dadam inproceedings Bidot2011ServiceWorkflows In this paper, we present an approach to aggregating and using devices that support the everyday life of human users in ambient intelligence environments. These execution environments are complex and changing over time, since the devices of the environments are numerous and heterogeneous, and they may appear or disappear at any time. In order to appropriately adapt the ambient system to a user's needs, we adopt a service-oriented approach; i.e., devices provide services that reflect their capabilities. The orchestration of the devices is actually realized with the help of Artificial Intelligence planning techniques and dynamic service binding. At design time, (i) a planning problem is created that consists of the user's goal to be achieved and the services currently offered by the intelligent environment, (ii) the planning problem is then solved using Hierarchical Task Network and Partial-Order Causal-Link planning techniques, (iii) and from the planning decisions taken to find solution plans, abstract service workflows are automatically generated. At run time, the abstract services are dynamically bound to devices that are actually present in the environment. Adaptation of the workflow instantiation is possible due to the late binding mechanism employed. The paper depicts the architecture of our system. It also describes the modeling and the life cycle of the workflows. We discuss the advantages and the limit of our approach with respect to related work and give specific details about implementation. We present some experimental results that validate our system in a real-world application scenario. 2011 10.1109/PERCOM.2011.5767580 Proceedings of the Ninth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom) 156--163 SFB-TRR-62,Planning http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5767580 Julien Bidot Christos Goumopoulos Ioannis Calemis inproceedings NiGR11a When ontological knowledge is acquired automatically, quality control is essential. We consider the tightest possible approach - an exhaustive manual inspection of the acquired data. By using automated reasoning, we partially automate the process: after each expert decision, axioms that are entailed by the already approved statements are automatically approved, whereas axioms that would lead to an inconsistency are declined. Adequate axiom ranking strategies are essential in this setting to minimize the amount of expert decisions. In this paper, we present a generalization of the previously proposed ranking techniques which works well for arbitrary validity ratios - the proportion of valid statements within a dataset - whereas the previously described ranking functions were either tailored towards validity ratios of exactly 100% and 0% or were optimizing the worst case. The validity ratio - generally not known a priori - is continuously estimated over the course of the inspection process. We further employ partitioning techniques to significantly reduce the computational effort. We provide an implementation supporting all these optimizations as well as featuring a user front-end for successive axiom evaluation, thereby making our proposed strategy applicable to practical scenarios. This is witnessed by our evaluation showing that the novel parameterized ranking function almost achieves the maximum possible automation and that the computation time needed for each reasoning-based, automatic decision is reduced to less than one second on average for our test dataset of over 25,000 statements. 2011 10.1007/978-3-642-25073-6_31 Proceedings of the 10th International Semantic Web Conference (ISWC 2011) 7031 Springer-Verlag 487-503 AutomatedReasoning http://www.springerlink.com/content/r51v2xn6188kv4m2/ /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2011/NiGR11a.pdf Nadeschda Nikitina Birte Glimm Sebastian Rudolph inproceedings Elkawkagy10LandmarksInHybrid Very recently, the well-known concept of landmarks has been adapted from the classical planning setting to hierarchical planning. It was shown how a pre-processing step that extracts local landmarks from a planning domain and problem description can be used in order to prune the search space that is to be explored before the actual search is performed. This pruning technique eliminates all branches of the task decomposition tree, for which can be proven that they will never lead to a solution. In this paper, we investigate this technique in more detail and extend it by introducing search strategies which use these local landmarks in order to guide the planning process more effectively towards a solution. Our empirical evaluation shows that the pre-processing step dramatically improves performance because dead ends can be detected much earlier than without pruning and that our search strategies using the local landmarks outperform many other possible search strategies. 2010 Proceedings of the 25th PuK Workshop "Planen, Scheduling und Konfigurieren, Entwerfen" (PuK 2010) SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2010/Elkawkagy10LandmarksInHybridSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2010/Elkawkagy10LandmarksInHybrid.pdf Mohamed Elkawkagy Pascal Bercher Bernd Schattenberg Susanne Biundo inproceedings Elkawkagy10LandmarksInHTN In this paper we introduce a novel landmark technique for hierarchical planning. Landmarks are abstract tasks that are mandatory. They have to be performed by any solution plan. Our technique relies on a landmark extraction procedure that pre-processes a given planning problem by systematically analyzing the ways in which relevant abstract tasks can be decomposed. We show how the landmark information is used to guide hierarchical planning and present some experimental results that give evidence for the considerable performance increase gained through our technique. 2010 Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010) IOS Press 229--234 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2010/Elkawkagy10LandmarksInHierarchicalSlides.pdf http://www.booksonline.iospress.nl/Content/View.aspx?piid=17747 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2010/Elkawkagy10LandmarksInHierarchical.pdf Mohamed Elkawkagy Bernd Schattenberg Susanne Biundo inproceedings Hahn!10 The growing amount of digital music content and the increasing connectivity of vehicles raise new challenges in terms of media access for vehicle drivers. Creating easily a personalized playlist in vehicles involves a unified representation of various metadata, combined with a mobile architecture addressing media resolution and aggregation issues. This paper analyzes the technical aspects of mobile access to music metadata and its use in a personalized playlist generation scenario. A prototype illustrates this study and gives first results. 2010 10.1007/978-3-642-16607-5_29 Proceedings of the HCI in Work and Learning, Life and Leisure 6389 Springer Berlin / Heidelberg Lecture Notes in Computer Science Leitner, Gerhard and Hitz, Martin and Holzinger, Andreas 427--442 meta data, content aggregation, mobile architecture, playlist creation SemanticTechnologies,KnowledgeModeling fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2010/hci10-han-turlier-liebig-et-all.pdf Clemens Hahn ����é��󲹲Ա� Turlier Thorsten Liebig Sascha Gebhardt Christopher Roelle inproceedings KLR+10 In the light of an increasing demand on business process compliance, the verification of process models against compliance rules has become essential in enterprise computing. To be broadly applicable compliance checking has to support data-aware compliance rules as well as to consider data conditions within a process model. Independently of the actual technique applied to accomplish compliance checking, data awareness means that in addition to the control ow dimension, the data dimension has to be explored during compliance checking. However, naive exploration of the data dimension can lead to state explosion. We address this issue by introducing an abstraction approach in this paper. We show how state explosion can be avoided by conducting compliance checking for an abstract process model and abstract compliance rules. Our abstraction approach can serve as preprocessing step to the actual compliance checking and provides the basis for more efficient application of existing compliance checking algorithms. 2010 Proceedings of the 29th International Conference on Conceptual Modeling -- ER 2010 6412 Springer Lecture Notes in Computer Science Jeffrey Parsons and Motoshi Saeki and Peretz and Shoval and Carson Woo and Yair Wand 332--346 http://dbis.eprints.uni-ulm.de/665/3/KLRD10a.pdf David Knuplesch Linh Thao Ly Stefanie Rinderle-Ma Holger Pfeifer Peter Dadam techreport OWLlink-retraction-W3C!10 OWLlink provides a declarative interface for -- among other things -- asserting OWL axioms to a Knowledge Base (KB) of an OWL reasoner. This OWLlink extension adds the ability to retract previously asserted axioms from KBs. Member Submission 2010 World Wide Web Consortium owllink SemanticTechnologies http://www.w3.org/Submission/owllink-extension-retraction/ Olaf Noppens Thorsten Liebig techreport OWLlink-retraction-httpxml-W3C!10 OWLlink provides a declarative interface for -- among other things -- asserting OWL axioms to a Knowledge Base (KB) of an OWL reasoner. This OWLlink extension adds the ability to retract previously asserted axioms from KBs. This document describes the accompanying HTTP/XML Binding of this extension. Member Submission 2010 World Wide Web Consortium owllink SemanticTechnologies http://www.w3.org/Submission/owllink-extension-retraction-httpxml-binding/ Olaf Noppens Thorsten Liebig techreport OWLlink-httpxml-W3C!10 The OWLlink interface provides an implementation-neutral mechanism for accessing OWL reasoner functionality. OWLlink relies on OWL 2 for the primitives of the modeling language, and is thus fully compatible with OWL. The set of OWLlink primitives described in this document cover basic reasoner managment, assertion of axioms and elementary ask functionality. An extension mechanism is provided in order to easily add any required functionality in a controlled way to the core language. This document defines a concrete binding of OWLlink into HTTP/1.1 and XML Schema. A structural specification of OWLlink is given in an accompanying document [OWLlink Structural Specification]. Member Submission 2010 World Wide Web Consortium owllink SemanticTechnologies http://www.w3.org/Submission/owllink-httpxml-binding/ Olaf Noppens Marko Luther Thorsten Liebig Michael Wessel techreport OWLlink-specification-W3C!10 The OWLlink interface provides an implementation-neutral mechanism for accessing OWL reasoner functionality. OWLlink is a refinement of the DIG protocol most notably with respect to query and language expressivity. It has been renamed to OWLlink since it relies on OWL 2 for the primitives of the modeling language, and is thus fully compatible with OWL. The set of OWLlink core primitives described in this document cover basic reasoner management, assertion of axioms and elementary ask functionality. An extension mechanism is provided to easily add any required functionality in a controlled way to the core language. This document defines the OWLlink core interface by providing a structural specification. A concrete binding into HTTP/1.1 and XML Schema is given in an accompanying document [OWLlink HTTP/XML Binding]. Further bindings are the [OWLlink HTTP/Functional Binding] and the [OWLlink HTTP/S-Expression Binding]. Member Submission 2010 World Wide Web Consortium owllink SemanticTechnologies http://www.w3.org/Submission/owllink-structural-specification/ Thorsten Liebig Marko Luther Olaf Noppens inproceedings Mattmueller10NondeterministicPlanning When planning in an uncertain environment, one is often interested in finding a contingent plan that prescribes appropriate actions for all possible states that may be encountered during the execution of the plan. We consider the problem of finding strong and strong cyclic plans for fully observable nondeterministic (FOND) planning problems. The algorithm we choose is LAO*, an informed explicit state search algorithm. We investigate the use of pattern database (PDB) heuristics to guide LAO* towards goal states. To obtain a fully domain-independent planning system, we use an automatic pattern selection procedure that performs local search in the space of pattern collections. The evaluation of our system on the FOND benchmarks of the Uncertainty Part of the International Planning Competition 2008 shows that in selected domains our approach is competitive with symbolic regression search in terms of problem coverage and speed, and that plan sizes are often significantly smaller than with symbolic regression search. 2010 Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010) AAAI Press 105--112 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2010/Mattmueller10NonDetPlanningSlides.pdf http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1430 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2010/Mattmueller10NonDetPlanning.pdf Robert �Ѳ��ٳٳ�ü������� Manuela Ortlieb Malte Helmert Pascal Bercher inproceedings liebig-etal!10 Practical scalability of reasoning is an important premise for the adoption of semantic technologies in a real-world setting. Many highly effective optimizations for reasoning with expressive OWL ontologies have been invented and implemented over the last decades. This paper describes our approach for concurrent computation of the nondeterministic choices inherent to the OWL tableau reasoning procedure for \mathcalSHIQ. We present the architecture of our parallel reasoner and briefly discuss our prototypical implementation as well as future work. 2010 Proceedings of the 4th International Workshop on New Forms of Reasoning for the Semantic Web: Scalable and Dynamic (NeFoRS 2010) OWL, Reasoning, Parallelization, stream reasoning AutomatedReasoning fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2010/nefors10-liebig.pdf Thorsten Liebig Andreas Steigmiller Olaf Noppens inproceedings noppens-etal!10 We introduce the OWLlink API that implements the OWLlink protocol on top of the Java-based OWL API. Besides providing an API to access remote OWLlink reasoning engines, it turns any OWL API aware reasoner into an OWLlink server. As such the OWLlink API provides the missing piece to replace the outdated DIG protocol by OWLlink in applications such as Protégé. 2010 Proceedings of the 7th International Workshop on OWL: Experiences and Directions (OWLED 2010) 614 CEUR Workshop Proceedings Evren Sirin and Kendall Clark owllink SemanticTechnologies http://CEUR-WS.org/Vol-614/owled2010_submission_1.pdf Olaf Noppens Marko Luther Thorsten Liebig proceedings PPHM10a 2010 978-3-642-17745-3 International Semantic Web Conference (1) 6496 Springer Lecture Notes in Computer Science Patel-Schneider, Peter F. and Pan, Yue and Hitzler, Pascal and Mika, Peter and Zhang, Lei and Pan, Jeff Z. and Horrocks, Ian and Glimm, Birte Semantic Web AutomatedReasoning proceedings PPHM10b 2010 978-3-642-17748-4 International Semantic Web Conference (2) 6497 Springer Lecture Notes in Computer Science Patel-Schneider, Peter F. and Pan, Yue and Hitzler, Pascal and Mika, Peter and Zhang, Lei and Pan, Jeff Z. and Horrocks, Ian and Glimm, Birte Semantic Web AutomatedReasoning inproceedings Biundo2010Explanations State-of-the-art AI planning systems are able to generate complex plans thanks to their efficient reasoning engines. In a large number of application domains, the plans are automatically executed by systems such as autonomous robots. In this context, it is not necessary to make these automated systems understand what they are actually doing during execution and why they are doing that. In other words, these systems do not need to understand the underlying semantics of the plans they execute and how these plans have been generated. However, there are a significant number of key application domains, such as disaster relief mission support or project planning, where plans are supposed to be executed by a human user who is not necessarily a planning expert, an application expert, or both. In addition, for real-world applications, the plans and the plan generation are often complex. In order to unlock a part of the application potential of the AI planning technology, it is necessary that the user trusts the technology. Increasing trust in AI planning systems requires the design and implementation of user-friendly interfaces and the development of plan explanation methods that allow for taking into consideration the human user’s queries related to some components of the plan about their meaning and relevance for the plan and giving back the appropriate information that answers these queries. The verbal communication by speech constitutes the most natural form of communication for humans. By means of natural language dialogs in this work, we focus on the explanation of plans that are generated by a refinement-based planning system. Contrary to most approaches presented in the literature that try to provide explanations when backtracking occurs in failure situations during search, we assume in this work that the plans for which explanations are looked for are consistent. We present a domain-independent approach to enabling verbal human queries and producing verbal plan explanations. 2010 Proceedings of the Conference "Multikonferenz Wirtschaftsinformatik" (MKWI 2010), Teilkonferenz "Planen, Scheduling und Konfigurieren, Entwerfen" (PuK 2010) Universitätsverlag Göttingen Matthias Schumann and Lutz M. Kolbe and Michael H. Breitner and Arne Frerichs 2309--2320 SFB-TRR-62,Planning http://webdoc.sub.gwdg.de/univerlag/2010/mkwi/03_anwendungen/planen_scheduling/06_verbal_plan_explanations_for_hybrid_plannings.pdf Julien Bidot Susanne Biundo Tobias Heinroth Wolfgang Minker Florian Nothdurft Bernd Schattenberg article Biundo2010mpanionSysteme Hoffnung, lästige Routineaufgaben zu automatisieren, der unerwünschten Informationsflut Herr zu werden, erwünschte Informationen zu erhalten, zeitraubende Koordinations- und Kommunikationsaufgaben zu bewältigen und sich von langweiligen Alltagsentscheidungen entlasten zu können. Von Informationstechnik erhoffen sich viele Menschen – entsprechend dem Heinzelmännchenmotiv – eine umfassende Assistenz, die ihren Wunsch nach individueller Produktivität und persönlicher Bequemlichkeit in einem immer komplexer werdenden Alltag erfüllt. Der dadurch gewonnene Freiraum soll ihnen ermöglichen, sich auf die interessanten und wesentlichen Aufgaben zu konzentrieren. Sie wollen sich diesen Aufgaben ohne technische Einschränkung jederzeit und überall widmen können. Die damit verbundene Zeitersparnis für delegierbare Arbeit soll es außerdem ermöglichen, in signifikanter Weise Kosten einzusparen und Waren oder Dienstleistungen deutlich preisgünstiger anzubieten 2010 10.1007/s13218-010-0056-9 Künstliche Intelligenz 24 335--339 4 SFB-TRR-62,Planning http://www.springerlink.com/content/e558815w08k09531/ http://www.springerlink.com/content/e558815w08k09531/fulltext.pdf Susanne Biundo Andreas Wendemuth inproceedings Schattenberg2009Framework Hybrid planning, the integration of hierarchical task decomposition and partial-order planning, provides a powerful mechanism to solve real-world planning problems. We present a domain-independent, mixed-initiative approach to plan generation that is based on a formal concept of hybrid planning. It allows for any interaction modalities and models of initiative while preserving the soundness of the plan generation process. Adequately involving the decision competences of end-users this way will improve the application potential as well as the acceptance of the technology. 2009 978-3-642-04616-2 10.1007/978-3-642-04617-9_3 Proceedings of the 32nd Annual German Conference on Artificial Intelligence (KI 2009) 5803 Springer LNAI 5803 17--24 Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2009/Schattenberg2009FrameworkSlides.pdf http://www.springerlink.com/content/v3171u800470815r/ http://www.springerlink.com/content/v3171u800470815r/fulltext.pdf Bernd Schattenberg Julien Bidot Sascha �ұ�ß����� Susanne Biundo article Bidot2009Framework There are many systems and techniques that address stochastic planning and scheduling problems, based on distinct and sometimes opposite approaches, especially in terms of how generation and execution of the plan, or the schedule, are combined, and if and when knowledge about the uncertainties is taken into account. In many real-life problems, it appears that many of these approaches are needed and should be combined, which to our knowledge has never been done. In this paper, we propose a typology that distinguishes between proactive, progressive, and revision approaches. Then, focusing on scheduling and schedule execution, a theoretic model integrating those three approaches is defined. This model serves as a general template to implement a system that will fit specific application needs: we introduce and discuss our experimental prototypes which validate our model in part, and suggest how this framework could be extended to more general planning systems. 2009 10.1007/s10951-008-0080-x Journal of Scheduling 12 Springer 315--344 3 SFB-TRR-62,Planning Julien Bidot Thierry Vidal Philippe Laborie J. Christopher Beck inproceedings BMP09 We describe an approach to the analysis of protocols for wireless sensor networks in scenarios with mobile nodes and dynamic link quality. The approach is based on the theorem proving system PVS and can be used for formal specification, automated simulation and verification of the behaviour of the protocol. In order to demonstrate the applicability of the approach, we analyse the reverse path forwarding algorithm, which is the basic technique used for diffusion protocols for wireless sensor networks. 2009 978-3-642-05117-3 10.1007/978-3-642-05118-0_8 Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings 5873 Springer Lecture Notes in Computer Science Rachid Guerraoui and Franck Petit 105--119 http://www.springerlink.com/content/c652hn103301436j/?p=7b9957e9943242eca7b86428925ba5dd&pi=7 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2009/bmp09.pdf Cinzia Bernardeschi Paolo Masci Holger Pfeifer inproceedings noppens!09b The Partition Pattern is a logical pattern that introduces axioms which model a partition of concepts. A partition is a general structure which is divided into several disjoint parts. With respect to ontologies the structure is a concept which is divided into several pair-wise disjoint concepts. This pattern reflects the simplest case where a named concept is defined as a partition of concepts. 2009 Proceedings of the Workshop on Ontology Patterns (WOP 2009) 516 CEUR Workshop Proceedings Eva Blomqvist and Kurt Sandkuhl and Francois Scharffe and Vojt\v ech Svátek 127--129 ontology, patterns SemanticTechnologies,KnowledgeModeling http://CEUR-WS.org/Vol-516/pat08.pdf Olaf Noppens phdthesis schattenberg2009PhDThesis Planning and scheduling are well-established disciplines in the field of Artificial Intelligence. They provide flexibility, robustness, and effectiveness to complex software systems in a variety of application areas. While planning is the process of finding a course of action that achieves a goal or performs a specified task, scheduling deals with the assignment of resources and time to given activities, taking into account resource restrictions and temporal dependencies. In other words, planning focuses on reasoning about causal structures and identifying the necessary actions for achieving a specific goal; scheduling concentrates on resource consumption and production for optimizing a coherent parameter assignment of a plan. As successful these techniques clearly are, the actual demands of complex, real-world applications go far beyond the potential of these single methods, however. They require an adequate integration of these problem solving methods as well as a combination of different planning and scheduling paradigms. Particularly important are abstraction-based, hierarchical approaches because of both their expressive knowledge representation and their efficiency in finding solutions. Current state-of-the-art systems rarely address the question of method integration; isolated approaches do so only in ad hoc implementations and mostly lack a proper formal basis.This thesis presents a formal framework for plan and schedule generation based on a well-founded conceptualization of refinement planning: An abstract problem specification is transformed stepwise into a concrete, executable solution. In each refinement step, plan deficiencies identify faulty or under-developed parts of the plan, which in turn triggers the generation of transformation operators that try to resolve them. All involved entities are explicitly represented and therefore transparent to the framework. This property allows for two novel aspects of our approach: First, any planning and scheduling methodology can be functionally decomposed and mapped on the deficiency announcement and plan transformation generation principle, and second, the framework allows for an explicit declaration of planning strategies. We first investigate the flexibility of the extremely modular system design by instantiating the framework in a variety of system configurations including classical partial-order causal-link (POCL) planning, hierarchical task-network (HTN) planning, and classical scheduling.As a key feature, the presented approach provides a formally integrated treatment of action and state abstraction, thus naturally combining causality-focused reasoning with hierarchical, procedure-oriented methods. While the use of procedural knowledge allows to rely on well-known, predefined solutions to planning problems, the non-hierarchical methods provide the flexibility to come up with non-standard solutions and to complete under-specified problem instances, respectively. The resulting technique of hybrid planning is capable of constructing a plan's causal and hierarchical structure across multiple levels of abstraction by using plan development options of both the POCL and HTN paradigms. We also present an integrated planning and scheduling system that is defined in our framework. For the first time, such a system is able to combine any ensemble of planning and scheduling technologies on the operational level and to address the respective deficiencies opportunistically. The accordingly unique representation of application domains incorporates temporal phenomena and resource manipulations not only for basic actions but on the abstract action level as well. This leads to the novel technique of hierarchical scheduling, in which the concept of abstraction is extended to resource representation and reasoning, for example resource aggregation and approximation.Thanks to its well-defined functional composition, the framework yields a major improvement with respect to the capabilities of planning and scheduling strategies. The explicitly represented information about a plan's deficiencies and development prospects makes it possible to utilize a new quality of knowledge sources, including relationships between deficiencies, refinements, and components in the plan to which they refer. This leads to the novel class of flexible strategies, which decide upon problem characteristics and the current state of the plan generation process, respectively. The most prominent representatives are our HotSpot and HotZone strategies, which take into account the structural dependencies between problematic elements in the plan when deciding upon their resolution. They are independent of both the application domain and the concrete framework instance. Therefore, they can be deployed for POCL planning as well as for integrated planning and scheduling, for example, and any other combination of methods the overall framework allows for. In addition, these strategy components are not only easily exchangeable, they can also be combined into sequences of decision procedures in which succeeding components fine-tune the choices of the preceding ones. We present the declarations of a comprehensive strategy repertoire, ranging from classical strategy components that implement well-known search principles from the literature to an assortment of flexible strategies.Our formal framework is not only a method for specifying a variety of planning and scheduling functionality, it also enables the derivation of software architectures for fielding the corresponding systems. We show how the formal entities of the framework can be directly mapped onto software artefacts in a knowledge-based multiagent architecture, which optimally supports concurrency – by enabling parallel computations of plan deficiencies and refinement options – as well as the paradigm of distributed knowledge management. While the former addresses the practical issue of managing multiple computational resources the latter matches perfectly the idea of different modules representing different planning and scheduling aspects.Our implementation of the framework resulted in a complex planning environment in which any planning and scheduling system can be easily compiled from a rich collection of functional components. By systematically alternating the system configuration and its parameters, it can also be used as a testbed for the evaluation of framework components, in particular planning strategies and refinement methods. This allowed for conducting a large-scale empirical study on dozens of strategy configurations, which is the first extensive experimental effort in the domain of hybrid planning. It concludes this thesis with four important results: First, we gain insights into the performance of members of our strategy portfolio on a set of benchmark problems. We thereby learned how to graduate performance measures and how to assess such test results. Second, we became familiar with the characteristics of the examined strategies, the experiment problems, and also of the benchmark domains. Third, our findings clearly support both the necessity and feasibility of systematic experimentation in order to identify suitable strategies for a given application domain. Last, but not least, our evaluation effort proves that our environment is an effective platform for orchestrating and operating component-based planning and scheduling systems, in terms of flexibility as well as in terms of efficiency. PhD Thesis 2009 Ulm University, Germany SFB-TRR-62,Planning http://vts.uni-ulm.de/query/longview.meta.asp?document_id=6895 http://vts.uni-ulm.de/docs/2009/6895/vts_6895_9580.pdf Bernd Schattenberg inproceedings noppens!09c 2009 Proceedings of the Workshop on Ontology Patterns (WOP 2009) 516 CEUR Workshop Proceedings Eva Blomqvist and Kurt Sandkuhl and Francois Scharffe and Vojt\v ech Svátek 120--123 ontology, patterns SemanticTechnologies,KnowledgeModeling http://CEUR-WS.org/Vol-516/pat06.pdf Olaf Noppens inproceedings noppens!09 In this paper we argue for a broader view of ontology patterns and therefore present different use-cases where drawbacks of the current declarative pattern languages can be seen. We also discuss use-cases where a declarative pattern approach can replace procedural-coded ontology patterns. With previous work on an ontology pattern language in mind we argue for a general pattern language. 2009 Proceedings of the Workshop on Ontology Patterns (WOP 2009) 516 CEUR Workshop Proceedings Eva Blomqvist and Kurt Sandkuhl and Francois Scharffe and Vojt\v ech Svátek 179--186 ontology, patterns SemanticTechnologies,KnowledgeModeling http://CEUR-WS.org/Vol-516/pap10.pdf Olaf Noppens Thorsten Liebig inproceedings avizienis-et-al!09 Scientists typically need to take a large volume of information into account in order to deal with re-occurring tasks such as inspecting proceedings, finding related work, or reviewing papers. Our work aims at filling the gap between text documents and a structured representations of their content in the domain of resilient computing by combining computer linguistics and ontological methods. The results of our research include: a thesaurus of the domain, automatic clustering of the domain documents, a domain ontology, and a tool for constructing ontologies with the aid of domain thesauri. 2009 Proceedings of the 22nd International Florida Artificial Intelligence Research Society Conference (FLAIRS-22) AAAI Press natural language processing SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2009/knowledge-in-resilience.pdf Algirdas Avizienis Gintare Grigonyte Johann Haller Friedrich von Henke Thorsten Liebig Olaf Noppens inproceedings volke!09 Origo is a Web-application that enables users to manage their social community profiles utilizing semantic technologies. It allows to unite their different profiles and to browse through their semantic social network across various platforms. 2009 Poster Proceesings of the 6th European Semantic Web Conference (ESWC 2009) Semantic Web SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2009/Origo-ESWC09.pdf Mario Volke Thorsten Liebig inproceedings Bercher2009PDBHeuristics Non-determinism arises naturally in many real-world applications of action planning. Strong plans for this type of problems can be found using AO* search guided by an appropriate heuristic function. Most domain-independent heuristics considered in this context so far are based on the idea of ignoring delete lists and do not properly take the non-determinism into account. Therefore, we investigate the applicability of pattern database (PDB) heuristics to non-deterministic planning. PDB heuristics have emerged as rather informative in a deterministic context. Our empirical results suggest that PDB heuristics can also perform reasonably well in non-deterministic planning. Additionally, we present a generalization of the pattern additivity criterion known from classical planning to the non-deterministic setting. 2009 978-3-642-04616-2 Proceedings of the 32nd Annual German Conference on Artificial Intelligence (KI 2009) 5803 Springer LNAI Bärbel Mertsching and Marcus Hund and Zaheer Aziz 57--64 SFB-TRR-62,Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2009/Bercher09NnDetPlanningSlides.pdf http://www.springerlink.com/content/82604j8321324937/ http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2009/Bercher09NnDetPlanning.pdf Pascal Bercher Robert �Ѳ��ٳٳ�ü������� inproceedings liebig-etal!09 A semantic application typically is a heterogenous system of interconnected components, most notably a reasoner. OWLlink is an implementation-neutral protocol for communication between OWL 2 components. It specifies how to manage reasoning engines and their knowledge bases, how to assert axioms, and how to query inference results. A key feature of OWLlink is its extensibility, which allows the addition of required functionality to the protocol. We introduce the OWLlink structural specification and extension mechanism. Furthermore, we present two extensions, one for retrieving previously asserted axioms and one for retracting axioms from a reasoner. Finally, we describe a binding to HTTP/XML and give an overview of existing implementations. 2009 Proceedings of the 6th International Workshop on OWL: Experiences and Directions (OWLED 2009) Rinke Hoekstra and Peter F. Patel-Schneider owllink SemanticTechnologies http://CEUR-WS.org/Vol-529/owled2009_submission_11.pdf Thorsten Liebig Marko Luther Olaf Noppens inproceedings liebigViscover!09 Today's challenging task in intelligent data processing is not to store large volumes of interlinked data but to visualize, explore, and understand its explicit or implicit relationships. Our solution to this is the VIScover system. VIScover combines semantic technologies with interactive exploration and visualization techniques able to analyze large volumes of structured data. We briefly describe our VIScover system and show its potential using the example of the VAST 2009 social network and geospatial data set. 2009 10.1109/VAST.2009.5333946 Proceedings of the IEEE Symposium on Visual Analytics Science and Technology Symposium (VAST 2009) IEEE

Atlantic City, USA

259--260 visualization SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2009/VIScover-VAST09.pdf Thorsten Liebig Olaf Noppens Friedrich von Henke inproceedings luther-etal!09 Finding the optimal selection of an OWL reasoner and service interface for a specific ontology-based application is challenging. Over time it has become more and more difficult to match application requirements with service offerings from available reasoning engines, in particular with recent optimizations for certain reasoning services and new reasoning algorithms for different fragments of OWL. This work is motivated by real-world experiences and reports about interesting findings in the course of developing an ontology-based application. Benchmarking outcomes of several reasoning engines are discussed -- especially with respect to accompanying sound and completeness tests. We compare the performance of various service and communication protocols in different computing environments. Hereby, it becomes apparent that these largely underrated components may have an enormous impact on the overall performance. 2009 10.1007/978-3-642-02121-3_9 Proceedings of the European Semantic Web Conference (ESWC 2009) 5554 Springer Berlin / Heidelberg Lecture Notes in Computer Science 66--80 OWL, Reasoning SemanticTechnologies,AutomatedReasoning fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2009/TheFatherOfBob.pdf Marko Luther Thorsten Liebig Sebastian ��ö�� Olaf Noppens inproceedings BMP08 We describe an approach of using the evaluation mechanism of the specification and verification system PVS to support formal design exploration of WSN algorithms at the early stages of their development. The specification of the algorithm is expressed with an extensible set of programming primitives, and properties of interest are evaluated with ad hoc network simulators automatically generated from the formal specification. In particular, we build on the PVSio package as the core base for the network simulator. According to requirements, properties of interest can be simulated at different levels of abstraction. We illustrate our approach by specifying and simulating a standard routing algorithm for wireless sensor networks. 2008 Computer Safety, Reliability, and Security, 27th International Conference, SAFECOMP 2008, Newcastle upon Tyne, UK, September 22-25, 2008, Proceedings 5219 Springer Lecture Notes in Computer Science Michael D. Harrison and Mark-Alexander Sujan 346--359 http://www.springerlink.com/content/g6723722m7487460/?p=775f8bc1015a402db38b9281e63d316d&pi=28 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2008/safecomp2008.pdf Cinzia Bernardeschi Paolo Masci Holger Pfeifer article liebig-scheele!08 Ontology authoring is a sophisticated task and requires domain as well as some amount of background knowledge in formal logic. In fact, it is not only novice users that are commonly faced with comprehension problems with respect to the influence of complex or nested ontological axioms on reasoning. We provide practical insights into the development of tableau-based methods for explaining the key inference services, namely unsatisfiability, subsumption, and non-subsumption as well as techniques for patching ontologies in order to establish a user desired entailment. 2008 Künstliche Intelligenz 25--27 2 explaining, ontology SemanticTechnologies, KnowledgeModeling http://www.kuenstliche-intelligenz.de/index.php?id=7764 fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2008/kijournal-liebig-scheele08.pdf Thorsten Liebig Stephan Scheele incollection Pfe08 2008 9780849380266 Automotive Embedded Systems Handbook Taylor and Francis CRC Press 15 Nicolas Navet and Francoise Simonot-Lion http://www.crcpress.com/product/isbn/9780849380266 Holger Pfeifer inproceedings liebig-etal!08 The OWLlink interface provides an implementation-neutral mechanism for accessing OWL reasoner functionality. In contrast to its DL-oriented predecessor DIG, OWLlink relies on OWL 2 for the primitives of the modelling language, and is thus fully compatible with the forthcoming incarnation of OWL. The OWLlink core introduced in this document covers (i) basic reasoner management, (ii) assertion of axioms and (iii) elementary ask functionality. The OWLlink extension mechanism allows to easily add any required functionality in a controlled way to the core language. We introduce OWLlink by providing a structural specification and a concrete binding of the interface that defines how OWLlink messages can be encoded in XML and sent over HTTP. 2008 Proceedings of the 5th OWLED Workshop on OWL: Experiences and Directions, collocated with the 7th International Semantic Web Conference (ISWC-2008), Karlsruhe, Germany, October 26-27, 2008 432 CEUR Workshop Proceedings Catherine Dolbear and Alan Ruttenberg and Ulrike Sattler owllink, OWL, OWL 2, Semantic Web SemanticTechnologies http://ceur-ws.org/Vol-432/owled2008eu_submission_26.pdf Thorsten Liebig Marko Luther Olaf Noppens Mariano Rodriguez Diego Calvanese Michael Wessel Matthew Horridge Sean Bechhofer Dmitry Tsarkov Evren Sirin inproceedings Bidot2008PlanRepair Hybrid Planning, the integration of hierarchical task decomposition and partial-order-causal-link planning provides a powerful mechanism to solve real-world planning problems. While the generation of hybrid plans is well understood, the problem of how to adequately deal with the various types of execution failures in this context has not yet been addressed. We present a domain-independent approach to plan repair in hybrid planning. It exploits the generation process of the failed plan by retracting decisions that led to the failed plan fragments. They are selectively replaced by suitable alternatives, and the repaired plan is completed by following the previous generation process as close as possible. This way, a stable solution is obtained, i.e. a repair of the failed plan that causes minimal perturbation. We show how plan repair fits into a formal framework for hybrid planning and present a generic refinement-retraction-and-repair algorithm. 2008 10.1007/978-3-540-85845-4_21 Proceedings of the 31st Annual German Conference on Artificial Intelligence (KI 2008) 5243 Springer Lecture Notes in Artificial Intelligence Andreas Dengel and Karsten Berns and Thomas Breuel and Frank Bomarius and Thomas R. Roth-Berghofer 169--176 Planning http://www.springerlink.com/content/7h142500k7211717/ http://www.springerlink.com/content/7h142500k7211717/fulltext.pdf Julien Bidot Susanne Biundo Bernd Schattenberg inproceedings noppens-libeig!08b An emerging trend in Web computing aims at collecting and integrating distributed data. For instance, community driven efforts recently have build ontological repositories made of large volumes of structured and interlinked data from various Web sources. Those repositories are extreme in the sense that they are extraordinary in size and dominated by assertional data incorporating only a small and typically lightweight schema. So far, users can find tools for building and browsing through large schemas but there is virtually no support in navigating, visualizing or even analyzing the data part of such a structured repository appropriately. This paper describes how to combine techniques from visual analytics and logical reasoning for interactive exploration of large volumes of interrelated data. Our approach utilizes visual abstraction techniques, semantical filters, as well as various level of detail information. The underlying visualization rationale is driven by the principle of providing detail information with respect to qualitative as well as quantitative aspects on user demand while offering an overview at any time. By means of our prototypical implementation and two real-world data sets we show how to answer several data specific tasks by interactive visual exploration. 2008 978-1-60558-141-5 10.1145/1385569.1385654 Proceedings of the working conference on Advanced Visual Interfaces (AVI 2008) ACM Press Stefano Levialdi 44--48 visualization SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2008/avi08-noppens.pdf Olaf Noppens Thorsten Liebig inproceedings noppens-liebig!08 Companies are faced with managing as well as integrating large collections of distributed data today. Here, the challenging task is not to store these volumes of structured and interlinked data but to understand and analyze its explicit or implicit relationships. However, up to date there is virtually no support in navigating, visualizing or even analyzing structured data sets of this appropriately. This paper describes novel rendering techniques enabling a new level of visual analytics combined with interactive exploration principles. The underlying visualization rationale is driven by the principle of providing detail information with respect to qualitative as well as quantitative aspects on user demand while offering an overview at any time. By means of our prototypical implementation and a real-world data set we show how to answer several data specific tasks by interactive visual exploration. 2008 Proceedings of the International Conferences on Knowledge Management and New Media Technology, Journal of Universal Computer Science Klaus Tochtermann and Hermann Maurer 341--348 visualization, ontology SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2008/ABoxVis.pdf Olaf Noppens Thorsten Liebig inproceedings Bidot2007SchedulingFramework There are many systems and techniques that address stochastic scheduling problems, based on distinct and sometimes opposite approaches, especially in terms of how scheduling and schedule execution are combined, and if and when knowledge about the uncertainties are taken into account. In many real-life problems, it appears that all these approaches are needed and should be combined, which to our knowledge has never been done. Hence it it first desirable to define a thorough classification of the techniques and systems, exhibiting relevant features: in this paper, we propose a tree-dimension typology that distinguishes between proactive, progressive, and revision techniques. Then a theoretical representation model integrating those three distinct approaches is defined. This model serves as a general template within which parameters can be tuned to implement a system that will fit specific application needs: we briefly introduce in this paper our first experimental prototypes which validate our model. 2007 Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007) 56--61 http://www.ijcai.org/papers07/Papers/IJCAI07-007.pdf Julien Bidot Thierry Vidal Philippe Laborie J. Christopher Beck inproceedings Schattenberg2007UnifyingFramework Many real-world application domains that demand planning and scheduling support do not allow for a clear separation of these capabilities. Typically, an adequate mixture of both methodologies is required, since some aspects of the underlying planning problem imply consequences on the scheduling part and vice versa. Several integration efforts have been undertaken to couple planning and scheduling methods, most of them using separate planning and scheduling components which iteratively exchange partial solutions until both agree on a result. This paper presents a framework that provides a uniform integration of hybrid planning –the combination of operator based partial order planning and abstraction based hierarchical task network planning– and a hierarchical scheduling approach. It is based on a proper formal account of refinement planning, which allows for the formal definition of hybrid planning, scheduling, and search strategies. In a first step, the scheduling functionality is used to produce plans that comply with time restrictions and resource bounds. We show how the resulting framework is thereby able to perform novel kinds of search strategies that opportunistically interleave what used to be separate planning and scheduling processes. 2007 10.1007/978-3-540-69912-5_27 Advances in Artificial Intelligence, Proceedings of the 29th German Conference on Artificial Intelligence (KI 2006) 4314 Springer Lecture Notes in Artificial Intelligence Christian Freksa and Michael Kohlhase and Kerstin Schill 361--373 Planning http://www.springerlink.com/content/3821231298565uk3/ http://www.springerlink.com/content/3821231298565uk3/fulltext.pdf Bernd Schattenberg Susanne Biundo inproceedings weithoenerl!07 The DIG protocol -- the de-facto standard for the communication between DL reasoners and their clients -- is currently being updated to a new version. The middleware mediates between different DIG protocols and allows to route requests to the appropriate server component 2007 Proceedings of the 3rd International Workshop on OWL: Experiences and Directions (OWLED 2007)

Insbruck, Austria

Bernardo Cuenca Grau and Pascal Hitzler and Conor Shankey and Evan Wallace owllink SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2007/owled07-weithoener.pdf Timo �±𾱳ٳ�ö�Ա�� Thorsten Liebig Marko Luther Sebastian ��ö�� inproceedings liebig-et-al_explaining!07 We argue that tableaux-based methods are valuable for explaining as well as providing clues for repairing an unwanted non-subsumption. In comparison to axiom pinpointing our approach currently is restricted in language expressivity, but more robust with respect to large amounts of axioms and provides more detailed explanations. An extension to ABox explanations seems possible. 2007 978-88-6046-008-5 Proceedings of the 2007 International Workshop on Description Logics (DL 2007)

Brixen, Italy

Diego Calvanese, Enrico Franconi, Volker Haarslev, Domenico Lembo, Boris Motik, Anni-Yasmin Turhan, Sergio Tessaris 537--538 explaining KnowledgeModeling,SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2007/liebig-et-al-dl07.pdf Thorsten Liebig Stephan Scheele Julian Lambertz inproceedings horridge-etal!07 This paper describes the design and implementation of an OWL 1.1 API, herein referred to as the OWL API . The API is designed to facilitate the manipulation of OWL 1.1 ontologies at a high level of abstraction for use by editors, reasoners and other tools. The API is based on the OWL 1.1 specification and influenced by the experience of designing and using the WonderWeb API and OWL-based applications. An overview of the basis for the design of the API is discussed along with major API functionality. The API is available from Source Forge: http://sourceforge.net/pro jects/owlapi. 2007 Proceedings of the OWLED 2007 Workshop on OWL: Experiences and Directions, Innsbruck, Austria, June 6-7, 2007 258 CEUR-WS.org CEUR Workshop Proceedings Christine Golbreich and Aditya Kalyanpur and Bijan Parsia OWL, OWL 2, Semantic Web, ontology SemanticTechnologies, KnowledgeModeling http://ceur-ws.org/Vol-258/paper19.pdf Matthew Horridge Sean Bechhofer Olaf Noppens inproceedings liebig-etal!07 The IMDb can be seen as an ontology made of a schema and a huge network of individuals. This allows to reason about movie data and to define filters in terms of declarative descriptions. We believe that many interesting queries about movies can be answered by interactive visual exploration utilizing browsing primitives such as aggregated club views, selective expansions, or drag-n-drop filters. 2007 Proceedings of the IEEE Information Visualization Contest 2007 (InfoVis 2007) IEEE Computer Society visualization SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2007/liebig-et-al-infovis07.pdf Thorsten Liebig Olaf Noppens Timo �±𾱳ٳ�ö�Ա�� inproceedings noppens-etal!07 The vision of a mobile Web in which everyday as well as business-related services are accessible from anywhere and anytime will become reality very soon. Mobile operators then have to meet the challenge not to overwhelm users with potentially interesting services but to allow them to easily discover individual services in a flexible and transparent way. This paper describes a novel user interface using a graphical preference specification paradigm which allows preference- based service discovery on cell phone devices. Our implementation adopts recent trends with respect to visualization techniques, like Scalable Vector Graphics for mobile devices (SVG Tiny), as well as semantic service discovery strategies. 2007 Proceedings of the 5th International Conference on Scalable Vector Graphics (SVG Open 2007) service discovery, HCI SemanticTechnologies http://www.svgopen.org/2007/papers/MobiXpl/index.html Olaf Noppens Thorsten Liebig Patrick Schmidt article PvH07 The Time-Triggered Protocol TTP/C constitutes the core of the communication level of the Time-Triggered Architecture for dependable real-time systems. TTP/C ensures consistent data distribution, even in the presence of faults occurring to nodes or the communication channel. However, the protocol mechanisms of TTP/C rely on a rather optimistic fault hypothesis. Therefore, an independent component, the central guardian, employs static knowledge about the system to transform arbitrary node failures into failure modes that are covered by the fault hypothesis. This paper presents a modular formal analysis of the communication properties of TTP/C based on the guardian approach. Through a hierarchy of formal models, we give a precise description of the arguments that support the desired correctness properties of TTP/C. First, requirements for correct communication are expressed on an abstract level. By stepwise refinement we show both that these abstract requirements are met under the optimistic fault hypothesis, and how the guardian model allows a broader class of node failures to be tolerated. The models have been developed and mechanically checked using the specification and verification system PVS. 2007 10.1016/j.ress.2006.10.006 Reliability Engineering & System Safety 92 1538--1550 11 10.1016/j.ress.2006.10.006 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2007/ress07.pdf Holger Pfeifer Friedrich von Henke inproceedings Schattenberg2007FlexibleStrategies This paper describes a system for the systematic construction and evaluation of planning strategies. It is based on a proper formal account of refinement planning and allows to decouple plan-deficiency detection, refinement computation, and search control. In adopting this methodology, planning strategies can be explicitly described and easily deployed in various system configurations. We introduce novel domain-independent planning strategies that are applicable to a wide range of planning capabilities and methods. These so-called HotSpot strategies are guided by information about current plan defects and solution options. The results of a first empirical performance evaluation are presented in the context of hybrid planning. 2007 10.1007/978-3-540-74565-5_28 Advances in Artificial Intelligence, Proceedings of the 30th German Conference on Artificial Intelligence (KI 2007) 4667 Springer

Osnabrück, Germany

Lecture Notes in Artificial Intelligence Joachim Hertzberg and Michael Beetz and Roman Englert 367--381 Planning http://www.springerlink.com/content/lx1l87180v450468/ http://www.springerlink.com/content/lx1l87180v450468/fulltext.pdf Bernd Schattenberg Julien Bidot Susanne Biundo inproceedings springerlink:10.1007/978-3-540-76890-6_41 Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL tableau calculus have been invented over the last decades. None of them aimed at parallelizing the tableau algorithm itself. This paper describes our approach for concurrent computation of the nondeterministic choices inherent to the standard tableau procedure. We discuss how this interrelates with the well-known optimization techniques and present first promising performance results when benchmarking our prototypical reasoner UUPR ( Ulm University Parallel Reasoner ) with a selection of established DL systems. 2007 978-3-540-76889-0 10.1007/978-3-540-76890-6_41 On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops 4806 Springer Berlin / Heidelberg Lecture Notes in Computer Science Robert Meersman and Zahir Tari and Pilar Herrero 1135--1144 SemanticTechnologies http://www.springerlink.com/content/6326156250h20826/ http://www.springerlink.com/content/6326156250h20826/fulltext.pdf Thorsten Liebig Felix ��ü������� inproceedings weithoener-etal!07 This work is motivated by experiences in the course of de- veloping an ontology-based application within a real-world setting. We found out that current benchmarks are not well suited to provide help- ful hints for users who seek for an appropriate reasoning system able to deal with expressive terminological descriptions, large volumes of asser- tional data, and frequent updates in a sound and complete way. This paper tries to provide some insights into currently available reasoning approaches and aims at identifying requirements to make future bench- marks more useful for application developers. 2007 978-3-540-72666-1 10.1007/978-3-540-72667-8_22 The Semantic Web: Research and Applications, Proceedings of the 4th European Semantic Web Conference (ESWC 2007) 4519 Springer Lecture Notes in Computer Science Enrico Franconi and Michael Kifer and Wolfgang May 296--310 OWL,reasoning SemanticTechnologies, AutomatedReasoning fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2007/eswc07-weithoener.pdf Timo �±𾱳ٳ�ö�Ա�� Thorsten Liebig Marko Luther Sebastian ��ö�� Friedrich von Henke Olaf Noppens article Schattenberg07HybridSoftware We present an architecture for planning and scheduling systems that addresses key requirements of real-world applications in a unique manner. It provides a robust, scalable, and flexible framework through the use of industrialstrength middleware and multi-agent technology. The architectural concepts extend knowledge-based components that dynamically perform and verify the system’s configuration; standardized components and communication protocols allow a seamless integration with third-party libraries and application environments. The system is based on a proper formal account of hybrid planning, the integration of HTN and POCL planning. The framework allows to decouple the detection of plan flaws, the computation of plan modifications, and search control. Consequently, planning and scheduling capabilities can be easily combined by orchestrating respective elementary modules and strategies. This platform can implement and evaluate various configurations of planning methods and strategies, without jeopardizing system consistency through interfering module activity. 2007 Künstliche Intelligenz 21 16--22 1 http://www.kuenstliche-intelligenz.de/archives/ki-journal-20160917/index.php-id=7754&tx_ki_pi1[showUid]=1248&cHash=6d9424bc18.html http://www.kuenstliche-intelligenz.de/archives/ki-journal-20160917/fileadmin/template/main/archiv/2007_1/realizing-schattenberg-web.pdf Bernd Schattenberg Steffen Balzer Susanne Biundo article SchattenbergKS07WorldOfPuK Dieser Serviceteil zum Themenschwerpunkt ``Planen / Scheduling und Konfigurieren / Entwerfen" soll dem interessierten Leser einen ersten Einblick in das vielschichtige Gebiet erleichtern. Die für den Bereich wichtigen Wettbewerbe werden im Artikel von Stefan Edelkamp vorgestellt. Die Autoren haben, der Breite des Themengebietes entsprechend, diese Übersicht möglichst weit angelegt, einen Anspruch auf Vollständigkeit kann jedoch nicht erhoben werden. Wir hoffen, dass dieser Artikel Ihnen als Ausgangsbasis für eigene Recherchen in diesem spannenden und dynamischen Forschungsfeld dienen kann. Aus diesem Grund sind alle Einträge, soweit möglich, mit den aktuellen URLs angegeben, um weitere on-line Recherchen möglichst effizient zu gestalten. 2007 Künstliche Intelligenz 21 44 1 http://www.kuenstliche-intelligenz.de/archives/ki-journal-20160917/index.php-id=7754&tx_ki_pi1[showUid]=1256&cHash=fa57c0ab2a.html Bernd Schattenberg Thorsten Krebs ����é Schumann inproceedings Weithoener2007RelationalReasoner This is a system description of the Ulm University Relational Reasoner (U2R2). The system merges rule based DL reasoning with technologies from relational database management systems. U2R2 implements a total forward chaining and materialization approach, which calculates and persistently stores all possible inferences whenever a knowledge base is loaded or altered. As a result U2R2 offers excellent query response times for TBox as well as ABox queries. The system is not limited by main memory restrictions as it leverages secondary storage, which allows to process huge knowledge bases even on standard desktop computers. Additional features include incremental reasoning, retraction, and availability of savepoints, which allow to restore previous system states. 2007 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning Yerevan, Armenia Short Paper Session Proceedings Nachum Dershowitz and Andrei Voronkov 55--59 AutomatedReasoning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2007/lpar07.pdf Timo �±𾱳ٳ�ö�Ա�� inproceedings noppens-liebig!07 Ontologies are now used within an increasing number of real-world applications. So far, significant effort has been spend in building tools to support users in creating, maintaining, and browsing the terminological part of an ontology. On the other hand, only little work has been done in supporting the user to explore the manifold interconnected assertional knowledge in order to analyze, visualize, and understand this network of individuals. In this paper, we present a new efficient visualization and editing approach which allows to investigate relationships within large volumes of interlinked individuals in order to grasp the structure of the assertional knowledge more easily. 2007 978-3-540-72666-1 10.1007/978-3-540-72667-8_58 The Semantic Web: Research and Applications, Proceedings of the 4th European Semantic Web Conference (ESWC 2007) 4519 Springer Lecture Notes in Computer Science Enrico Franconi and Michael Kifer and Wolfgang May 799--808 visualization SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2007/eswc07-noppens.pdf Olaf Noppens Thorsten Liebig inproceedings Bidot2007Architecture 2007 Actes des 2^es journées Francophones Planification, Décision, Apprentissage pour la conduite de systèmes (JFPDA)

Grenoble, France

13--24 Julien Bidot Thierry Vidal Philippe Laborie J. Christopher Beck inproceedings Mueller2006ADLReasoner 2006 Proceedings of the 2006 International Workshop on Description Logics (DL 2006)

Lake District, UK

SemanticTechnologies https://cs05.informatik.uni-ulm.de/ki/Noppens/publications/dl06.pdf Felix ��ü������� Michael Hanselmann Thorsten Liebig Olaf Noppens inproceedings liebig-etal!05 The success of the Semantic Web will largely depend on whether W3Cs Web Ontology Language can reach broad acceptance and a critical mass of industry-strength applications. We have been exploit- ing the use of OWL with a particular focus on tool support for ontology authoring and on providing access to the Semantic Web for mobile appli- cations. In the latter case our vision is to overlay the Semantic Web on ubiquitous computing environments making it possible to represent and interlink content and services as well as users, devices, their capabilities and the functionality they offer. In this paper we present our first expe- riences and lessons learned from early work and try to give constructive feedback for possible enhancements of OWL and its tools. 2006 Proceedings of the OWLED 2005 Workshop on OWL: Experiences and Directions 188 CEUR-WS.org CEUR Workshop Proceedings Bernardo Cuenca Grau and Ian Horrocks and Bijan Parsia and Peter F. Patel-Schneider OWL, Semantic Web, ontology SemanticTechnologies http://ceur-ws.org/Vol-188/sub28.pdf Thorsten Liebig Marko Luther Olaf Noppens Massimo Paolucci Matthias Wagner inproceedings turhan-etal!06 The DIG Interface provides an implementation-neutral mechanism for accessing Description Logic reasoner functionality. At a high level the interface can be realised as XML messages sent to the reasoner over HTTP connections, with the reasoner responding as appropriate. Key changes in the current version (DIG 2.0) include support for OWL 1.1 and well-defined mechanisms for extensions to the basic interface. 2006 Proceedings of the 2nd International Workshop on OWL: Experiences and Directions (OWLED 2006)

Athens, GA, USA

Bernardo Cuenca Grau and Pascal Hitzler and Conor Shankey and Evan Wallace owllink SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2006/owled06-turhan.pdf Anni-Yasmin Turhan Sean Bechhofer Alissa Kaplunova Thorsten Liebig Marko Luther Ralf ��ö������� Olaf Noppens Peter F. Patel-Schneider Suntisrivaporn Boontawee �±𾱳ٳ�ö�Ա�� Timo inproceedings noppens-liebig!06 The adaption of Semantic Web techniques in real-world applications showed that it becomes a more and more demanding issue to understand not only the conceptual knowledge of an ontology but also the highly dynamic knowledge consisting of individuals and relationships between them. In this paper, we present an visualization paradigm and a prototypical implementation which allows to interactively browse large sets of individuals and to discover relationships between them in an easy and animated manner. The approach is optimized for efficient navigation as well as manipulation of ontologies containing a large number of individuals. 2006 Proceedings of the 3rd International Semantic Web User Interaction Workshop (SWUI'06) OWL, visualization, ontology SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2006/swui06-noppens.pdf Olaf Noppens Thorsten Liebig inproceedings Schattenberg06KnowledgeBasedMiddleware We present an architecture that provides a robust, scalable and flexible software framework for planning and scheduling systems through the use of standardized industrial-strength middleware and multi-agent technology. It utilizes knowledgebased components that dynamically perform and verify the system's configuration. The system is based on a proper formal account of hybrid planning, the integration of HTN and POCL planning, which allows to decouple flaw detection, modification computation,and search control. In adopting this methodology, planning and scheduling capabilities can be easily combined by orchestrating respective elementary modules and strategies without jeopardizing system consistency through interfering module activity. 2006 Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS 2006) AAAI Press

Ambleside, The English Lake District, UK

Derek Long and Stephen F. Smith and Daniel Borrajo and Thomas Lee McCluskey 422--425 Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2006/Schattenberg06KnowledgeBasedMiddleware.pdf Bernd Schattenberg Steffen Balzer Susanne Biundo inproceedings noppens-etal!06 Mobile music selection is becoming an emerging market.So far only little work has been spent in selection of semantically enriched music streams on tiny mobile devices. This paper discusses how ontology-based preferences can be used for the selection of mobile music and presents a service discovery toolbox which is responsible for service matchmaking and preference relaxation. On the basis of this toolbox we developed a ubiquitous user interface using a graphical service discovery paradigm. 2006 Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling service discovery SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2006/mwap06-noppens.pdf Olaf Noppens Marko Luther Matthias Wagner Massimo Paolucci techreport liebig-reasoning-insights!06 This report aim at summarizing the current activities around OWL, the Web Ontology Language. At first, the report will present details about the current effort towards a revision of the official OWL W3C recommendation, known as OWL 1.1. Secondly, it describes a selection of inference engines while discussing different approaches as well as conceptual limits. These systems are then empir- ically evaluated using a set of spot tests which are intentionally designed to be hard to solve but small in size. Thirdly, it discusses actual trends and forthcoming developments in the context of ontology development and ontology reasoning. As a whole this report tries to provide some insights into currently available rea- soning systems in order to serve as a decision help for Semantic Web application designers. Ulmer Informatik Berichte 2006 Ulm University 2006-04 reasoning SemanticTechnologies,AutomatedReasoning fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2006/TR-U-Ulm-2006-04.pdf Thorsten Liebig inproceedings Schattenberg2006WebTechnology This paper presents an architecture for planning and scheduling systems that addresses key requirements of real-world applications in a unique manner. The system provides a robust, scalable and flexible framework for planning and scheduling software through the use of industrial-strength middleware and multi-agent technology. The architectural concepts extend knowledge-based components that dynamically perform and verify the system's configuration. The use of standardized components and communication protocols allows a seamless integration with third-party libraries and existing application environments. The system is based on a proper formal account of hybrid planning, the integration of HTN and POCL planning. The theoretical framework allows to decouple flaw detection, modification computation, and search control. In adopting this methodology, planning and scheduling capabilities can be easily combined by orchestrating respective elementary modules and strategies. The conceptual platform can be used to implement and evaluate various configurations of planning methods and strategies, without jeopardizing system consistency through interfering module activity. 2006 Proceedings of the 20th Workshop ``Planen und Konfigurieren´´ (PuK 2006)

University of Bremen

Jürgen Sauer 26--36 Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2006/Schattenberg2006WebTechnologySlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2006/Schattenberg2006WebTechnology.pdf Bernd Schattenberg Steffen Balzer Susanne Biundo inproceedings Bidot2006 The problem we tackle is progressive scheduling with temporal and resource uncertainty. Operation durations are imprecise and alternative resources may break down. Operation end times and resource breakdowns are observed during execution. In this paper, we assume we have a representation of uncertainty in the form of probability distributions which are used in the simulation of schedule execution. We generate the schedule piece by piece during execution and use simulation to monitor the execution of the partial schedule. This paper describes the basis on which the decision to select and schedule a new subset of operations is made 2006 10.3182/20060517-3-FR-2903.00313 Proceedings of the Twelfth IFAC Symposium on Information Control Problems in Manufacturing (INCOM 2006) https://cs05.informatik.uni-ulm.de/ki/Bidot/INCOM06.pdf Julien Bidot Philippe Laborie J. Christopher Beck Thierry Vidal inproceedings weithoener-et-al!06 This paper is motivated by experiences in course of developing an ontology-based application within a real-world setting. When comparing these experiences with results of well-known benchmarks we found out that current benchmarks are not well suited to provide helpful hints for application developers who seek for a reasoning system matching typical real-world needs. This work aims at identifying requirements to make future benchmarks more useful for application developers. 2006 Proceedings of the Second International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS 2006)

Athens, GA, USA

101--114 reasoning SemanticTechnologies, AutomatedReasoning fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2006/weithoener-et-al-ssws06.pdf �±𾱳ٳ�ö�Ա�� Timo Thorsten Liebig Marko Luther Sebastian ��ö�� inproceedings liebig-halfmann!05 This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFr+ TBoxes. 2005 10.1007/11554554_26 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2005) 3702 Springer Berlin / Heidelberg Lecture Notes in Computer Science Beckert, Bernhard 323--327 explaining AutomatedReasoning,SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2005/liebig-halfmann-tableaux05.pdf Thorsten Liebig Michael Halfmann inproceedings pantschenko-etal!05 2005 W3C Workshop on Frameworks for Semantic in Services (W3C SWSF) reasoning, service discovery SemanticTechnologies, KnowledgeModeling fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2005/swsf-pantschenko-et-al.pdf Konstantin Pantschenko Olaf Noppens Thorsten Liebig inproceedings Schattenberg05FlexibleStrategies In this paper we present a highly modular planning system architecture. It is based on a proper formal account of hybrid planning, which allows for the formal definition of (flexible) planning strategies. Groups of modules for flaw detection and plan refinement provide the basic functionalities of a planning system. The concept of explicit strategy modules serves to formulate and implement strategies that orchestrate the basic modules. This way a variety of fixed plan generation procedures as well as novel flexible planning strategies can easily be implemented and evaluated. We present a number of such strategies and show some first comparative performance results. 2005 3-540-28761-2 10.1007/10.1007/11551263_21 Advances in Artificial Intelligence, Proceedings of the 28th German Conference on Artificial Intelligence (KI 2005) 3698 Springer-Verlag Berlin Heidelberg Lecture Notes in Artificial Intelligence 249--263 Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2005/Schattenberg05FlexibleStrategiesSlides.pdf http://www.springerlink.com/content/ab18236tekp4wvfu/ http://www.springerlink.com/content/ab18236tekp4wvfu/fulltext.pdf Bernd Schattenberg Andreas Weigl Susanne Biundo article liebig-noppens!05 OntoTrack is an ontology authoring tool that combines a graph-based hierarchical layout and instant reasoning feedback within one single view. Currently OntoTrack can handle ontologies with an expressivity almost comparable to OWL Lite. The graphical representation provides an animated and zoomable subsumption graph with context sensitive features such as click-able miniature branches or selective detail views, together with drag-and-drop editing. Each editing step is instantly synchronised with an external reasoner in order to provide appropriate graphical feedback about relevant modelling consequences. A recent extention of OntoTrack provides an on-demand textual explanation for subsumption relationships between classes. This paper describes the key features of the current implementation and discusses future work, as well as some development issues. 2005 10.1016/j.websem.2005.06.004 Web Semantics: Science, Services and Agents on the World Wide Web 3 116--131 2 OWL, Semantic Web, ontology SemanticTechnologies, KnowledgeModeling Thorsten Liebig Olaf Noppens incollection Biundo05PlanningUnderTemporalUncertainty This paper presents an approach towards probabilistic planning with continuous time. It adopts stochastic concepts for continuous probabilities and integrates them into an HTN-based planning framework. Based on uncertain time durations associated with primitive tasks the time consumption probabilities of non-linear plans can be accumulated and thus an overall probability for a successful execution of complex plans can be computed. Furthermore, heuristics for the decomposition of abstract tasks can be derived that guide the search towards plans with a minimized average value/variance of their overall time consumption. An example from software project planning is used to demonstrate our approach. 2005 Planning, Scheduling, and Constraint Satisfaction: From Theory to Practice 117 IOS Press Frontiers in Artificial Intelligence and Applications Luis A. Castillo and Daniel Borrajo and Miguel A. Salido and Angelo Oddi 189--198 Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/Biundo04ProjectPlanning.pdf Susanne Biundo Roland Holzer Bernd Schattenberg inproceedings balzer-liebig!04 OWL-S is one of the emerging standards for the semantic description of web services in order to enable their automatic discovery, execution and composition by software agents. An important task within automatic execution of OWL-S services is the bi-directional mapping between semantically higher level OWL-S service parameter descriptions and primitive XML Schema types of its grounding. OWL-S proposes to utilize XSL Transformations (XSLTs) for the mapping between this representation levels. However, this approach has a substantial shortcoming due to the fact that one OWL model can have many different RDF serializations whereas each requires a specific XSL stylesheet in the worst case. This severely limits the practical applicability of OWL-S in general. In this paper we present a simple but powerful approach of OWL-S parameter type mappings on a semantical basis. We therefore define an RDFS ontology of RDF Mappings that enable mappings between OWL and XML Schema types into simple XML Schema types and vice versa. We show how to integrate RDF Mappings into the OWL-S grounding ontology and prove their feasibility by describing our prototypical implementation 2004 Proceedings of the International Workshop on Semantic Web Services: Preparing to Meet the World of Business Applications

Hiroshima, Japan

reasoning SemanticTechnologies,KnowledgeModeling fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/SWS2004-Balzer-Final.pdf Steffen Balzer Thorsten Liebig inproceedings Biundo04ContinuousResources This paper presents an approach towards probabilistic planning with continuous resources. It adopts stochastic concepts for continuous probabilities and integrates them into a STRIPS-based planning framework. The approach enables the construction of plans that are guaranteed to meet certain probability thresholds w.r.t. the consumption of critical resources. Furthermore, the consumption probabilities of multiple resources can be accumulated and thus an overall probability for a successful execution of an aggregate plan can be computed. We extend our approach to HTN-based planning and show how heuristics can be derived that lead to plans with a minimized average value/variance of their overallresource consumption. 2004 Proceedings of the 4th International Workshop on Planning and Scheduling for Space (IWPSS 2004) European Space Agency Publications Division

ESA-ESOC, Darmstadt, Germany

213--218 WPP-228 Planning /fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/Biundo04ContinuousResources.pdf Susanne Biundo Roland Holzer Bernd Schattenberg inproceedings weithoener-et-al!04 Today ontologies are heavily used in the sematic web. As they grow in size reasoning systems canrsquot work without secondary storage anymore. Thus database technology is required for storing and processing huge ontologies. In this paper we present an efficient technique for representing and reasoning with ontologies in databases. We also present some benchmarking results in comparison with previous approaches. 2004 10.1007/978-3-540-30470-8_13 Proceedings of the International Conference on Ontologies, Databases and Application of Semantics (ODBASE 2004) Springer Berlin / Heidelberg Lecture Notes in Computer Science 28--29 3292 reasoning SemanticTechnologies,AutomatedReasoning fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/weithoener-et-al-odbase04.pdf �±𾱳ٳ�ö�Ա�� Timo Thorsten Liebig ��ü�Գٳ��� Specht inproceedings PvH04b The Time-Triggered Architecture is a distributed computer architecture for the implementation of highly dependable real-time systems specifically targeting embedded applications, such as digital control systems in the automotive and avionics domain. We have formally modelled and analysed various aspects of the underlying communication protocol TTP/C and its fault tolerance properties. This paper provides an overview of these analyses from a broader perspective and describes the relationships between the individual items. The algorithms implementing the basic protocol services of TTP/C are heavily intertwined and pose challenging problems for formal analysis. This is true not only with regard to the construction of formal proofs, but also for the development of the formal models themselves. We argue that an adequate structuring of the models and proofs along different levels of abstraction is necessary to enable the formal modelling of the central protocol algorithms, make their analysis feasible, and resolve the mutual dependencies among the services. 2004 Proceedings of the 5th Symposium on Formal Methods for Automation and Safety in Railway and Automotive Systems (FORMS/FORMAT 2004) Technical University of Braunschweig, Institute for Traffic Safety and Automation Engineering E. Schnieder and G. Tarnai 230--240 https://cs05.informatik.uni-ulm.de/ki/Pfeifer/forms2004.pdf Holger Pfeifer Friedrich von Henke inproceedings Sorea04LazyApproximation We propose an effective and complete method for verifying safety andliveness properties of timed systems, which is based on predicate abstraction forcomputing finite abstractions of timed automata and TCTL formulas, finite-stateCTL model checking, and successive refinement of finite-state abstractions. Startingwith some coarse abstraction of the given timed automaton and the TCTLformula we define a finite sequence of refined abstractions that converges to theregion graph of the real-time system. In each step, new abstraction predicatesare selected nondeterministically from a finite, predetermined basis of abstractionpredicates. Symbolic counterexamples from failed model-checking attemptsare used to heuristically choose a small set of new abstraction predicates for incrementallyrefining the current abstraction. Without sacrificing completeness,this algorithm usually does not require computing the complete region graph todecide model-checking problems. Abstraction refinement terminates quickly, asa multitude of spurious counterexamples is eliminated in every refinement stepthrough the use of symbolic counterexamples for TCTL. 2004 3-540-23167-6 10.1007/978-3-540-30206-3_25 Proceedings of the Joint Conference Formal Modelling and Analysis of Timed Systems (FORMATS) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT) 3253 Springer Lecture Notes in Computer Science Yassine Lakhnech and Sergio Yovine 363--378 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/Sorea04Lazy.pdf Maria Sorea inproceedings SRSP04 The increasing performance of modern model-checking tools offers high potential for the computer-aided design of fault-tolerant algorithms. Instead of re lying on human imagination to generate taxing failure scenarios to probe a fault-tolerant algorithm during development, we define the fault behavior of a faulty process at its interfaces to the remaining system and use model checking to automatically examine all possible failure scenarios. We call this approach "exhaustive fault simulation". In this paper we illustrate exhaustive fault simulation using a new startup algorithm for the Time-Triggered Architecture (TTA) and show that this approach is fast enough to be deployed in the design loop. We use the SAL toolset from SRI for our experiments and describe an approach to modeling and analyzing fault-tolerant algorithms that exploits the capabilities of tools such as this. 2004 Proceedings of the International Conference on Dependable Systems and Networks IEEE Computer Society

Florence, Italy

189--198 http://doi.ieeecomputersociety.org/10.1109/DSN.2004.1311889 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/dsn04.pdf Wilfried Steiner John Rushby Maria Sorea Holger Pfeifer inproceedings PvH04 We present a modular formal analysis of the communication properties of the Time-Triggered Protocol TTP/C based on the guardian approach. The guardian is an independent component that employs static knowledge about the system to transform arbitrary node failures into failure modes that are covered by the rather optimistic fault hypothesis of TTP/C. Through a hierarchy of formal models, we give a precise description of the arguments that support the desired correctness properties of TTP/C. First, requirements for correct communication are expressed on an abstract level. By stepwise refinement we show that the abstract requirements are met under the optimistic fault hypothesis, and how the guardian model allows a broader class of failures be tolerated. 2004 Proceedings of the 23rd International Conference on Computer Safety, Reliability, and Security (SAFECOMP) 3219 Springer

Potsdam, Germany

Lecture Notes in Computer Science Maritta Heisel and Peter Liggesmeyer and Stefan Wittmann 240--253 https://cs05.informatik.uni-ulm.de/ki/Pfeifer/safecomp2004.pdf Holger Pfeifer Friedrich von Henke inproceedings liebig-noppens!04b The following provides a short description of OntoTracks main features. In concrete, OntoTrack provides a sophisticated graph-based ontology layout with animated expansion and de-expansion of class descendants, zooming, and paning. Uses elaborated layout techniques like click-able miniature branches or selective detail views. Allows for editing features like mouse-over anchor buttons, graphical selections or restriction editing without switching into a special editing layout. Synchronizes every single editing step with an external reasoner in order to provide instant feedback about relevant modeling consequences. Implements instant search highlighting or an overlay representation of classes and properties. 2004 The Semantic Web - ISWC 2004: Third International Semantic Web Conference, Hiroshima, Japan, November 7-11, 2004. Demo Track Semantic Web, Ontology, OWL SemanticTechnologies,KnowledgeModeling fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/iswc04demo-liebig.pdf Thorsten Liebig Olaf Noppens inproceedings liebig-noppens!04 OntoTrack is a new browsing and editing ``in-one-view" ontology authoring tool that combines a hierarchical graphical layout and instant reasoning feedback for (the most rational fraction of) OWL Lite. OntoTrack provides an animated and zoomable view with context sensitive features like click-able miniature branches or selective detail views together with drag-and-drop editing. Each editing step is instantly synchronized with an external reasoner in order to provide appropriate graphical feedback about relevant modeling consequences. The most recent feature of OntoTrack is an on demand textual explanation for subsumption and equivalence between or unsatisfiability of classes. This paper describes the key features of the current implementation and discusses future work as well as some development issues. 2004 3-540-23798-4 10.1007/978-3-540-30475-3_18 Proceedings of the Third International Semantic Web Conference (ISWC 2004) 3298 Springer Lecture Notes in Computer Science Sheila A. McIlraith and Dimitris Plexousakis and Frank van Harmelen 244--258 OWL, OWL2, Semantic Web, ontology, visualization SemanticTechnologies, KnowledgeModeling fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/iswc04-liebig.pdf Thorsten Liebig Olaf Noppens inproceedings balzer-et-al!04 OWL-S is a combined effort of the Semantic Web and the Web Service community to facilitate an intelligent service provisioning on the Semantic Web. The vision of OWL-S includes automatic service discovery, invocation, composition, orchestration and monitoring of Web-Services through their semantic descriptions. In this paper, we investigate the practical applicability of the current OWL-S specification and show that, in spite of the large momentum of OWL-S, significantly more work needs to be done before the vision of truly intelligent Semantic Web Services can become true. We therefore study the case of an autonomous travel agent that helps users with online hotel arrangements. The aim of our work is twofold: on the one side, we show step-by-step how a prototypical implementation can be realized based on current semantic technologies around UDDI, WSDL, and SOAP. On the other hand, we reveal pitfalls in the current version of OWL-S that severely limit its support for mechanizing service discovery, configuration, combination and automated execution. Throughout the paper, we present practical solutions and workarounds to existing OWL-S shortcomings and hope to therewith further stimulate the ongoing work on Semantic Web Services. 2004 10.1145/1035167.1035209 Proceedings of the 2nd International Conference on Service Oriented Computing (ICSOC 2004) ACM Press

New York City, USA

289--298 reasoning SemanticTechnologies,KnowledgeModeling fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/balzer-et-al-icsoc04.pdf Steffen Balzer Thorsten Liebig Matthias Wagner inproceedings Biundo04ProjectPlanning This paper presents an approach towards probabilistic planning with continuous time. It adopts stochastic concepts for continuous probabilities and integrates them into an HTN-based planning framework. Based on uncertain time durations associated with primitive tasks the time consumption probabilities of non-linear plans can be accumulated and thus an overall probability for a successful execution of complex plans can be computed. Furthermore, heuristics for the decomposition of abstract tasks can be derived that guide the search towards plans with a minimized average value/variance of their overall time consumption. An example from software project planning is used to demonstrate our approach. 2004 Proceedings of the Workshop on Planning and Scheduling: Bridging Theory to Practice at The 16th European Conference on Artificial Intelligence (ECAI 2004) Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/Biundo04ProjectPlanningSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/Biundo04ProjectPlanning.pdf Susanne Biundo Roland Holzer Bernd Schattenberg inproceedings liebig-pfeifer-vonhenke!04 OWL has been designed to be a formal language for representing ontologies in the Semantic Web. In short, OWL is the result of combining an expressive Description Logic (DL) with techniques and standards of the Web. DLs have been well studied in the eld of knowledge representation over the last decades. As one result, some highly optimized DL reasoners have been implemented, which provide an excellent starting point for building a sound and complete OWL DL/Lite reasoner. However, having a traditional DL system with standard functionality is not enough in the current context. So far, DL systems have been used by KR experts mainly in isolated application domains. Now, in order to make the Semantic Web happen far more exible and interactive DL-based tools are needed for building, maintaining, linking, and applying ontologies even for non-experienced users. The importance of so-called non-standard inference services that support building and maintaining knowledge bases has been pointed out recently. We argue that the availability of those inference services is a fundamental premise for upcoming real-world SemanticWeb systems and applications. Our experience in the course of developing the graphical ontology editor OntoTrack is a prime example here. 2004 1613-0073 Proceedings of the 2004 International Workshop on Description Logics (DL 2004) ontology SemanticTechnologies,KnowledgeModeling http://www.CEUR-WS.org/Vol-104/09Liebig-final.pdf Thorsten Liebig Holger Pfeifer Friedrich von Henke inproceedings LPvH:DL04 OWL has been designed to be a formal language for representing ontologies in the Semantic Web. In short, OWL is the result of combining an expressive Description Logic (DL) with techniques and standards of the Web. DLs have been well studied in the field of knowledge representation over the last decades. As one result, some highly optimized DL reasoners have been implemented, which provide an excellent starting point for building a sound and complete OWL DL/Lite reasoner. However, having a traditional DL system with standard functionality is not enough in the current context. So far, DL systems have been used by KR experts mainly in isolated application domains. Now, in order to make the Semantic Web happen far more flexible and interactive DL-based tools are needed for building, maintaining, linking, and applying ontologies even for non-experienced users. The importance of so-called non-standard inference services that support building and maintaining knowledge bases has been pointed out recently. We argue that the availability of those inference services is a fundamental premise for upcoming real-world SemanticWeb systems and applications. Our experience in the course of developing the graphical ontology editor OntoTrack is a prime example here. 2004 Proceedings of the 2004 International Workshop on Description Logics - DL2004 104

Whistler, Canada

CEUR Workshop Proceedings, ISSN 1613-0073, online CEUR-WS.org/Vol-104/09Liebig-final.pdf Volker Haarslev and Ralf ��ö������� https://cs05.informatik.uni-ulm.de/ki/Liebig/papers/liebig-pfeifer-vhenke-dl04.pdf Thorsten Liebig Holger Pfeifer Friedrich von Henke inproceedings wagner-et-al!04 The vision of a mobile Web in which the computing environment will be composed of various devices that are carried by different users as they go through their daily routine might soon become a reality. In this context, Web services and the Semantic Web are already recognized as important building blocks. On the other hand, so far only little work has been done to support the discovery and selection of semantically enriched Web services on mobile terminals. In this paper we present a graphical toolbox for preference-based service discovery on tiny mobile devices. Our prototypical toolbox is developed as an extension of the Protéegé OWL plugin and consists of a component called MobiOnt responsible for service matchmaking and preference relaxation together with an emulator for different mobile devices called MobiXpl. Our work aims to serve as an open platform in order to gain experiences with different discovery strategies as well as mobile end-user interfaces. 2004 Proceedings of the International Workshop on Semantic Web Technology for Mobile and Ubiquitous Applications

Hiroshima, Japan

service discovery KnowledgeModeling,SemanticTechnologies fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2004/iswc2004_ws_mobiONT.pdf Matthias Wagner Thorsten Liebig Steffen Balzer Wolfgang Kellerer phdthesis Sorea04 We develop in this thesis effective verification techniques for real-time systems based on novel combinations of theorem proving and model checking. Although the resulting algorithms do not improve the worst-case complexity, they are usually much more effective in practice, since state spaces are only explored on demand. Moreover, in contrast to dedicated model-checking techniques for real-time systems, our algorithms are not restricted to specific modeling formalisms such as timed automata, and are therefore applicable for a much larger class of problems.The main contribution, lazy approximation, is an effective and complete method for verifying safety and liveness properties of real-time systems, and is based on predicate abstraction for timed automata, finite-state model checking, and counterexample-guided abstraction refinement. This is the first time that predicate abstraction is used for model checking real-time systems specified with real-time logics. This method is also complete for verifying liveness properties. The proposed technique is lazy in that approximations of real-time systems are computed on demand and incrementally refined until the desired property is refuted or verified. In this way, lazy approximation is significantly less memory and time consuming than conventional, region graph based verification methods for real-time systems.Lazy approximation requires information about counterexamples from failed model-checking attempts on the abstract, finite state space. We define a general form of counterexamples both for CTL and TCTL logics, in a symbolic way, as sequences over sets of states. We use symbolic counterexamples in the abstraction-refinement algorithm as a heuristic for selecting new abstraction predicates from the given set of abstraction predicates. The use of symbolic counterexamples for the lazy refinement of approximations has two main advantages compared to refinement methods based on linear counterexamples. First, the refinement process converge more quickly towards a strongly preserving abstraction since multiple spurious counterexamples are discarded in every refinement step. Second, lazy approximation is applicable for full TCTL, and not only for a fragment of universal formulas as is the case when using linear counterexamples.Bounded model checking (BMC) has been recently introduced as a technique for finding bugs in finite state systems. We extend the BMC paradigm to timed automata and LTL formulas augmented with a decidable set of clock constraints, and show that this yields a complete refutation method for real-time systems. Through the technique of k-induction it is possible to extend BMC for timed automata to proof by induction, providing therefore a complete verification method for timed automata and invariant properties.The model-checking problem for real-time systems can be recast as a validity problem in an appropriate logic, which in turn can be solved using theorem proving. Unfortunately, the satisfiability problem for existing branching-time logics with dense-time models is undecidable. We introduce the Event-Recording Logic (ERL) as a real-time extension of the modal mu-calculus with clock variables. ERL is the first decidable real-time logic for specifying branching-time properties of real-time systems. The decidability problem is shown to be EXPTIME complete. PhD Thesis 2004 University of Ulm http://www.cs.man.ac.uk/~msorea/diss/diss.pdf Maria Sorea inproceedings zimmermann03ASMModeling We present a framework for formalizing the semantics of expression evaluation using Abstract State Machines. Many programming languages allow some non-determinism for evaluating expressions. The semantics only have in common that arguments are evaluated before an operator is applied. The evaluation of one argument may be interleaved with the evaluation of the other arguments. However, programming languages usually restrict this most liberal evaluation order. For example, the expression evaluation may take into account short-circuit evaluation of boolean expressions which implies that right operands must not be evaluated before the complete left operand is evaluated. Our approach provides a generic expression evaluation semantics that only need to be instantiated adequatly. We demonstrate this approach by the example of Ada95, C, C++, Java, C#, and Fortran. 2003 Abstract State Machines 2003 -- Proceedings of the 10th International Workshop, ASM 2003 391--406 http://www.informatik.uni-ulm.de/ki/Dold/expressions.pdf Wolf Zimmermann Axel Dold phdthesis Herbst03phd PhD Thesis 2003 University of Ulm Joachim Herbst phdthesis luther03phd This thesis contributes to the construction of a convenient specification language on top of a type theoretic substrate. The subject arose in the context of the Typelab project that aimed at improving the machine assistance for the formal development of mathematics, software and hardware. Type theory was chosen as underlying theoretical framework, because it homogeneously comprises both the notion of computation and deduction. However, the price for its expressiveness is a verbose syntax. When I joined the Typelab group, my responsibility was to shape the external language of the Typelab system. Naturally, I first looked at related implementations. Most of them cope with the wordiness of type theory by allowing their users to omit on input redundant parts that can be inferred automatically through a process called elaboration. While the use of such a mechanism seems indispensable for serious verification tasks, I found the existing solutions unsatisfactory. Not only are the implemented algorithms seldom precisely documented and formally analyzed, they also lack strength. It is disappointing how much redundant information still has to be supplied on input. Furthermore, the ad hoc erasure algorithms, used to reduce the redundancy of expressions on output, often produce wordy or even ambiguous external representations. Such failures are especially fatal for interactive verification systems, where the output describing the actual system state is often the only hint for a user on how to proceed with a proof. To improve this situation, I developed the elaboration and erasure methods described in this thesis. The design of elaboration is inspired by the conciseness of functional programming languages and is formally grounded on type inference in the underlying type theory. To establish correctness, intermediate elaboration states are represented by open terms, adapting techniques recently developed for the representation of partial proofs. The erasure methods are based on estimations of the corresponding elaboration process and guarantee a successful reconstruction of the elided information. Experiments performed with Typelab proved the proposed methods both effective and efficient. PhD Thesis 2003 Universität Ulm

Germany

http://www.informatik.uni-ulm.de/ki/Papers/luther03-diss.pdf Marko Luther phdthesis Pfe03 This thesis is about formal analysis of fault-tolerant algorithms implemented in the Time-Triggered Protocol TTP/C. The services provided by this communication protocol are characterized by a deep integration and mutual dependencies, which constitute significant sources of complicacy for formal analysis in addition to the inherent difficulty of analyzing fault-tolerant distributed algorithms. Consequently, the main goal of this thesis is to explore and develop techniques to structure and organize the formal models that describe the protocol services and the fault assumptions, as well as the proofs in a way that enables the required correctness properties be established. Due to their central role for TTP/C we concentrate the formal analysis on the two most important algorithms of the protocol, namely clock synchronization and group membership. Because of the immense complexity and detail of TTP/C a formal approach must try to isolate the core algorithms from the integrated protocol and analyse them separately. However, as the services are tightly intertwined, the process of isolating a particular service also amounts to identifying the dependencies on and suitable interfaces to other protocol parts. On the other hand, if the formal analysis of a particular service is carried out in isolation of other protocol aspects, the question arises whether any correctness statements are meaningful for the integrated protocol. Therefore, the formal models and proofs must be structured in a way that enables the various isolated analyses to be combined into a larger context. In order to do so, the formal models must provide interfaces through which other models or proofs can exchange information or other requirements. For the provision of these interfaces abstraction plays a crucial role. We show how two flavours of abstraction techniques can provide the required separation of protocol services of TTP/C without compromising the possibility of adequately integrating the different analyses. Altogether, the formal analysis contributes to providing an isolated formal model for the single services, a clear statement of the interfaces and mutual dependencies, the realization of correctness propositions for the individual services, and finally, the demonstration of the validity of these correctness arguments for the integrated protocol description. PhD Thesis 2003 Ulm University

Germany

https://cs05.informatik.uni-ulm.de/ki/Papers/pfeifer03-diss.pdf Holger Pfeifer inproceedings liebig-noppens!03 OntoTrack is a new browsing and editing ``in-one-view" ontology authoring tool. It combines a sophisticated graphical layout with mouse enabled editing features optimized for efficient navigation and manipulation of large ontologies. The system is based on SpaceTree [PGB02] and implemented in Java2D. OntoTrack provides animated expansion and de-expansion of class descendants, zooming, paning and uses elaborated layout techniques like click-able miniature branches or selective detail views. At the same time OntoTrack allows for quite a number of editing features using mouse-over anchor buttons and graphical selections without switching into a special editing layout. In addition, every single editing step is synchronized with an external reasoner in order to provide instant feedback about relevant modeling consequences. 2003 Proceedings of the 2nd International Workshop on Evaluation of Ontology-based Tools (EON 2004) 87 CEUR-WS.org CEUR Workshop Proceedings York Sure and Oscar Corcho OWL, OWL 2, Sematnic Web, ontology, visualization SemanticTechnologies, KnowledgeModeling http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS//Vol-87/EON2003_Liebig.pdf Thorsten Liebig Olaf Noppens inproceedings weithoener-et-al!03 The intersection of Description Logic inspired ontology lan- guages with Logic Programs has been recently analyzed in [GHVD03]. The resulting language, called Description Logic Programs, covers RDF Schema and a notable portion of OWL Lite. However, the proposed map- ping in [GHVD03] from the corresponding OWL fragment into Logic Programs has shown scalability as well as representational deficits within our experiments and analysis. In this paper we propose an alternative mapping resulting in lower computational complexity and more repre- sentational flexibility. We also present benchmarking results for both mappings with ontologies of different size and complexity. 2003 Proceedings of the First International Workshop on Semantic Web and Databases (SWDB'03)

Berlin, Germany

329--348 reasoning SemanticTechnologies,AutomatedReasoning fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2003/swdb03-weithoener_etal.pdf �±𾱳ٳ�ö�Ա�� Timo Thorsten Liebig ��ü�Գٳ��� Specht techreport Dold02RealisticCompiler We report on a large formal verification effort in mechanically proving correct a compiling specification for a realistic bootstrap compiler from ComLisp (a subset of ANSI Common Lisp sufficiently expressive to serve as a compiler implementation language) to binary Transputer code using the PVS system. The compilation is carried out in five steps through a series of intermediate languages. In the first phase, ComLisp is translated into a stack intermediate language (SIL), where parameter passing is implemented by a stack technique. Expressions are transformed from a prefix notation into a postfix notation according to the stack principle. SIL is then compiled into Cint where the ComLisp data structures (s-expressions) and operators are implemented in linear integer memory using a run-time stack and a heap. These two steps are machine independent. In the compiler’s backend, first control structures (loops, conditionals) of the intermediate language Cint are implemented by linear assembler code with relative jumps, the infinite memory model of Cint is realized on the finite Transputer memory, and the basic Cint statements for accessing the stack and heap are implemented by a sequence of assembler instructions. The fourth phase consists of the implementation of code instructions with large and negative word operands, while the last phase is concerned with the integration of the assembly program into the memory. The context of this work is the joint research effort Verifix aiming at developing methods for the construction of correct compilers for realistic programming languages and real target architectures. 2002 University of Ulm UIB 03-02 http://vts.uni-ulm.de/docs/2005/5349/vts_5349.pdf Axel Dold Friedrich von Henke Vincent Vialard Wolfgang Goerigk inproceedings Seitz02AnthoringSystem This paper describes the design and implementation of a domain independent authoring tool for tutoring systems. The presented work incorporates standard authoring features, including a hierarchical development of learning material, but also supports users in a didactically suitabledesign of the tutoring process. Requirements for the realization of Goal Based Scenarios are fulfilled by a number of implemented add-ons. 2002 Proceedings of the International Conference on Computers in Education (ICCE’02) 1317--1318 http://www.computer.org/csdl/proceedings/icce/2002/1509/00/15091317.pdf Alexander Seitz Matthias Dannenberg Hubert Liebhart inproceedings Volz02ExecutionSystem A multitude of adaptive computer-based training systems have been implemented in the last years. Whereas several aspects of these systems necessarily are dependent on the application domain, including the learning style and the system type, some other parts of the systems are very similar: usually they require an execution component, which steers and controls the interaction between the learner and the underlying data of the application domain, e.g. databases. For reusing purposes we have developed a highly flexible and adaptable domain independent execution system that allows the realization of different learning strategies in a web-based scenario. In addition to steering the interaction between learner and data, the execution system is enriched with model checking facilities. They provide a verification mechanism for learning material and thus can be used to support the authors. The described system is integrated into the web- and case-based project "Docs 'N Drugs". 2002 10.1109/CIE.2002.1186005 Proceedings of the International Conference on Computers in Education (ICCE '02) 559--563 Edwin Volz Alke Martens Alexander Seitz inproceedings schalk-et-all!02 The Collaboration and Coordination Infrastructure for personal Agents (CIA) is a Java-based multi-agent framework for personal assistance. Until now, inter-agent communication in CIA is done via topic-based communication chan- nels with Java-based event classes. Information within these events is represented in proprietary classes, which are serialized for transfer. As a result, agent communication is lim- ited to an a priori defined domain of information chunks to which collaborating agents have to be tailored. In order to achieve wider inter-operability we are currently evaluating the combination of two techniques. For standardized communication between heterogeneous agents we will use the FIPA Agent Communication Language (ACL). The DARPA Agent Communication Language / Ontology Inference Layer (DAML+OIL) will serve as content language for the ACL. This architecture seems to be a promising combination because of two reasons. First, agents of this kind are able to collaborate with other heterogenous agents in an ad hoc manner because of the standardized FIPA communication interface. Second, they do not have to be tailored to proprietary content vocabularies in advance, because they can use ontology-based Semantic Web techniques as a mechanism for identification of the meaning of the terms they communicate. However, it has to be figured out if these two techniques fit seamlessly into a given agent architecture like CIA. Potential problems include the semantic compatibility of DAML and ACL for example. These and other questions have to be considered with respect to the highly dynamic infrastructure of a CIA system. 2002 Proceedings of the Second International Workshop on Ontologies in Agent Systems (OAS'02) ontology KnowledgeModeling fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2002/oas02-liebig.pdf Michael Schalk Thorsten Liebig Torsten Illmann Frank Kargl inproceedings seitz2002docs Der vorliegende Text liefert einen kurzen Abriss über den aktuellen Stand des Projektes "Docs 'n Drugs - Die Virtuelle Poliklinik". Es werden die wichtigsten Programmkomponenten des Lehrsystems vorgestellt, sowie die Position, die das System im aktuellen Lehrbetrieb mittlerweile innehat. Außerdem erfolgt ein Ausblick auf die noch verbleibende Projektphase sowie weitere Zukunftsperspektiven. 2002 Proceedings of the 6. Workshop der AG CBT in der Medizin der GMDS www.informatik.uni-ulm.de/ki/Seitz/papers/GMDS02.pdf Alexander Seitz Matthias Dannenberg inproceedings Schattenberg02HierarchicalResources Many real-world planning applications have to deal with resource allocation problems, and so does planning in the domain of crisis management assistance. In order to support resource allocation in these kind of applications, we present a new approach to the integration of scheduling capabilities and planning. The proposed methodology relies on a hybrid planner, which combines action and state abstraction by integrating hierarchical task network (HTN) planning and state based partial order causal link (POCL) planning into a common framework. We extend the abstraction mechanism of the planner to different kinds of abstraction for resources, namely subsumption, approximation, qualification, and aggregation. We show how these abstractions can be used when modeling the domain and how reasoning about resources can be performed in a flexible way, namely by merging opportunistic planning and scheduling strategies. 2002 Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems (AIPS 2002) AAAI Press 263--272 Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2002/Schattenberg02HierarchicalResourcesSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2002/Schattenberg02HierarchicalResources.pdf Bernd Schattenberg Susanne Biundo article Xu02FaultTolerantSystem AbstractÐThis paper describes our experience using coordinated atomic (CA) actions as a system structuring tool to design and validate a sophisticated and embedded control system for a complex industrial application that has high reliability and safety requirements. Our study is based on an extended production cell model, the specification and simulator for which were defined and developed by FZI (Forschungszentrum Informatik, Germany). This aFault-Tolerant Production Cello represents a manufacturing process involving redundant mechanical devices (provided in order to enable continued production in the presence of machine faults). The challenge posed by the model specification is to design a control system that maintains specified safety and liveness properties even in the presence of a large number and variety of device and sensor failures. Based on an analysis of such failures, we provide in this paper details of: 1) a design for a control program that uses CA actions to deal with both safety-related and fault tolerance concerns and 2) the formal verification of this design based on the use of model-checking. We found that CA action structuring facilitated both the design and verification tasks by enabling the various safety problems (involving possible clashes of moving machinery) to be treated independently. Even complex situations involving the concurrent occurrence of any pairs of the many possible mechanical and sensor failures can be handled simply yet appropriately. The formal verification activity was performed in parallel with the design activity and the interaction between them resulted in a combined exercise in adesign for validationo; formal verification was very valuable in identifying some very subtle residual bugs in early versions of our design which would have been difficult to detect otherwise. 2002 10.1109/12.980006 IEEE Transactions on Computers 51 164--179 2 Jie Xu Brian Randell Alexander B. Romanovsky Robert J. Stroud Avelino F. Zorzo Ercument Canver Friedrich von Henke inproceedings Dold:01:verification We report on an ongoing effort in mechanically proving correct a compiling specification for a bootstrap compiler from ComLisp (a subset of ANSI Common Lisp sufficiently expressive to serve as a compiler implementation language) to binary Transputer code using the PVS system. The compilation is carried out in four steps through a series of intermediate languages. This paper focuses on the first phase, namely, the compilation of ComLisp to the stack-intermediate language SIL, where parameter passing is implemented by a stack technique. The context of this work is the joint research effort Verifix aiming at developing methods for the construction of correct compilers for realistic programming languages. 2001 FST TCS 2001: Foundations of Software Technology and Theoretical Computer Sience 2245 springer lncs Ramesh Hariharan and Madhavan Mukund and V. Vinay 144--155 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2001/Dold01LispCompiler.pdf Axel Dold Vincent Vialard inproceedings ns01ad Since the beginning of the year 2000 medical students of the University of Ulm are working in their curriculum with the web-based and case-oriented tutoring system "Docs 'n Drugs \textendash the virtual Polyclinic". The system consists of different subsystems and services. One subsystem is the Training System. It is based on three models: the Tutoring Process Model, the Case Knowledge Model and the Medical Knowledge Model. They describe the tutoring process as a series of nodes and steps, depict the structure of the medical cases, and provide the structure of the medical knowledge respectively. Case knowledge and medical knowledge form the expert knowledge of the medical domain. Together with the tutoring process, they build the basis for automatic intelligent tutoring. After giving a deeper insight into the system architecture and the training case structure, an informal evaluation shows a first feedback of the learners. 2001 Proceedings of the American Medical Informatics Conference AMIA

Washington, USA

433--437 http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2243325/pdf/procamiasymp00002-0472.pdf Alke Martens Jochen Bernauer Torsten Illmann Alexander Seitz inproceedings PvH01 This paper describes the mechanized formal verification we have performed on some of the crucial algorithms used in the Time-Triggered Architecture (TTA) for safety-critical distributed control. We outline the approach taken to formally analyse the clock synchronization algorithm and the group membership service of TTA, summarize our experience and describe remaining challenges. 2001 8th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2001) IEEE

Antibes Juan-les-Pins

343--352 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2001/Pfeifer01DependabilityProperties.pdf Holger Pfeifer Friedrich von Henke inproceedings Biundo01FromCrisisToRelief Flexible support for crisis management can definitely be improved by making use of advanced planning capabilities. However, the complexity of the underlying domain often causes intractable efforts in modeling the domain as well as a huge search space to be explored by the system. A way to overcome these problems is to impose a structure not only according to tasks but also according to relationships between and properties of the objects involved, thereby using so-called decomposition axioms. We outline the prototype of a system that is capable of tackling planning for complex application domains. It is based on a well-founded combination of action and state abstractions. The paper presents the basic techniques and provides a formal semantic foundation of the approach. It introduces the planning system and illustrates its underlying principles by examples taken from the crisis management domain used in our ongoing project. 2001 Proceedings of the 6th European Conference on Planning (ECP 2001) AAAI Press 157--168 Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2001/Biundo01FromCrisisToReliefSlides.pdf http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2001/Biundo01FromCrisisToRelief.pdf Susanne Biundo Bernd Schattenberg incollection Luther01ImplicitSyntax Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-hoc algorithms are used to suppress subterms on output. As a result, terms might be printed identically although they differ in hidden parts. Such ambiguous representations may confuse users. Additionally, terms might be rejected by the type checker because the printer has erased too much type information. This paper addresses these problems by proposing effective erasure methods that guarantee successful term reconstruction, similar to the ones developed for the compression of proof-terms in Proof-Carrying Code environments. Experiences with the implementation in Typelab proved them both efficient and practical. 2001 978-3-540-42254-9 10.1007/3-540-45744-5_31 Automated Reasoning - First International Joint Conference (IJCAR) 2083 Springer Berlin Heidelberg Lecture Notes in Computer Science Goré, Rajeev and Leitsch, Alexander and Nipkow, Tobias 386--400 www.informatik.uni-ulm.de/ki/Papers/ijcar01.pdf Marko Luther article Schattenberg2001PlanningAgents Testing is an obligatory step in developing multi-agent systems. For testing multi-agent systems in virtual, dynamic environments, simulation systems are required that support a modular, declarative construction of experimental frames, that facilitate the embeddence of a variety of agent architectures, and that allow an efficient parallel, distributed execution. We introduce the system JAmes (A Java-Based Agent Modeling Environment for Simulation). In James agents and their dynamic environment are modeled as reflective, time triggered state automata. Its possibilities to compose experimental frames based on predefined components, to express temporal interdependencies, to capture the phenomenon of pro-activeness and reflectivity of agents are illuminated by experiments with planning agents. The underlying planning system is a general purpose system, about which no empirical results exist besides traditional static benchmark tests. We analyze the interplay between heuristics for selecting goals, viewing range, commitment strategies, explorativeness, and trust in the persistence of the world and uncover properties of the agent, the planning engine and the chosen test scenario: Tileworld. 2001 10.1109/5.910852 Proceedings of the IEEE 89 158--173 2 Planning http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2001/Schattenberg2001PlanningAgents.pdf Bernd Schattenberg Adelinde M. Uhrmacher inproceedings 943863 In this paper we discuss the structure of training cases in web-based and case-oriented training systems. We combine the benefits of systems that support a structural representation of knowledge underlying a training case and those that allow a fine granularity of didactical aspects. Our results emerged from the development of a training system in medicine, "Docs 'n Drugs - The Virtual Polyclinic". The abstraction from the proposed trainin case structure offers a good basis for general case-oriented training systems, an easy exchange of tutoring data, and the web-based indexing of learning material. 2001 10.1109/ICALT.2001.943863 Proceedings of the IEEE International Conference on Advanced Learning Technologies 2001 90--93 Torsten Illman Alexander Seitz Alke Martens Michael Weber inproceedings ns01j The tutoring process of conventional case-oriented medical training systems can be characterised as either guided or unguided. In contrast to that, the aim of the system "Docs'n Drugs" is to distinguish between different levels of guidance. The author can realise the tutoring case as a guided, a half guided or an unguided tutoring process. The system architecture distinguishes between an authoring system and a tutoring system. Fundaments of these are the tutoring process model and the case data model. This structure allows the reuse of elements of existing tutoring cases. The tutoring cases can be realised in different langugages, e.g. German and English. 2000 Proceedings of the 45. Jahrestagung der GMDS, Hannover 2000 494--498 Alke Martens Jochen Bernauer Torsten Illmann Claudia Scheuerer Alexander Seitz article ns00ap Simulation means experimenting with a model aimed at analysing the behaviour of a dynamic system. The causal relationships of ecological and biological systems are often not completely known, which hampers the application of quantitative and even qualitative deductive simulation methodologies. If empirical studies that describe the system's behaviour are available, case-based methods can be used to develop a behaviour model from a set of data, i.e. prototypical cases. In contrast to purely inductive methods, case-based approaches directly apply cases to a given situation. Thereby, the specificity of cases is preserved for simulation. Two approaches and their applications illustrate principles, perspectives, and problems of case-based simulation. 2000 Journal of Systems Analysis, Modelling and Simulation (SAMS) 39 215--234 2 http://portal.acm.org/citation.cfm?id=363182.363202 Adelinde M. Uhrmacher Alexander Seitz inproceedings ns01k Fallorientiertes, webbasiertes Lernen gibt Studierenden die Möglichkeit, das von ihnen im Laufe des Studiums erworbene theoretische Wissen anhand konkreter Fallsituationen unabhängig von Zeit und Ort zu trainieren. Insbesondere in dem Bereich, der Anwendungsschwerpunkt des im Projekt "Docs 'n Drugs - Die Virtuelle Poliklinik" entwickelten Lehrsystems ist, der Medizin, bietet diese neue Art des Lernens eine sinnvolle und interessante Ergänzung zu klassischen Lehrformen. Zusätzlich zu der Möglichkeit, jedem Studierenden einzeln den Zugriff auf medizinische Lehrfälle im Web zu bieten, arbeitet das System auch mit einem gezielten Einsatz von webbasierter Telematik und CSCW-Komponenten. Hierdurch wird nicht nur die Interaktion unter Studierenden und zwischen Studierenden und Tutoren ermöglicht, sondern auch der Austausch unter Tutoren bzw. unter Fallautoren gefördert. 2000 Proceedings of 5. Workshop der AG CBT in der Medizin der GMDS 90--95 Alke Martens Torsten Illmann Alexander Seitz Claudia Scheuerer Michael Weber Jochen Bernauer inproceedings ns01c Multi agent systems comprise multiple, deliberative agents embedded in and recreating patterns of interactions. Each agent's execution consumes considerable storage and calculation capacities. For testing multi agent systems, distributed parallel simulation techniques are required that take the dynamic pattern of composition and interaction of multi-agent systems into account. Analyzing the behavior of agents in virtual, dynamic environments necessitates relating the simulation time to the actual execution time of agents. Since the execution time of deliberative components can hardly be foretold, conservative techniques based on lookahead are not applicable. On the other hand, optimistic techniques become very expensive if mobile agents and the creation and deletion of model components are affected by a rollback. The developed simulation layer of JAMES (a Java Based Agent Modeling Environment for Simulation) implements a moderately optimistic strategy which splits simulation and external deliberation into different threads and allows simulation and deliberation to proceed concurrently by utilizing simulation events as synchronization points 2000 10.1109/PADS.2000.847150 Proceedings of the 14th Workshop on Parallel and Distributed Simulation IEEE Computer Society

Los Alamitos, California

Bruce, David and Donatiello, Lorenzo and Turner, Stephen 101--108 http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=847150 Adelinde M. Uhrmacher K. Gugler phdthesis Dold:PhD This dissertation is concerned with a mechanized formal treatment of the transformational software development process in a unified framework. As a formal vehicle, the specification and verification system PVS is utilized to integrate development steps and development methods from different existing transformational approaches. Integration comprises the formalization (that is, a representation in the PVS specification language), the verification, and the correct application of the generic development steps. Transformations of different kind and complexity are integrated into this framework. They include well-known algorithmic paradigms and problem solving strategies such as global-search and divide-and-conquer, as well as transformations for the modification of functional specifications such as transformations from the Bird-Meertens Formalism like fusion or Horner's rule, transformation steps for optimizing recursive functions, transformations on the level of procedural programs, and implementations of data structures. All software artifacts are represented generically within parameterized PVS theories which specify the semantic requirements on the parameters by means of assumptions and define the result of the transformation. Based on the semantic requirements, correctness of the generic step can be proved once and for all. Application of such a development step to a given problem is then carried out by providing a concrete instantiation for the parameters and verifying that it satisfies the theory requirements. Some of the problem-solving strategies are organized by means of taxonomies (that is, hierarchies of specializations for specific problem classes and / or data structures). This approach greatly improves the applicability of the transformations and leads to an elegant structure of the algorithmic knowledge captured in the development steps. As a basis for the realization of refinement hierarchies and for formal software development in PVS, a notion of refinement between parameterized PVS theories and a development methodology is presented which is based on correct partial instantiations of parameterized theories. The usability of the approach is illustrated by many examples of different complexity. They include, among others, the derivation of several search and sorting algorithms, the derivation of a Prolog interpreter, the implementation of a symbol table used in compilers, and finally, as a larger non-trivial case-study: the construction of a compiler program from a given relational compiling specification specifying the translation of a Common Lisp-like language into a stack-based intermediate language. PhD Thesis 2000 Universität Ulm http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2000/Dold00Thesis.pdf Axel Dold inproceedings Pfe00 The paper describes the formal verification of a fault-tolerant group membership algorithm that constitutes one of the central services of the Time-Triggered Protocol (TTP). The group membership algorithm is formally specified and verified using a diagrammatic representation of the algorithm. We describe the stepwise development of the diagram and outline the main part of the correctness proof. The verification has been mechanically checked with the PVS theorem prover. 2000 Formal Methods for Distributed System Development -- Proceedings of FORTE XIII / PSTV XX 2000 Kluwer Academic Publishers

Pisa, Italy

T. Bolognesi and D. Latella 3--18 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2000/forte-pstv2000.pdf Holger Pfeifer inproceedings ns00m The process of tutoring can be perceived as a discrete dynamic process and can be treated as such. Based on JAMES, modeling and execution are distinguished. The tutoring process is described in a compositional hierarchical manner. Agents are used to represent the user which moves from one interaction context to the next, steering and adapting the structure of the tutoring process. The first prototype has used the original JAMES execution mechanism. In contrast to the original application domain, a tutoring process comprises many facets of discrete control rather than of discrete event simulation. Therefore, the execution layer of JAMES has to be replaced to substitute ``simulation time" with ``real time" and to integrate the ``human in the loop" into the execution more naturally. 2000 Proceedings of Artificial Intelligence, Simulation and Planning SCS

San Diego

114--122 Alke Martens Adelinde M. Uhrmacher inproceedings Liebig-et-al!00 Even if a problem solving method and a domain ontology has been identified, there still remains the problem of adding sufficient and consistent domain knowledge to a knowledge processing system. Our KB-Vision system supports this knowledge acquisition process by making use of a 3D graphical user interface in which domain objects can be easily created and composed to a domain model. Using object sensitive manipulation options and by evaluating each graphical action in the underlying knowledge representation formalism, the system ensures a consistent domain model. It can also be used as a knowledge-based graphical simulation environment for various reasoning components (e.g. planners, path generators). 2000 Proceedings of the 10th European-Japanese Conference on Information Modelling and Knowledge Bases (EJC 2000) IOS Press Frontiers in Artificial Intelligence and Applications 161--168 ontology SemanticTechnologies,KnowledgeModeling fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2000/ejc00-liebig.pdf Thorsten Liebig Dieter Finkenzeller Marko Luther inproceedings ns01b James, a Java based agent modeling environment for simulation has been developed to support the compositional construction of test beds for multi-agent systems and their execution in distributed environments. The modeling formalism of James imposes only few constraints on the modeling of agents and facilitates a "plug and test" with pieces of agent code which has been demonstrated in earlier work. However, even entire agents can be run in James as they are run in their run-time environment. The integration of agents as a whole is based on model templates which serve as the agents' interface and representative during the simulation run. The effort which is put into defining model templates for selected agent systems obviates the need for the single agent programmer to get acquainted with the underlying modeling and simulation formalism. Instead, the agent programmer can compose the experimental frame and test the programmed agents as they are. The approach is illustrated with agents of the mobile agent system, Mole 2000 10.1109/WSC.2000.899162 Proceedings of the 2000 Winter Simulation Conference 2 Wyndham Palace Resort & Spa

Orlando, Florida, USA

Joines, J.A. and Barton, R.R. and Kang, K. and Fishwick, P.A. 1722--1729 Adelinde M. Uhrmacher Bernd G. Kullick incollection Dold00GenericProgramming This paper is concerned with a mechanized formal treatment of the transformational software development process in a unified framework. We utilize the PVS system to formally represent, verify and correctly apply generic software development steps and development methods from different existing transformational approaches. We illustrate our approach by representing the well-known divide-and-conquer paradigm, two optimization steps, and by formally deriving a mergesort program. 2000 978-3-540-41090-4 10.1007/3-540-39953-4_12 Generic Programming 1766 Springer Berlin Heidelberg Lecture Notes in Computer Science Jazayeri, Mehdi and Loos, RüdigerG.K. and Musser, DavidR. 146--161 formal verification; mechanized theorem proving; generic development steps; transformational software development http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/2000/Dold00GenericProgramming.pdf Axel Dold book ns00b 1999 31 SCS

San Diego, CA

A. Bruzzone and Adelinde M. Uhrmacher and E. Page 3 inproceedings seitz:a Case oriented tutoring gives students the possibility to practice their acquired theoretical knowledge in the context of concrete cases. Accordingly, tutoring systems for individualized learning have to take the skills of students at applying their knowledge to problem solving into account. This paper describes a case-based methodology for planning tutoring processes depending on the skills of individual users. We develop methods for retrieving tutoring plans of users with similar skills and present adaptation techniques for improving these plans based on the student's behavior during the corresponding tutoring process. The developed methodology is based on the notion that a student has to perform threads of associations in the process of problem solving. 1999 10.1007/3-540-48508-2_23 Case-Based Reasoning Research and Development - Third International Conference on Case-Based Reasoning (ICCBR '99) Springer Berlin Heidelberg 318--328 Alexander Seitz article ns00e Case-based approaches predict the behaviour of dynamic systems by analysing a given experimental setting in the context of others. To select similar cases and to control adaptation of cases, they employ general knowledge. If that is neither available nor inductively derivable, the knowledge implicit in cases can be utilized for a case-based ranking and adaptation of similar cases. We introduce the system OASES and its application to medical experimental studies to demonstrate this approach. 1999 10.1016/S0933-3657(98)00057-8 International Journal on Artificial Intelligence in Medicine 15 255--273 3 Alexander Seitz Adelinde M. Uhrmacher D. Damm inproceedings ns01l In this paper, we introduce the design of a web-based and case-oriented multimedia training system in medicine. It allows students to learn systematic knowledge and decision making in medicine by computer-based solving of guided and unguided medical cases. We show how to meet complex requirements such as web-based client-server architecture, multiuser capability, telecollaboration among users, storage of large database models, database access over heterogeneous networks and knowledge-based intelligent authoring and tutoring. We further explain, how a design pattern, the presentation-abstraction-control pattern, can be applied to make the overall design of such a complex system. It helps to identify and integrate many different and modular designed components. It additionally provides the possibility to easily exchange certain functionality of the system without affecting other components. Finally we will show, that such a system architecture also applies to caseoriented training systems in other subjects. 1999 4th World Conference on Integrated Design & Process Technology Torsten Illmann Michael Weber Alke Martens Alexander Seitz inproceedings ns01m Both representing cases as fixed scripts as well as the development of initial expert systems as a basis for computer based tutoring systems is particularly difficult and time intensive in a multi-institutional development project. On the other hand, structured systematic knowledge and a common terminology is necessary for automatic generation of information and quiz pages as well as automatic feedback. Therefore we provide an architecture that relates tutoring cases to general concept representation systems containing common terminologies, and facilitates an incremental acquisition of systematic knowledge. 1999 Proceedings of the World Conference on Educational Multimedia, Hypermedia AACE

Chesapeake, VA

Piet Kommers and Griff Richards 852--857 http://www.informatik.uni-rostock.de/~martens/Papers/dnd_edmed99.pdf Alexander Seitz Alke Martens Jochen Bernauer Claudia Scheuerer Jens Thomsen article rintanen:constructing The research on conditional planning rejects the assumptions that there is no uncertainty or incompleteness of knowledge with respect to the state and changes of the system the plans operate on. Without these assumptions the sequences of operations that achieve the goals depend on the initial state and the outcomes of nondeterministic changes in the system. This setting raises the questions of how to represent the plans and how to perform plan search. The answers are quite different from those in the simpler classical framework. In this paper, we approach conditional planning from a new viewpoint that is motivated by the use of satisfiability algorithms in classical planning. Translating conditional planning to formulae in the propositional logic is not feasible because of inherent computational limitations. Instead, we translate conditional planning to quantified Boolean formulae. We discuss three formalizations of conditional planning as quantified Boolean formulae, and present experimental results obtained with a theorem-prover. 1999 10.1613/jair.591 Journal of Artificial Intelligence Research (JAIR) 323--352 http://arxiv.org/pdf/1105.5465 Jussi Rintanen phdthesis strecker1999construction This dissertation is concerned with interactive proof construction and automated proof search in type theories, in particular the Calculus of Constructions and its subsystems. Type theories can be conceived as expressive logics which combine a functional programming language, strong typing and a higher-order logic. They are therefore a suitable formalism for specification and verification systems. However, due to their expressiveness, it is difficult to provide appropriate deductive support for type theories. This dissertation first examines general methods for proof construction in type theories and then explores how these methods can be refined to yield proof search procedures for specialized fragments of the language. Proof development in type theories usually requires the construction of a term having a given type in a given context. For the term to be constructed, a metavariable is introduced which is successively instantiated in the course of the proof. A naive use of metavariables leads to problems, such as non-commutativity of reduction and instantiation and the generation of ill-typed terms during reduction. For solving these problems, a calculus with explicit substitutions is introduced, and it is shown that this calculus preserves properties such as strong normalization and decidability of typing. In order to obtain a calculus appropriate for proof search, the usual natural deduction presentation of type theories is replaced by a sequent style presentation. It is shown that the calculus thus obtained is correct with respect to the original calculus. Completeness (proved with a cut-elimination argument) is shown for all predicative fragments of the lambda cube. The dissertation concludes with a discussion of some techniques that make proof search practically applicable, such as unification and pruning of the proof search space by exploiting impermutabilities of the sequent calculus. PhD Thesis 1999 Universität Ulm, Fakultät für Informatik http://www.informatik.uni-ulm.de/ki/Strecker/diss-strecker.pdf Martin Strecker poster Martens99Drugs The tutoring process of conventional case-oriented medical training systems can be characterised as either guided or unguided. In contrast to that, the aim of the system "Docs'n Drugs" is to distinguish between different levels of guidance. The author can realise the tutoring case either as a guided, a half guided or a unguided tutoring process. The system architecture distinguishes between an authoring system and a tutoring system. Fundaments of these are the tutoring process model and the case-based knowledge model. This structure allows the reuse of elements of existing tutoring cases. The tutoring cases can be realised in German and English. Poster 1999 Proceedings of AMIA Symposium 1115 http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2232626/pdf/procamiasymp00004-1152.pdf Alke Martens Jochen Bernauer inproceedings Martens99MedicineTraining The tutoring process of conventional case-oriented medical training systems can be characterised as either guided or unguided. In contrast to that, the aim of the system "Docs'n Drugs" is to distinguish between different levels of guidance. The author can realise the tutoring case either as a guided, a half guided or a unguided tutoring process. The system architecture distinguishes between an authoring system and a tutoring system. Fundaments of these are the tutoring process model and the case-based knowledge model. This structure allows the reuse of elements of existing tutoring cases. The tutoring cases can be realised in German and English. 1999 Proceedings of AMIA Symposium http://www.informatik.uni-ulm.de/ki/Seitz/papers/amia99.pdf Alke Martens Jochen Bernauer Alexander Seitz Torsten Illmann Claudia Scheuerer inproceedings ns01o In the virtual hospital medical students, medical doctors and students of related will have the opportunity to study knowledge and decision making in medicine using a web-based and case-oriented program in order to train their understanding of diseases, and their abiltity to treat patients. 1999 Proceedings of the 44. Jahrestagung der GMDS http://wwwmosi.informatik.uni-rostock.de/diemosiris/static/Papers_archiv/dnd_gmds99.pdf Claudia Scheuerer Alke Martens Jochen Bernauer Torsten Illmann Alexander Seitz Michael Weber inproceedings ns01n Docs'n Drugs - Die virtuelle Poliklinik" ist ein Projekt zur Entwicklung eines webbasierten, multimedialen Lehrsystems für die Medizin. Das Projekt basiert auf zwei Modellen, dem Falldaten- und dem Lehrprozeßmodell, und mündet in seiner Realisierung in zwei Systemen, dem eigentlichen webbasierten Lehrsystem und dem Autorensystem. Zielgruppe des Lehrsystems sind Studierende der Medizin, die durch eine geplante curriculare Einbettung des Programmes frühzeitig an fallorientierte Gedankengänge und Verfahrensweisen herangeführt werden und auf diesem Weg eine Bereicherung ihres Lehrplanes erfahren 1999 4. Workshop der AG CBT in der Medizin der GMDS 65--72 www.informatik.uni-rostock.de/~martens/Papers/dnd_cbt99.pdf Alke Martens Jochen Bernauer Torsten Illmann Claudia Scheuerer Alexander Seitz Michael Weber inproceedings canver:formal This paper presents TLO, an approach to the formal development of object-based systems in a temporal logic framework. The behavior of an object-based system is viewed as derivable from the behaviors of its constituent component objects. Temporal logic is a formalism well suited for specifying behavior of concurrent systems; it also provides conceptually simple notions of composition and refinement: Composition of objects is expressed as conjunction of the associated component specifications. The refinement relation between a low-level and a high-level specification requires that the former specification implies the latter. Specifically in an object-based approach, systems and their components need to be viewed as open systems: Each object guarantees some service (behavior), provided its environment conforms to certain assumptions. Hence, such components are most appropriately specified in an assumption/guarantee style. TLO adopts TLA as the underlying logical formalism. It encompasses a specification language for object-based designs and a corresponding method for specification and verification. The concepts are illustrated by an example involving both functional and fault-tolerance requirements. 1999 10.1007/978-0-387-35562-7_33 Formal Methods for Open Object-Based Distributed Systems (FMOODS '99) 10 Springer US 419--436 Ercument Canver Friedrich von Henke inproceedings Dold99SoftwareDevelopment 1999 Proceedings of the 11th Nordic Workshop on Programming Theory Uppsala, Sweden Axel Dold inproceedings PSvH:99:DCCA7 Distributed dependable real-time systems crucially depend on fault-tolerant clock synchronization. This paper reports on the formal analysis of the clock synchronization service provided as an integral feature by the Time-Triggered Protocol (TTP), a communication protocol particularly suitable for safety-critical control applications, such as in automotive "by-wire" systems. We describe the formal model extracted from the TTP specification and its formal verification, using the PVS system. Verification of the central clock synchronization properties is achieved by linking the TTP model of the synchronization algorithm to a generic derivation of the properties from abstract assumptions, essentially establishing the TTP algorithm as a concrete instance of the generic one by verifying that it satisfies the abstract assumptions. We also show how the TTP algorithm provides the clock synchronization that is required by a previously proposed general framework for verifying time-triggered algorithms. 1999 Dependable Computing for Critical Applications 7 12 IEEE Computer Society Dependable Computing and Fault-Tolerant Systems C. Weinstock and J. Rushby 207--226 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1999/Pfeifer99ClockSynchronization.pdf Holger Pfeifer Detlef Schwier Friedrich von Henke inproceedings dold:formal This paper reports on a non-trivial case-study carried out in the context on the German correct compiler construction project Verifix. The PVS system is here used as a vehicle to formally represent and verify a generic checker routine (run-time result verification) used in compiler back-ends. The checker verifies the results of a sophisticated labeling process of intermediate language expression trees with instances of compilation rule schemata. Starting from an operational specification (i.e. a set of recursive PVS functions), necessary declarative properties of the checker are formally stated and proved correct. 1999 Proceedings of the Andrei Ershov Third International Conference on Perspectives of System Informatics (PSI'99) Springer-Verlag Lecture Notes in Computer Science 470--480 1755 Axel Dold Vincent Vialard inproceedings rintanen:improvements We present a theorem-prover for quantified Boolean formulae and evaluate it on random quantified formulae and formulae that represent problems from automated planning. Even though the notion of quantified Boolean formula is theoretically important, automated reasoning with QBF has not been thoroughly investigated. Universal quantifiers are needed in representing many computational problems that cannot be easily translated to the propositional logic and solved by satisfiability algorithms. Therefore efficient reasoning with QBF is important. The Davis-Putnam procedure can be extended to evaluate quantified Boolean formulae. A straightforward algorithm of this kind is not very efficient. We identify universal quantifiers as the main area where improvements to the basic algorithm can be made. We present a number of techniques for reducing the amount of search that is needed, and evaluate their effectiveness by running the algorithm on a collection of formulae obtained from planning and generated randomly. For the structured problems we consider, the techniques lead to a dramatic spead-up. 1999 Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999) Morgan Kaufmann Publishers 1192--1197 http://www.eecs.berkeley.edu/~russell/classes/cs289/f04/readings/Rintanen:1999.pdf Jussi Rintanen techreport Canver99ModelChecking Die Unified Modeling Language (UML) enthält sowohl Statecharts als auch mit Sequence Diagrams eine Variante von Message Sequence Charts (MSCs). Da beide eingesetzt werden können, um verschiedene Aspekte eines Systems zu beschreiben, ist es sinnvoll, die Konsistenz zwischen beiden Beschreibungstechniken zu prüfen. Im vorliegenden Bericht werden beide Ansatze miteinander notationell und semantisch integriert und eine formale Konsistenzbeziehung formuliert. Zu diesem Zweck werden hier die MSC-Notation zu MSCCTL erweitert, die Semantik von Statecharts in Termini von Transitionssystemen beschrieben und in MSCCTL formulierte Anforderungen nach CTL abgebildet. Die eigentliche Analyse erfolgt unter Einsatz eines Model-Checkers. Dazu sind hier Abbildungsvorschriften für einen speziellen Model-Checker angegeben. Aufgrund der mit der Prüfung von CTL-Formeln verbundenen Komplexität ist hier zudem ein Verfahren angegeben, um die Beweisverpflichtungen in eine einfacher zu handhabende Form umzusetzen. Ulmer Informatik-Berichte 1999 Universität Ulm http://d-nb.info/1016487037 http://vts.uni-ulm.de/docs/2009/7093/vts_7093_9943.pdf Ercument Canver inproceedings ns00n Most of the work in the area of simulation and education is dedicated to the process of teaching students the essentials of dynamic systems by simulation. Thereby the system to be taught becomes the subject to be modeled and simulated. However, the process of tutoring can itself be perceived as a dynamic process and can be treated as such. To support a flexible and intelligent tutoring process we distinguish between model and simulation level. At the model level we employ a state-based, modular, and hierarchical agent-oriented model design. The user is represented as an agent which moves through the tutoring process accessing its structure. Thus, agents and their changing interaction structure become central. 1999 Proceedings of European Simulation Multiconference ESM'99 SCS 111--119 http://wwwmosi.informatik.uni-rostock.de/diemosiris/static/Papers_archiv/esm99.pdf Alke Martens Adelinde M. Uhrmacher inproceedings rintanen:numeric We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can modify the values of numeric variables. The basis planning algorithm is based on techniques from propositional satisfiability testing and does not restrict to forward or backward chaining. When several operations affect a numeric variable by increasing and decreasing its value in parallel, the effects have to be combined in a meaningful way. This problem is especially acute in planning algorithms that maintain an incomplete state description of every time point of a plan execution. The approach we take requires that for operators that are executed in parallel, all linearizations of the operations to total orders behave equivalently. We provide an efficient and general solution to the problem. 1999 Recent Advances in AI Planning, Proceedings of the 5th European Conference on Planning (ECP '99) 109--121 http://users.ics.aalto.fi/rintanen/jussi/papers/RintanenJungholt99.pdf Jussi Rintanen Hartmut Jungholt inproceedings PR:99 This paper deals with formalizations and verifications in type theory that are abstracted with respect to a class of datatypes; i.e polytypic constructions. The main advantage of these developments are that they can not only be used to define functions in a generic way but also to formally state polytypic theorems and to synthesize polytypic proof objects in a formal way. This opens the door to mechanically proving many useful facts about large classes of datatypes once and for all. 1999 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics 1690 Springer Lecture Notes in Computer Science Y. Bertot and G. Dowek and A. Hirschowitz and C. Paulin and L. Théry 55--72 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1999/Pfeifer99Polytypic.pdf Holger Pfeifer Harald ��ܱ�ß inproceedings xu1999rigorous This paper describes our experience using coordinated atomic (CA) actions as a system structuring tool to design and validate a sophisticated control system for a complex industrial application that has high reliability and safety requirements. Our study is based on the "Fault-Tolerant Production Cell", which represents a manufacturing process involving redundant mechanical devices (provided in order to enable continued production in the presence of machine faults). The challenge posed by the model specification is to design a control system that maintains specified safety and liveness properties even in the presence of a large number and variety of device and sensor failures. We discuss in this paper: i) a design for a control program that uses CA actions to deal with both safety-related and fault tolerance concerns, and ii) the formal verification of this design based on the use of model-checking. We found that CA action structuring facilitated both the design and verification tasks by enabling the various safety problems (e.g. clashes of moving machinery) to be treated independently. The formal verification activity was performed in parallel with the design activity the interaction between them resulted in a combined exercise in "design for validation". 1999 10.1109/FTCS.1999.781035 Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing. Digest of Papers. 68--75 Jie Xu Brian Randell A. Romanovsky Robert J. Stroud Avelino F. Zorzo Ercument Canver Friedrich von Henke phdthesis Kienzler99PhD PhD Thesis 1999 Universität Ulm Friedemann Kienzler inproceedings hoefling-et-al!99 Modelling substances in knowledge representation has to be different from the treatment of discrete objects. For example liquids need a different approach to individuation. We propose an ontology which represents physical states and other properties of substances in a uniform way. Based on this we describe how to model a hierarchy of actions that can deal with such substances. For these actions a general distinction is made with respect to the type of properties the actions are changing. Further we describe an implementation in description logic allowing especially the definition of actions by specialization of more abstract actions and the inheritance of pre- and postconditions. 1999 10.1007/3-540-48775-1_12 Proceedings of the 11th European Workshop on Knowledge Acquisition, Modeling and Management (EKAW'99) 1621 Springer Berlin / Heidelberg Lecture Notes in Computer Science Fensel, Dieter and Studer, Rudi 191--206 ontology KnowledgeModeling fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1999/ekaw99-liebig.pdf ����ö���� ��ö�ڱ����Բ� Thorsten Liebig Lars Webel Dietmar ��ö���Ա�� incollection Pfab99Verification We give an overview on our approach to symbolic simulation in the PVS theorem prover and demonstrate its usage in the realm of validation by executing specification on incomplete data. In this way, one can test executable models for a possibly infinite class of test vectors with one run only. One of the main benefits of symbolic simulation in a theorem proving environment is enhanced productivity by early detection of errors and increased confidence in the specification itself. 1999 978-3-211-83282-0 10.1007/978-3-7091-6355-9_14 Tool Support for System Specification, Development and Verification Springer Vienna Advances in Computing Science Berghammer, Rudolf and Lakhnech, Yassine 189--200 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1999/Pfab99Verification.pdf Stephan Pfab Harald ��ܱ�ß Sam Owre Friedrich von Henke techreport Typelab:98a This report gives a survey of T YPELAB, a specification and verification environment that integrates interactive proof development and automated proof search. T YPELAB is based on a constructive type theory, the Calculus of Constructions, which can be understood as a combination of a typed λ-calculus and an expressive higher-order logic. Distinctive features of the type system are dependent function types for modeling polymorphism and dependent record types for encoding specifications and mathematical theories. After presenting an extended example which demonstrates how program development by stepwise refinement of specifications can be carried out, the theory underlying the prover component of T YPELAB is described in detail. A calculus with metavariables and explicit substitutions is introduced, and the meta-theoretic properties of this calculus are analyzed. Furthermore, it is shown that this calculus provides an adequate foundation for automated proof search in fragments of the logic. 1998 Universität Ulm 98-03 http://vts.uni-ulm.de/docs/2013/8520/vts_8520_12569.pdf Marko Luther Martin Strecker inproceedings Rintanen98aplanning The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the partial-order or refinement planning community have proved in many cases to be inferior to general-purpose satisfiability algorithms in solving planning problems. However, no explanation of the success of programs like Walksat or relsat in planning has been offered. In this paper we discuss a simple planning algorithm that reconstructs the planner in the background of the SAT/CSP approach. 1998 Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR '98) Morgan Kaufmann Publishers 617--624 http://users.ics.aalto.fi/rintanen/jussi/papers/Rintanen98plan.pdf Jussi Rintanen inproceedings Uhrmacher1998Agents Test beds for multi-agent systems provide the means for experimenting with multiple agents that act and interact concurrently in their environment. Mostly, test beds constitute specialized tools which provide specific scenarios for testing specific agent-architectures. To facilitate reuse and a flexible compositional construction of experimental frames for multi-agent systems, JAMES, a Java Based Agent Modeling Environment for Simulation, explores the integration of agents within a general modeling and simulation formalism for discrete event systems. Therefore, a compositional and hierarchical model design which supports variable structure models is complemented with a distributed, concurrent execution. Two experiments with planning agents illustrate our approach. 1998 The Society for Computer Simulation International (SCS) 10TH European Simulation Symposium ``Simulation in Industry -- Simulation Technology: Science and Art" (ESS 1998) SCS Publications, Ghent Andre Bargiela and Eugene Kerckhoffs 129--136 http://www.informatik.uni-ulm.de/ki/Schattenberg/Publications/Papers/ess98.pdf Adelinde M. Uhrmacher Bernd Schattenberg inproceedings Dold98Verification We describe an approach to mechanically prove the correctness of BURS specifications and show how such a tool can be connected with BURS based back-end generators. The proofs are based on an operational semantics of both source and target system languages specified by means of Abstract State Machines (ASM's). The correctness condition based on these operational semantics is decomposed into local correctness conditions for each BURS rule and the rules can be proved independently. The specification and verification system PVS is used to mechanically verify BURS-rules based on formal representations of the languages involved. In particular, we have defined PVS proof strategies which enable an automatic verification of the rules. Using PVS, several erroneous rules have been found. Moreover, from failed proof attempts we were able to correct them. 1998 Workshop on Abstract State Machines '98 50--67 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1998/Dold98Verification.pdf Axel Dold Thilo Gaul Vincent Vialard Wolf Zimmermann inproceedings vHPP+:98 We describe an extension of the PVS system that provides a reasonably efficient and practical notion of reflection and thus allows for soundly adding formalized and verified new proof procedures. These proof procedures work on representations of a part of the underlying logic and their correctness is expressed at the object level using a computational reflection function. The implementation of the PVS system has been extended with an efficient evaluation mechanism, since the practicality of the approach heavily depends on careful engineering of the core system, including efficient normalization of functional expressions. We exemplify the process of applying meta-level proof procedures with a detailed description of the encoding of cancellation in commutative monoids and of the kernel of a BDD package. 1998 Proceedings Intl. Conf. on Theorem Proving in Higher Order Logics 1479 Springer Lecture Notes in Computer Science J. Grundy and M. Newey 461--478 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1998/vHenke98TheoremProving.pdf Friedrich von Henke Stephan Pfab Holger Pfeifer Harald ��ܱ�ß article Rintanen98Complexity In default reasoning, usually not all possible ways of resolving conflicts between default rules are acceptable. Criteria expressing acceptable ways of resolving the conflicts may be hardwired in the inference mechanism, for example specificity in inheritance reasoning can be handled this way, or they may be given abstractly as an ordering on the default rules. In this article we investigate formalizations of the latter approach in Reiter's default logic. Our goal is to analyze and compare the computational properties of three such formalizations in terms of their computational complexity: the prioritized default logics of Baader and Hollunder, and Brewka, and a prioritized default logic that is based on lexicographic comparison. The analysis locates the propositional variants of these logics on the second and third levels of the polynomial hierarchy, and identifies the boundary between tractable and intractable inference for restricted classes of prioritized default theories. 1998 Journal of Artificial Intelligence Research (JAIR) 9 423--461 http://www.jair.org/media/554/live-554-1756-jair.pdf Jussi Rintanen techreport Damm98Knochenheilung Im Projekt SILK wurden fallbasierte Methoden konzipiert und implementiert, die es dem Wissenschaftler erlauben, den Stand der experimentellen Forschung systematisch zu analysieren, neue Ergebnisse im Kontext anderer einzuordnen und ausgewählte Fragestellungen der Wissenschaftler auf dieser Basis effizient zu beantworten. Als exemplarischer Anwendungsbereich diente das Gebiet der Knochen-heilung. 1998 University of Ulm UIB 98-01 D. Damm Friedrich von Henke Alexander Seitz Adelinde M. Uhrmacher L. Claes S. Wolf inproceedings Uhrmacher98Simulation Simulation bedeutet ein Experimentieren mit Modellen. Die kausalen Zusammenhänge ökologischer und biologischer Systeme sind häufig nur unvollständig bekannt oder nur auf einem für die Simulation nicht nutzbaren Abstraktionsniveau formuliert. Qualitative deduktive Simulationsansätze, die auf die Quantifizierung von Systemparametern verzichten können, erfordern eine bekannte und zudem wenig komplexe Systemstruktur und sind daher nur beschränkt anwendbar. Eine Alternative bieten fallbasierte Ansätze, die ausgehendvon Daten ein Modell entwickeln, welches als Grundlage der Simulation genutzt werden kann. Im Gegensatz zu rein induktiven Methoden, wird das in Fällen vorliegende Wissen nicht generalisiert und dann angewendet, sondern die Spezifität einzelner Situationen bleibt für die Simulation erhalten. Das Modell in fallbasierten Methoden besteht aus einer Reihe prototypischer Fälle. Die Fälle werden ergänzt durch Wissen, um die für eine bestimmte Situation prinzipiell geeigneten Fälle bestimmen und diese nach ihrer Nützlichkeit bewerten zu können und durch Wissen, wie sich der präferierte Fall auf die aktuelle Situation übertragen läßt. Zum Teil wird dieses Wissen vom Benutzer vordefiniert, oder das System leitet es induktiv aus den Fällen her oder nutzt die Fälle in ihrer eigentlichen Form. Letzteres unterstützt eine kontextsensitive Verarbeitung sehr heterogener Fälle. Anhand zweier Verfahren sollen Möglichkeiten und Anforderungen der fallbasierten Simulation untersucht werden. Gemeinsam ist beiden Verfahren, daß sie das Verhalten von dynamischen Systemen auf der Basis von Fällen vorhersagen, die durch eine Menge von unterschiedlich skalierten Parametern beschrieben sind. Der Ansatz des "Fuzzy-Based Inductive Reasoning" (FIR) arbeitet auf Primärdaten, die als Zeitreihen vorliegen Anwendungsgebiet ist der Kohlendioxydzyklus in Biosphäre 2. Die Vereinheitlichung des Skalenniveaus in "Fuzzy-Werte" ist Voraussetzung für alle weiteren Schritte in FIR. Das Wissen, das benötigt wird, um geeignete Fälle zu identifizieren, wird von FIR induktiv anhand der Fallbasis hergeleitet. Aufgrund der Homogenität der Fälle können danach einfache distanzorientierte Verfahren für die Präferenzfindung und Adaption angewendet werden. OASES, "Our Approach to Simulate based on Experimental Studies", basiert auf Sekundärdaten, Ergebnisse experimenteller Studien, wie sie typischerweise in der Literatur gefunden werden. Die Fallbasis mit ca. 600 Fällen faßt die Ergebnisse aus 45 Studien zur Knochenheilung zusammen. Versuchs- und Ergebnisparameter und deren Skalierung variieren von Fall zu Fall. Metrische Angaben sind je nach Kontext völlig unterschiedlich zu bewerten. Eine Anpassung des Skalenniveaus ist ebenso wie die weiteren Phasen des fallbasierten Schließens nur im Hinblick auf eine bestimmte gegebene Situation zu leisten. Um die geeigneten Fälle zu identifizieren, sie zu ordnen und letztendlich an die gegebene Situation anzupassen, interpretiert OASES das in der Fallbasis inhärente Wissen situationsspezifisch. 1998 Proceedings of the 8th Workshop, AK5, GI-Fachgruppe 4.5.9/4.6.3: Werkzeuge für die Simulation und Modellierung in Umweltanwendungen. Wissenschaftliche Berichte des Forschungszentrums Karlsruhe (FZKA) Adelinde M. Uhrmacher Alexander Seitz techreport Canver98Verification Coordinated atomic actions (CAAs) have been used in a semi-formal way for the design of the production cell case study. This paper presents a formal specification and verification of the production cell building on this design. However, this report is not intended to present yet another formalization of the production cell case study but rather as an approach to formalizing a CAA based system design in order to formally verify its properties. Each CAA is modeled as an atomic state transition characterized by its pre- and postconditions. In order for such transitions to become enabled, conditions are formalized requiring all associated roles to be activated. Activation of roles is performed by controllers, which are again modeled in terms of state transitions. The state space of the production cell can be viewed as being finite; hence, the production cell is specified as a finite state transition system and the formal verification of the CAA-design is carried out using model-checking. 1998 University of Ulm UIB 98-05 http://vts.uni-ulm.de/doc.asp?id=8522 http://vts.uni-ulm.de/docs/2013/8522/vts_8522_12573.pdf Ercument Canver incollection Strecker:98a This chapter gives a survey of Typelab, a specification and verification environment that integrates interactive proof development and automated proof search. Typelab is based on a constructive type theory, the Calculus of Constructions, which can be understood as a combination of a typed Lambda calculus and an expressive higher-order logic. Distinctive features of the type system are dependent function types (Pi types) for modeling polymorphism and dependent record types (Sigma types) for encoding specifications and mathematical theories. Type theory provides a homogeneous theoretical framework in which the construction of a function and the construction of a proof can be considered to be essentially the same activity. There is, however, a practical difference in that the development of a function requires more insight and therefore usually has to be performed under human guidance, whereas proof search can, to a large extent, be automated. Internally, Typelab exploits the homogeneity provided by type theory, while externally offering an interface to the human user which conceals most of the complexities of type theory. Interactive construction of proof objects is possible whenever desired; metavariables serve as placeholders which can be refined incrementally until the desired object is complete. For procedures which can reasonably be automated, high-level tactics are available. In this respect, Typelab can be understood as a proof assistant which, in addition to the manipulations of formulae traditionally performed by theorem provers, permits to carry out operations on entities such as functions and types. For an illustration of program development in Typelab, the report TR-98-03 should be consulted, which holds an extended version of this chapter. 1998 Automated Deduction --- A Basis for Applications Kluwer Academic Publishers 3: Interactive Theorem Proving W. Bibel and P. Schmitt Martin Strecker Marko Luther Friedrich von Henke article Rintanen98lexicographicpriorities Resolving conflicts between default rules is a major subtask in performing default reasoning. A declarative way of controlling the resolution of conflicts is to assign priorities to default rules, and to prevent conflict resolution in ways that violate the priorities. This work extends Reiter's default logic with a priority mechanism that is based on lexicographic comparison. Given a default theory and a partial ordering on the defaults, the preferred extensions are the lexicographically best extensions. We discuss alternative ways of using lexicographic comparison, and investigate their properties and relations between them. The applicability of the priority mechanism to inheritance reasoning is investigated by presenting two translations from inheritance networks to prioritized default theories, and relating them to inheritance theories presented earlier by Gelfond and Przymusinska and by Brewka. 1998 Artificial Intelligence 106 221--265 Jussi Rintanen inproceedings Schwier98Verification Clock synchronization algorithms play a crucial role in a variety of fault-tolerant distributed architectures. Although those algorithms are similar in their basic structure, the particular designs differ considerably, for instance in the way clock adjustments are computed. This paper develops a formal generic theory of clock synchronization algorithms which extracts the commonalities of specific algorithms and their correctness arguments; this generalizes previous work by Shankar and Miner by covering non-averaging adjustment functions, in addition to averaging algorithms. The generic theory is presented as a set of parameterized PVS theories, stating the general assumptions on parameters and demonstrating the verification of generic clock synchronization. The generic theory is then specialized to the class of algorithms using averaging functions, yielding a theory that corresponds to those of Shankar and Miner. As examples of the verification of concrete, published algorithms, the formal verification of an instance of an averaging algorithms (by Welch and Lynch) and of a non-averaging algorithm (by Srikanth and Toueg) is discussed. 1998 Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT '98) Springer LNCS Anders P. Ravn and Hans Rischel 262--271 1486 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1998/Schwier98Verification.pdf Detlef Schwier Friedrich von Henke inproceedings Dold98MechanizedVerification We describe an approach to mechanically prove the correctness of BURS specifications and show how such a tool can be connected with BURS based back-end generators [9]. The proofs are based on the operational semantics of both source and target system languages specified by means of Abstract State Machines [15]. In [31] we decomposed the correctness condition based on these operational semantics into local correctness conditions for each BURS rule and showed that these local correctness conditions can be proven independently. The specification and verification system PVS is used to mechanicalyy verify BURS-rules based on formal representations of the languages involved. In particular, we have defined PVS proof strategies which enable an automatic verification of the rules. Using PVS, several erroneous rules have been found. Moreover, from failed proof attempts we were able to correct them. 1998 Proceedings of the International Workshop on Software Tools for Technology Transfer (STTT '98) Aalborg, Denmark http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.46.5876&rep=rep1&type=pdf Axel Dold Thilo Gaul Wolf Zimmermann inproceedings ns00r 1998 Proceedings of the International Conference on Web-Based Modeling and Simulation 15--20 http://www.researchgate.net/publication/222803651_Modeling_and_simulation_of_mobile_agents/file/3deec51a51179d6d80.pdf Adelinde M. Uhrmacher Petra Tyschler Dirk Tyschler incollection PR98 This paper deals with formalizations and verifications in type theory that are abstracted with respect to a class of datatypes; i.e polytypic constructions. The main advantage of these developments are that they can not only be used to define functions in a generic way but also to formally state polytypic theorems and to synthesize polytypic proof objects in a formal way. This opens the door to mechanically proving many useful facts about large classes of datatypes once and for all. 1998 Workshop on Generic Programming (WGP'98) Dept. of Computing Science, Chalmers Univ. of Technology, and Göteborg Univ. Roland Backhouse and Tim Sheard http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1998/Pfeifer98PolytypicAbstraction.pdf Holger Pfeifer Harald ��ܱ�ß inproceedings ns00q Case-based approaches are employed within a multitude of application areas one of which is the prediction of dynamic behaviour. Given a situation the possible development after a time span shall be determined. If only a small set of heterogenously structured cases describing observations at a variety of time points is given to start with, as it is the case when experimental medical studies shall be analysed, it becomes necessary to analyse and evaluate the temporal horizon from case to case differently, and treat time as a first class variable. This is the strategy OASES (Our Approach to Simulation based on Experimental Studies) employs. For this purpose, OASES utilises knowledge implicit in cases for matching and adaptation. Whether different time points do match in the current situation or how different time points of observation might effect the development, is decided based on cases which time is an explicit part of. Keywords: Case-Based Reasoning; Case-Based Similarity Ranking; Case-Based Adaptation; Prediction; Experimental Studies 1998 Advances in Artificial Intelligence, Proceedings of the 22nd German Conference on Artificial Intelligence (KI 1998) Springer 213--224 Alexander Seitz Adelinde M. Uhrmacher inproceedings cyrluk:an In this paper we describe a decision procedure for the core theory of fixed-sized bit-vectors with extraction and composition that can readily be integrated into Shostak's procedure for deciding combinations of theories. Inputs to the solver are unquantified bit-vector equations t=u and the algorithm returns true if t=u is valid in the bit-vector theory, false if t=u is unsatisfiable, and a system of solved equations otherwise. The time complexity of the solver is |t|*log(n)+n^2, where t is the length of the bit-vector term t and n denotes the number of bits on either side of the equation. Then, the solver for the core bit-vector theory is extended to handle other bit-vector operations like bitwise logical operations, shifting, and arithmetic interpretations of bit-vectors. We develop a BDD-like data-structure called bit-vector BDDs to represent bit-vectors, various operations on bit-vectors, and a solver on bit-vector BDDs. 1997 10.1007/3-540-63166-6_9 Computer Aided Verification - 9th International Conference, (CAV '97) 1254 Springer Berlin Heidelberg 60--71 David Cyrluk Oliver ��ö������� Harald ��ܱ�ß article ns00g In the last decade a variety of methodologies for representing and evaluating knowledge qualitatively has been developed, particularly within the field of Artificial Intelligence. Qualitative reasoning methodologies represent an alternative to quantitative modeling approaches, if the knowledge about the system of interest is imprecise or incomplete, as it is often the case when dealing with ecological systems. As most of the methodologies have not outgrown toy examples, it re-mains challenging to apply those methodologies to real world applica-tions. In Biosphere 2, a closed ecological system, the level of O2 has dropped and the CO2 level has risen continuously during its closure between 1991 and 1993. The mechanisms of carbon cycles have been subject to multiple research efforts, and are therefore formulated as general rules in principle. However, the specific situation within Biosphere 2, a closed ecosystem, might influence the validity of these rules. Thus, the structure of the carbon cycle in Biosphere 2 is not well known, yet abundant data exist on some of the important fluxes and pools. Whereas deductive, quantitative as well as qualitative, method-o-logies need knowledge about the structure of the system to derive the behavior of the system, the fuzzy-based inductive reasoning method-ology FIR derives inductively the behavior model by analyzing time series. The derived behavior model comprises cases and information how to retrieve prototypical cases that can be adapted to the given situation. Thus, FIR combines one-shot inductive and incremental case-based reaso-ning techniques in analyzing and forecasting dynamic systems. 1997 International Journal on Applied Artificial Intelligence in Natural Resource Management 11 1--10 2 Adelinde M. Uhrmacher Francois E. Cellier R. J. Frye article ns00f Object-oriented concepts are widely employed in simulation. The increasing activity in developing agent-oriented simulation systems calls for exploring the relationship between object-oriented and agent-oriented modeling and simulation more closely. The paper constitutes one step to that enterprise. 1997 Transactions of the Society for Computer Simulation International 14 59--67 2 http://dl.acm.org/citation.cfm?id=271934 Adelinde M. Uhrmacher inproceedings DHPR97 1997 FME '97: Formal Methods: Their Industrial Application and Strengthened Foundations 1313 Springer Lecture Notes in Computer Science J. Fitzgerald and C. Jones and P. Lucas 459--472 Axel Dold Friedrich von Henke Holger Pfeifer Harald ��ܱ�ß article Canver97Steuerungssoftware Dieser Beitrag beschreibt die Ergebnisse einer Fallstudie zur Erprobung der in dem System Verification Support Environment (VSE) bereitgestellten formalen Methoden am Beispiel einer computergesteuerten elektrisch ortsbedientenWeiche (EOW). VSE ist ein Werkzeug zur formalen Spezifikation und Verifikation von sicherheitsrelevanten Softwaresystemen. Die elektrisch ortsbediente Weiche ist ein Industrieprodukt aus dem Bereich des spurgeführten Verkehrs: sie wird in Gleisanlagen eingesetzt, die mit nur geringer Geschwindigkeit befahren werden dürfen, die Weichenumstellung erfolgt bei Bedarf elektrischvor Ort. Für einen sicheren und ordnungsgemäßen Betrieb werden dennoch hohe Anforderungen an die Steuerungssoftware der EOW gestellt. Anforderungen an die Steuerungssoftware der EOW gestellt. Die Fallstudie wurde von einer interdisziplinären Arbeitsgruppe bearbeitet und es wurde versucht, das anwendungsorientierte Vorgehen eines Ingenieurs mit einer streng formalen Vorgehensweise aus der Informatik zu verknüpfen. Der vorliegende Artikel wendet sich an alle Leser, die sich für Software mit Sicherheitsverantwortung interessieren. 1997 atp -- Automatisierungstechnische Praxis 39 R. Oldenbourg Verlag 57--64 5 Ercument Canver Jan-Tecker Gayen Adam Moik techreport PvHR97 Ulmer Informatik-Berichte 1997 Universität Ulm, Fakultät für Informatik 96-11 Major revision as of July 1997 Friedrich von Henke Holger Pfeifer Harald ��ܱ�ß inproceedings strecker:integrating This paper reports on the integration of an untyped equational prover into a proof system based on an expressive constructive type theory. The proofs returned by the equational prover are effectively verified for type correctness, a proof term can be constructed. The scheme of proof translation described here is illustrated by the integration of the Discount prover into the software development system TYPELAB. 1997 10.1007/3540634932_11 Advances in Artificial Intelligence - Proceedings of the 21st Annual German Conference on Artificial Intelligence (KI '97) Springer Berlin Heidelberg 147--158 Martin Strecker Maria Sorea techreport BPvHR97 We describe an encoding of major parts of domain theory and fixed-point theory in the PVS extension of the simply-typed lambda-calculus; these formalizations comprise the encoding of mathematical structures like complete partial orders (domains), domain constructions, the Knaster-Tarski fixed-point theorem for monotonic functions, and variations of fixed-point induction. Altogether, these encodings form a conservative extension of the underlying PVS logic. A major problem of embedding mathematical theories like domain theory lies in the fact that developing and working with those theories usually generates myriads of applicability and type-correctness conditions. Our approach to exploiting the PVS devices of predicate subtypes and judgements to establish many applicability conditions behind the scenes leads to a considerable reduction in the number of the conditions that actually need to be proved. We illustrate the applicability of our encodings by means of simple examples including a mechanized fixed-point induction proof in the context of relating different semantics of imperative programming constructs. Ulmer Informatik-Berichte 1997 Universität Ulm, Fakultät für Informatik 96-10 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1997/Bartels97MechanizingDomainTheory.pdf Major revision as of October 1997 F. Bartels Friedrich von Henke Holger Pfeifer Harald ��ܱ�ß inproceedings henke:typelab 1997 10.1007/BFb0030645 Theory and Practice of Software Development (TAPSOFT '97) - Proceedings of the 7th International Joint Conference CAAP/FASE 1214 Springer Berlin Heidelberg 849--854 Friedrich von Henke Marko Luther Martin Strecker techreport CMR96 The theory of fixed-sized bitvectors with composition and extraction has been shown to be useful in the realm of hardware verification, and in this paper we develop an efficient algorithm for deciding this theory. A proper input is an unquantified bitvector equation, say t = u, and our algorithm returns true if t = u is valid in the bitvector theory, false if t = u is unsatisfiable, and a system of solved equations otherwise. The time complexity of this solver is O(|t| log(n) + n^2), where |t| is the length of the bitvector term t and n denotes the number of bits on either side of the equation. Moreover, the resulting procedure can readily be integrated into Shostak's procedure for deciding combinations of theories. Ulmer Informatik-Berichte 1996 UniversitäT Ulm, Fakultät für Informatik 96-8 David Cyrluk Oliver ��ö������� Harald ��ܱ�ß incollection nebel1996artificial Although the computational perspective on cognitive tasks has always played a major role in Artificial Intelligence, the interest in the precise determination of the computational costs that are required for solving typical AI problems has grown only recently. In this paper, we will describe what insights a computational complexity analysis can provide and what methods are available to deal with the complexity problem. 1996 Principles of Knowledge Representation CSLI Publications G. Brewka 237--266 Bernhard Nebel inproceedings Goerigk+96 Compiler correctness is crucial to the software engineering of safety critical software. It depends on both the correctness of the compiling specificati on and the correctness of the compiler implementation. We will discuss compiler correctness for practically relevant source languages and target machines in orde r to find an adequate correctness notion for the compiling specification, i. e. for the mapping from source to target programs with respect to their standard sema ntics, which allows for proving both specification and implementation correctness. We will sketch our approach of proving the correctness of the compiler impleme ntation as a binary machine program, using a special technique of bootstrapping and double checking the results. We will discuss mechanical proof support for bot h compiling verification and compiler implementation verification in order to make them feasible parts of the software engineering of correct compilers. Verifix is a joint project on Correct Compilers funded by the Deutsche Forschungsgemeinschaft (DFG). 1996 Proceedings of the Poster Session of CC '96 -- International Conference on Compiler Construction

IDA Technical Report LiTH-IDA-R-96-12, Linkøping, Sweden

P. Fritzson 65--73 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1996/Goerigk96Verifix.pdf Wolfgang Goerigk Axel Dold Thilo Gaul Gerhard Goos Andreas Heberle Friedrich von Henke Ulrich Hoffmann Hans Langmaack Holger Pfeifer Harald ��ܱ�ß Wolf Zimmermann inproceedings ns00s Object-oriented concepts are widely employed in simulation. The increasing activity in developing agent-oriented simulation systems calls for exploring the relationship between object-oriented and agent-oriented modeling and simulation more closely. The paper constitutes one step to that enterprise. 1996 Workshop on Multiagent Systems and Simulation 1--8 http://wwwmosi.informatik.uni-rostock.de/diemosiris/static/Papers_archiv/scs97.pdf Adelinde M. Uhrmacher inproceedings ns00t 1996 4th German Workshop on Case-Based Reasoning Alexander Seitz Adelinde M. Uhrmacher techreport Canver96:FESEOWV Die computergesteuerte "elektrisch ortsbediente Weiche (EOW)" ist ein Produkt aus dem Bereich des spurgefuhrten Verkehrs und wird in Gleisanlagen eingesetzt, die mit nur geringer Geschwindigkeit befahren werden durfen. Für einen sicheren und ordnungsgemäßen Betrieb werden dennoch hohe Anforderungen an die Steuerungssoftware der EOW gestellt. Die EOW ist als Industrieprodukt von hoher praktischer Relevanz. Da die Größe der Steuerungssoftware in einem handhabbaren Rahmen liegt, bietet sich mit dieser Anwendung eine geeignete Fallstudie zur Erprobung der in dem System "Verification Support Environment (VSE)" bereitgestellten formalen Methoden, einem Werkzeug zur formalen Spezifikation und Verifikation von sicherheitsrelevanten Softwaresystemen. Die Fallstudie wurde von einer interdisziplinaren Arbeitsgruppe bearbeitet und es wurde versucht, das anwendungsorientierte Vorgehen eines Ingenieurs und die methodikorientierte formale Vorgehensweise eines Softwareentwicklers miteinander zu verknüpfen. Vorliegender Bericht wendet sich insbesondere an diese beiden Lesergruppen. Zunachst werden die EOW und die Anforderungen an die Steuerungssoftware beschrieben und der mit VSE zu modellierende Softwareausschnitt definiert. Die Abgrenzung und Schnittstellen dieses Ausschnitts zum Gesamtsystem werden festgelegt. Danach ist an diesem Ausschnitt die VSE-Methodik illustriert. Abschließend sind die Erfahrungen und Schlußfolgerungen aus dieser Fallstudie zusammengefaßt. UIB 1996 Universität Ulm 96-01 http://vts.uni-ulm.de/docs/2009/7066/vts_7066_9889.pdf Ercument Canver Jan-Tecker Gayen Adam Moik techreport dvhpr96 1996 Ulm University 96-12 Axel Dold Friedrich von Henke Holger Pfeifer Harald ��ܱ�ß incollection Ruess96Verification It is shown how to use the PVS specification language and proof checker to present a hierarchical formalization of a two-dimensional, high-speed integer multiplier on the gate level. We first give an informal description of iterative array multiplier circuits together with a natural refinement into vertical and horizontal stages, and then show how the various features of PVS can be used to obtain a readable, high-level specification. The verification exploits the tight integration between rewriting, arithmetic decision procedures, and equality that is present in PVS. Altogether, this case study demonstrates that the resources of an expressive specification language and of a general-purpose theorem prover permit highly automated verification in this domain, and can contribute to clarity, generality, and reuse. 1996 978-3-540-61937-6 10.1007/BFb0031801 Formal Methods in Computer-Aided Design 1166 Springer Berlin Heidelberg Lecture Notes in Computer Science Srivas, Mandayam and Camilleri, Albert 79--93 Harald ��ܱ�ß inproceedings ���ܱ�ß:���ǻ�ܱ����� We describe a formal specification and verification in PVS for the general theory of SRT division, and for the hardware design of a specific implementation. The specification demonstrates how attributes of the PVS language (in particular, predicate subtypes) allow the general theory to be developed in a readable manner that is similar to textbook presentations, while the PVS table construct allows direct specification of the implementation's quotient look-up table. Verification of the derivations in the SRT theory and for the data path and look-up table of the implementation are highly automated and performed for arbitrary, but finite precision; in addition, the theory is verified for general radix, while the implementation is specialized to radix 4. The effectiveness of the automation derives from PVS's tight integration of rewriting with decision procedures for equality, linear arithmetic over integers and rationals, and propositional logic. This example demonstrates that the resources of an expressive specification language and of a general-purpose theorem prover are not inimical to highly automated verification in this domain, and can contribute to clarity, generality, and reuse. 1996 10.1007/3-540-61474-5_63 Proceedings of the 8th International Conference on Computer Aided Verification (CAV '96) 1102 Springer Berlin Heidelberg 123--134 Harald ��ܱ�ß Natarajan Shankar Mandayam K. Srivas incollection ns00k 1996 Social Science Micro Simulation- A Challenge for Computer Science Springer Doran, J. and Gilbert, N. and ��ü�������, U. and Troitzsch, K.G. 432--447 Adelinde M. Uhrmacher inproceedings nebel1996solving While the worst-case computational properties of Allen's calculus for qualitative temporal reasoning have been analyzed quite extensively, the determination of the empirical efficiency of algorithms for solving the consistency problem in this calculus has received only little research attention. In this paper, we will demonstrate that using the ORD-Horn class in Ladkin and Reinefeld's backtracking algorithm leads to performance improvements when deciding consistency of hard instances in Allen's calculus. For this purpose, we prove that Ladkin and Reinefeld's algorithm is complete when using the ORD-Horn class, we identify phase transition regions of the reasoning problem, and compare the improvements of ORD-Horn with other heuristic methods when applied to instances in the phase transition region. Finally, we give evidence that combining search methods orthogonally can dramatically improve the performance of the backtracking algorithm. 1996 Proceedings of the 12th European Conference on Artificial Intelligence (ECAI'96) 38--42 Bernhard Nebel inproceedings Strecker:96a This paper describes an approach to representing mathematical concepts in a knowledge base which is structured by a subsumption relation between concepts. Two kinds of concepts are examined: Propositional concepts, with the subsumption relation given by a generalized implication, and parameterized theories, with the subsumption relation given by theory morphisms. It is shown which kinds of reasoning activities can be supported by such a knowledge base. A type theory in which the entities to be represented are first-class objects serves as formal framework. 1996 ECAI-96 Workshop on Representation of mathematical knowledge 23--26 Martin Strecker Marko Luther Matthias Wagner incollection nebel1996subsumption 1996 Wörterbuch der Kognitionswissenschaft Klett-Cotta Gerhard Strube, B. Becker, C. Freksa, U. Hahn, K. Opwis and G. Plam 695 Bernhard Nebel incollection nebel1996terminologische 1996 Wörterbuch der Kognitionswissenschaft Klett-Cotta Gerhard Strube, B. Becker, C. Freksa, U. Hahn, K. Opwis and G. Plam 385 Bernhard Nebel inproceedings vonHenke:96a 1996 10.1007/BFb0014353 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology (AMAST '96) 1101 Springer Lecture Notes in Computer Science M. Wirsing and M. Nivat 604--607 Friedrich von Henke Marko Luther Holger Pfeifer Harald ��ܱ�ß Detlef Schwier Martin Strecker Matthias Wagner article ns00h Two different object-oriented modeling approaches, DEVS and EMSY, constitute the background to explore the area of variable structure modeling. Realizations of various kinds of structural changes are discussed in both approaches. Against the background of their prime application domains, both approaches deal with the problem of structural change differently. While DEVS emphasizes intelligent control of structural change, EMSY stresses the autonomous character of the system. Like autonomy and control, holism and reductionism play different roles in both approaches and affect the realization of structural changes. However, unlike the former which tend to transcend each other, the reductionistic and holistic view realized in the two modeling approaches prove to set a rigorous framework for variable structure modeling. 1996 10.1080/03081079608945128 International Journal on General Systems 24 359--375 4 Adelinde M. Uhrmacher Bernard P. Zeigler inproceedings ns00u Variable structure models are models that entail in their description the possibility to change their own structure. Several modeling approaches which deal with variable structure modeling are presented. Different application domains pinpoint different perspectives in systems' modeling implying different solutions for variable structure modeling. Particularly, in the context of agent-oriented simulation variable structure modeling becomes a necessary precondition to describe individuals in processes of patterned interactions, embedded in and always (re-)creating perspectives. The focus of interest shifts from simulating systems to simulating actors, and the mediating role of variable structure modeling. 1996 Proc. of the 6th Annual Conference on Artificial Intelligence, Simulation and Planning in High Autonomy Systems IEEE-Press 133--140 Adelinde M. Uhrmacher techreport dvhpr95 1995 Ulm University 95-14 Axel Dold Friedrich von Henke Holger Pfeifer Harald ��ܱ�ß inproceedings Nebel95BaseRevisionOperations The theory of belief revision developed by Gärdenfors and his colleagues characterizes the classes of reasonable belief revision operations. However, some of the assumptions made in the theory of belief revision are unrealistic from a computational point of view. We address this problem by considering revision operations that are based on a priority ordering over a set of sentences representing a belief state instead of using preference relations over all sentences that are accepted in a belief state. In addition to providing a semantic justification for such operations, we investigate also the computational complexity. We show how to generate an epistemic entrenchment ordering for a belief state from an arbitrary priority ordering over a set of sentences representing the belief state and show that the resulting revision is very efficient. Finally, we show that some schemes for generating revision operations from bases can encode the preference relations more concisely than others. 1995 978-3-211-82713-0 10.1007/978-3-7091-2690-5_11 Proceedings of the ISSEK94 Workshop on Mathematical and Statistical Methods in Artificial Intelligence 363 Springer-Verlag International Centre for Mechanical Sciences Della Riccia, G. and Kruse, R. and Viertl, R. 157--170 Bernhard Nebel article ��ä������ٰ�ö��95���dz������澱�ٲ������ܱ��ٲ� We have previously reported a number of tractable planning problems defined in the SAS+ formalism. This paper complements these results by providing a complete map over the complexity of SAS+ planning under all combinations of the previously considered restrictions. We analyze the complexity both of finding a minimal plan and of finding any plan. In contrast to other complexity surveys of planning we study not only the complexity of the decision problems but also of the generation problems. We prove that the SAS+-PUS problem is the maximal tractable problem under the restrictions we have considered if we want to generate minimal plans. If we are satisfied with any plan, then we can generalize further to the SAS+-US problem, which we prove to be the maximal tractable problem in this case. 1995 Computational Intelligence 11 625--655 Christer ��ä������ٰ�ö�� Bernhard Nebel inproceedings Nebel95QualitativeSpatialReasoning While the computational properties of qualitative temporal reasoning have been analyzed quite thoroughly, the computational properties of qualitative spatial reasoning are not very well investigated. In fact, almost no completeness results are known for qualitative spatial calculi and no computational complexity analysis has been carried out yet. In this paper, we will focus on the so-called RCC approach and use Bennett's encoding of spatial reasoning in intuitionistic logic in order to show that consistency checking for the topological base relations can be done efficiently. Further, we show that path-consistency is sufficient for deciding global consistency. As a side-effect we prove a particular fragment of propositional intuitionistic logic to be tractable. 1995 978-3-540-60343-6 10.1007/3-540-60343-3_40 KI-95: Advances in Artificial Intelligence 981 Springer Berlin Heidelberg Lecture Notes in Computer Science Wachsmuth, Ipke and Rollinger, Claus-Rainer and Brauer, Wilfried 233--244 Bernhard Nebel inproceedings Henke95Construction In this paper we present an approach towards a framework based on the type theory ECC (Extended Calculus of Constructions) in which specifications, programs and operators for modular development by stepwise refinement can be formally described and reasoned about. We demonstrate how generic software development steps can be expressed as higher-order functions and how proofs about their asserted effects can be carried out in the underlying logical calculus. For formalizing transformations that require syntactic manipulation of objects, we introduce a two-level system combining a meta-level and an object level and show how to express and reason about transformations that faithfully represent object-level operators. 1995 KORSO: Methods, Languages, and Tools for the Construction of Correct Software Springer-Verlag Lecture Notes in Computer Science Manfred Broy 239--254 http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1995/Henke95Construction.pdf Friedrich von Henke Axel Dold Harald ��ܱ�ß Detlef Schwier Martin Strecker phdthesis Ruess95phd PhD Thesis 1995 University of Ulm Harald ��ܱ�ß inproceedings RPvH95 This paper is concerned with developing a reflective architecture for formalizing and reasoning about entities that occur in the process of software development, such as specifications, theorems, programs, and proofs. The starting point is a syntactic extension of the type theory ECC. An encoding of this object calculus within itself comprises the meta-level, and reflection principles are provided for switching between different levels. These reflection principles are used to mix object- and meta-level reasoning, to generate "standard" units by executing meta-operators, and to apply formal tactics that allow for abstraction from the base logic. 1995 IJCAI 1995 Workshop on Reflection and Meta Level Architecture and their Application in AI

Montreal, Canada

M. Ibrahim and P. Cointe and F. Cummins and F. Giunchiglia and J. Malenfant http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.090/Publikationen/1995/Ruess95FormalizationAndReasoning.pdf Harald ��ܱ�ß Holger Pfeifer Friedrich von Henke article �Ա�����1995��dz������澱��ä�ٲ����Բ��������� Die Analyse der Berechenbarkeitskomplexität von typischen KI-Problemen sowie der Entwurf effizienter Verfahren zum Lösen dieser Probleme hat in den letzten Jahren verstärkt Interesse gefunden. In diesem Beitrag wollen wir auf den Sinn von Komplexitätsanalysen eingehen, examplarisch das Vorgehen bei solchen Analysen darstellen und einige Methoden zum Umgang mit dem Komplexitätsproblem skizzieren. 1995 Künstliche Intelligenz 9 6--14 2 Bernhard Nebel poster Willy95Poster Poster 1995

EFFORD Congress, Munich

C. Willy Adelinde M. Uhrmacher H. Gerngross article Nebel1995427 The ability of a planner to reuse parts of old plans is hypothesized to be a valuable tool for improving efficiency of planning by avoiding the repetition of the same planning effort. We test this hypothesis from an analytical and empirical point of view. A comparative worst-case complexity analysis of generation and reuse under different assumptions reveals that it is not possible to achieve a provable efficiency gain of reuse over generation. Further, assuming “conservative” plan modification, plan reuse can actually be strictly more difficult than plan generation. While these results do not imply that there won't be an efficiency gain in some situations, retrieval of a good plan may present a serious bottleneck for plan reuse systems, as we will show. Finally, we present the results of an empirical study of two different plan reuse systems, pointing out possible pitfalls one should be aware of when attempting to employ reuse methods. 1995 10.1016/0004-3702(94)00082-C Artificial Intelligence 76 427--454 1--2 Bernhard Nebel Jana Koehler article ns00i This paper focuses on reasoning about change within the object-oriented modeling system EMSY. EMSY has been developed to support modeling and simulation in the domains of ecology and biology. Ecological systems are described as entities consisting of a set of attributes. rules, information about composition, environment, and coupling structure. Change takes place as the change of single entities, and is initiated by them. This specific view of systems serves as a base to describe a characteristic phenomenon of ecological systems: the change of system structure. 1995 10.1080/08839519508945472 Applied Artificial Intelligence 9 157--180 2 http://wwwmosi.informatik.uni-rostock.de/diemosiris/static/Papers_archiv/jaai95.pdfs Adelinde M. Uhrmacher article Nebel1995TemporalRelations We introduce a new subclass of Allen's interval algebra we call ``ORD-Horn subclass," which is a strict superset of the ``pointisable subclass." We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is sufficient for deciding satisfiability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming P=/=NP). In fact, it is the unique greatest tractable subclass amongst the subclasses that contain all basic relations. 1995 10.1145/200836.200848 Journal of the ACM 42 ACM 43--66 1 Bernhard Nebel �Ჹ�Բ�-��ü������� ��ü���������� inproceedings dold:representing In this paper generic software development steps of different complexity are represented and verified using the (higher-order, strongly typed) specification and verification system PVS. The transformations considered in this paper include “large” powerful steps encoding general algorithmic paradigms as well as “smaller” transformations for the operationalization of a descriptive specification. The application of these transformation patterns is illustrated by means of simple examples. Furthermore, we show how to guide proofs of correctness assertions about development steps. Finally, this work serves as a case-study and test for the usefulness of the PVS system. 1995 10.1007/3-540-60043-4_69 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology (AMAST '95) 936 Springer Berlin Heidelberg Lecture Notes in Computer Science V. S. Alagar and Maurice Nivat 431--445 Axel Dold inproceedings ���Ի��é1995�ɾ��� This video provides an overview of the WIP project. WIP aimed at the development of a presentation system that is able to generate a variety of multimedia documents considering generation parameters, such as target group, presentation objective, resource limitations, and target language (see Fig. 1). The major components of the WIP system are: a presentation planner that is responsible for determining the contents and selecting an appropriate medium combination, medium-specific generators and a layout manager that arranges the generated output in a document. The video gives a survey of the WIP architecture and demonstrates the performance of the single modules by several system runs. A basic assumption behind the WIP model is that no 1995 Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95) 2053--2054 Elisabeth Andre Wolfgang Finkler Winfried Graf Karin Harbusch Jochen Heinsohn Anne Kilger Bernhard Nebel �Ჹ�Բ�-��ü������� Profitlich Thomas Rist Wolfgang Wahlster Andreas Butz Anthony Jameson incollection �Ƿɲ��Ծ����쾱-�����ɱ�1995�ɾ�������Բ�������ä����Գٲ��پ��Dz� Wir geben eine Einführung in die Modellierung mit Hilfe logischer Methoden, skizzieren das Design von Wissensrepräsentationssystemen auf logischer und algorithmischer Ebene und diskutieren die Umsetzung in Implementationen. 1995 Einführung in die Künstliche Intelligenz Addison-Wesley G. Görz 3--54 Bernd Owsnicki-Klewe Kai von Luck Bernhard Nebel proceedings Nebel94KI This volume presents the proceedings of the 18th German Annual Conference on Artificial Intelligence (KI-94), held in Saarbrücken in September 1994. Besides the invited paper "AI approaches towards sensor-based support in road vehicles" by H.-H. Nagel, the book contains 33 full research papers and 12 poster presentations selected from a total of 98 contributions, half of them originating from outside Germany. The papers cover all relevant aspects of AI with a certain focus on knowledge representation and logical foundations of AI; further topics covered are neural network applications, logic programming, natural language, machine learning, and reasoning. 1994 3-540-58467-6 861 Springer-Verlag LNAI Nebel, Bernhard and Dreschler-Fischer, Leonie S. http://link.springer.com/book/10.1007%2F3-540-58467-6 article baader1994empirical We consider different methods of optimizing the classification process of terminological representation systems, and evaluate their effect on three different types of test data. Though these techniques can probably be found in many existing systems, until now there has been no coherent description of these techniques and their impact on the performance of a system. One goal of this paper is to make such a description available for future implementors of terminological systems. Building the optimizations that came off best into the KRIS system greatly enhanced its efficiency. 1994 10.1007/BF00872105 Applied Intelligence 4 Kluwer Academic Publishers 109--132 2 http://link.springer.com/article/10.1007%2FBF00872105 http://scidok.sulb.uni-saarland.de/volltexte/2011/3799/ Franz Baader Bernhard Hollunder Bernhard Nebel �Ჹ�Բ�-��ü������� Profitlich Enrico Franconi article heinsohn1994an The family of terminological representation systems has its roots in the representation system KL-ONE. Since the development of KL-ONE more than a dozen similar representation systems have been developed by various research groups. These systems vary along a number of dimensions. In this paper, we present the results of an empirical analysis of six such systems. Surprisingly, the systems turned out to be quite diverse, leading to problems when transporting knowledge bases from one system to another. Additionally, the runtime performance between different systems and knowledge bases varied more than we expected. Finally, our empirical runtime performance results give an idea of what runtime performance to expect from such representation systems. These findings complement previously reported analytical results about the computational complexity of reasoning in such systems. 1994 Artificial Intelligence 68 367--397 2 Jochen Heinsohn Daniel Kudenko Bernhard Nebel �Ჹ�Բ�-��ü������� Profitlich article bergamaschi1994automatic We present an intelligent tool for the acquisition of object oriented schemata supporting multiple inheritance, which preserves taxonomy coherence and performs taxonomic inferences. Its theoretical framework is based on terminological logics, which have been developed in the area of artificial intelligence. The framework includes a rigorous formalization of complex objects, which is able to express cyclic references on the schema and instance level; a subsumption algorithm, which computes all implied specialization relationships between types; and an algorithm to detect incoherent types, i.e., necessarily empty types. Using results from formal analyses of knowledge representation languages, we show that subsumption and incoherence detection are computationally intractable from a theoretical point of view. However, the problems appear to be feasible in almost all practical cases. 1994 Applied Intelligence 4 185--204 2 Sonia Bergamaschi Bernhard Nebel inproceedings Nebel94baserevision The theory of belief revision developed by Gärdenfors and his colleagues characterizes the classes of reasonable belief revision operations. However, some of the assumptions made in the theory of belief revision are unrealistic from a computational point of view. We address this problem by considering revision operations that are based on a priority ordering over a set of sentences representing a belief state instead of using preference relations over all sentences that are accepted in a belief state. In addition to providing a semantic justification for such operations, we investigate also the computational complexity. We show how to generate an epistemic entrenchment ordering for a belief state from an arbitrary priority ordering over a set of sentences representing the belief state and show that the resulting revision is very efficient. Finally, we show that some schemes for generating revision operations from bases can encode the preference relations more concisely than others. 1994 Proceedings of the 11th European Conference on Artificial Intelligence (ECAI '94) John Wiley & Sons 341--345 Bernhard Nebel inproceedings ns00v The maintaining and adaptation of knowledge within changing environments is one of the crucial aspects in decentralized controlled and distributed systems. To explore different strategies and their consequences, the authors use an example where processors, structured in a hierarchy, are hired or fired responding to the requests of the current work load. The modeling and simulation approach uses the actor metaphor of open systems, where the nodes of the hierarchy are perceived as autonomous agents with an internal explicit model about their environment. Questions about the distribution and maintenance of knowledge referring to the structure of systems, needs for cooperation, and the change of roles are discussed against the background of the example and complete the picture about the specific effects of the single strategies. DEVS, a knowledge-based simulation environment, constitutes the background of the authors' exploration. 1994 10.1109/AIHAS.1994.390487 Proceedings of the Fifth Annual Conference on AI, Simulation, and Planning in High Autonomy Systems. Distributed Interactive Simulation Environments IEEE-Press

Gainesville, FL, USA

178--184 Adelinde M. Uhrmacher R. Arnold book dold1994formalisierung 1994 Universität Ulm Ulmer Informatik-Berichte Axel Dold proceedings Lakemeyer:1994:645296 This collection of thoroughly refereed papers presents state-of-the-art research results by well-known researchers on the foundations of knowledge representation and reasoning. In addition, there are two surveys, one by the volume editors intended as a guide to this book and another by Shoham and Cousins on menytal attitudes. In total, the volume provides a well-organized report on current research in knowledge representation, which is one of the central subfields of AI. Except the surveys, the papers grew out of a workshop on Theoretical Foundations of Knowledge Representation and Reasoning, held in conjunction with the 10th European Conference on Artificial Intelligence (ECAI-92) in Vienna in August 1992. 1994 3-540-58107-3 810 Springer-Verlag LNAI Lakemeyer, Gerhard and Nebel, Bernhard http://dl.acm.org/citation.cfm?id=645296&picked=prox incollection lakemeyer1994foundations Knowledge representation (KR) is the area of Artificial Intelligence that deals with the problem of representing, maintaining, and manipulating knowledge about an application domain. Since virtually all Artificial Intelligence systems have to address this problem, KR is one of the central subfields of Artificial Intelligence. While knowledge about an application domain may be represented in a variety of forms, e.g., procedurally in form of program code or implicitly as patterns of activation in a neural network, research in the area of knowledge representation assumes an explicit and declarative representation, an assumption that distinguishes KR from research in, e.g., programming languages and neural networks. In this paper, we summarize the current state of the art in KR and classify the contributions in this volume. 1994 978-3-540-58107-9 10.1007/3-540-58107-3_1 Foundations of Knowledge Representation and Reasoning 810 Springer Berlin Heidelberg Lecture Notes in Computer Science Lakemeyer, Gerhard and Nebel, Bernhard 1--12 Gerhard Lakemeyer Bernhard Nebel inproceedings ns00w Die Biosphare 2, gelegen in der Wüste Arizonas, bildet ein geschlossenes Ökosystem, das dazu dient, in Langzeitversuchen Erfahrungen mit geschlossenen Mensch-Umwelt-Technik Systemen zu sammeln. Wahrend der erstenTestphase traten Phänomene in der Kohlendioxiddynamik auf, die eine Untersuchung der konkreten Situation des Kohlenstoffzyklus in Biosphare 2 nahelegten. Da zum einen die kausale Struktur nur unzureichend bekannt ist, undzum anderen die Entwicklungen unterschiedlichster Variablen durch Zeitreihen dokumentiert sind, bietet sich eine induktive Herangehensweise an. Das Verfahren des Fuzzy-basierten Induktiven Schliessens (FIS), das zur Analyse der Kohlendioxiddynamik von Biosphare 2 angewendet wird, ist für die Untersuchung und Simulation dynamischer Systeme entwickelt worden. Die Zeitreihen von möglicherweise den Kohlendioxidverlauf beeinflussenden Größen, wie z.B. Temperatur und Sonneneinstrahlung, dienen als Ausgangspunkt fur FIS, die relevanten "Inputs zu identifizieren und Verhaltensmodelle" für die Kohlendioxiddynamik zu entwickeln. Simulationsexperimente mit FIS demonstrieren die Güte der entwickelten Verhaltensmodelle. 1994 GI-Fachgruppe Maschinelles Lernen 95--104 http://wwwmosi.informatik.uni-rostock.de/diemosiris/static/Papers_archiv/mal94.pdf Adelinde M. Uhrmacher inproceedings Nebel94QTI For natural language understanding and generation, plan generation and recognition, and knowledge representation, it is necessary to represent qualitiave temporal information and to reason with it. Allen's interval calculus provides an appropriate framework for such a task. We introduce a new subclass of Allen's interval algebra we call ``ORD-Horn subclass," which is a strict superset of the ``pointisable subclass." We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is sufficient for deciding satisfiability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming P=/=NP). In fact, it is the unique greatest tractable subclass amongst the subclasses that contain all basic relations. 1994 3-540-57802-1 Management and Processing of Complex Data Structures Springer-Verlag Berlin K. von Luck and H. Marburger 104--117 Bernhard Nebel �Ჹ�Բ�-��ü������� ��ü���������� article nebel1994computational One kind of temporal reasoning is temporal projection - the computation of the consequences of a set of events. This problem is related to a number of other temporal reasoning tasks such as plan validation and planning. We show that one particular, simple case of temporal projection on partially ordered events turns out to be harder than previously conjectured, while planning is easy under the same restrictions. Additionally, we show that plan validation is tractable for an even larger class of plans - the unconditional plans - for which temporal projection is NP-hard, thus indicating that temporal projection may not be a necessary ingredient in planning and plan validation. Analyzing the partial decision procedure for the temporal projection problem that has been proposed by other authors, we notice that it fails to be complete for unconditional plans, a case where we have shown plan validation tractable. 1994 Artificial Intelligence 66 Elsevier 125--160 1 http://www.sciencedirect.com/science/article/pii/0004370294900051 Bernhard Nebel Christer ��ä������ٰ�ö�� inproceedings nebel1994reasoning We introduce a new subclass of Allen's interval algebra we call ``ORD-Horn subclass," which is a strict superset of the ``pointisable subclass." We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is sufficient for deciding satisfiability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming P=/=NP). In fact, it is the unique greatest tractable subclass amongst the subclasses that contain all basic relations. 1994 Proceedings of the 12th National Conference of the American Association for Artificial Intelligence (AAAI'94) 356--361 Bernhard Nebel �Ჹ�Բ�-��ü������� ��ü���������� book padgham1993combining The formal analysis of semantic networks and frame systems led to the development of nonmonotonic inheritance networks and terminological logics. While nonmonotonic inheritance networks formalize the notion of defeasible inheritance of typical properties, terminological logics formalize the notion of defining concepts and reasoning about definitions. Although it seems to be desirable to (re-)unify the two approaches, such an attempt has not been made until now. In this paper, we will make a first step into this direction by specifying a nonmonotonic extension of a simple terminological logic. 1993 Methodologies for Intelligent Systems (ISMIS '93) Springer-Verlag 132--141 Lin Padgham Bernhard Nebel inproceedings backstrom1993complexity We have previously reported a number of tractable planning problems defined in the SAS+ formalism. This paper complements these results by providing a complete map over the complexity of SAS+ planning under all combinations of the previously considered restrictions. We analyse the complexity both of finding a minimal plan and of finding any plan. In contrast to other complexity surveys of planning we study not only the complexity of the existence problems but also of the search problems. We prove that the SAS+-PUS problem is the maximal tractable problem under the restrictions we have considered if we want to find a minimal plan. If we are satisfied with finding any plan, then we can generalize further to the SAS+-US problem, which we prove to be the maximal tractable problem in this case. 1993 Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI '93) Christer ��ä������ٰ�ö�� Bernhard Nebel article baader1993expressivity Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional uncertainty construct needed for the description of long-distance dependencies and obtain the following results: satisfiability of feature terms is undecidable, sort equations can be internalized, consistency of sort equations is decidable if there is at least one atom, and consistency of sort equations is undecidable if there is no atom. 1993 Journal of Logic, Language and Information 2 Springer 1--18 1 http://link.springer.com/article/10.1007%2FBF01051766 Franz Baader �Ჹ�Բ�-��ü������� ��ü���������� Bernhard Nebel Werner Nutt Gert Smolka inproceedings Nebel1993PlanModVSPlanGen The ability of a planner to modify a plan is considered as a valuable tool for improving efficiency of planning by avoiding the repetition of the same planning effort. From a computational complexity point of view, however, it is by no means obvious that modifying a plan is computationally as easy as planning from scratch if the modification has to follow the principle of ``conservatism," i.e., to reuse as much of the old plan as possible. Indeed, considering propositional STRIPS planning, it turns out that conservative plan modification is as hard as planning and can sometimes be harder than plan generation. Furthermore, this holds even if we consider modification problems where the old and the new goal specification are similar. We put these results into perspective and discuss the relationship to existing plan modification systems. 1993 Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI '93) Morgan Kaufmann 1436--1441 Bernhard Nebel Jana Koehler inproceedings Nebel1993PlanModVSPlanGenPuK 1993 Planen und Konfigurieren (PuK'93) 7--17 Bernhard Nebel Jana Koehler techreport pub5900 The aim of the project 'Personlized Plan-Based Presenter' (PPP) is to explore and develop innovative presentation techniques for future intelligent user interfaces. The central issues of the project are:1. Planning multimedia presentation acts2. Interactive multimedia presentations3. Monitoring the effectiveness of a presentation4. Providing a firm representation foundationPresentation design can be viewed as a relatively unexplored area of common-sense reasoning. Unlike most research on common-sense reasoning to date, the PPP project does not deal with metadomain research on general design principles, but focuses on formal methods capturing some of the reasoning in the design space of presentations for specific and realistic domains. The development of an interactive, multimedia presentation system requires efforts from various research areas such as planning, knowledge representation, constraint processing, natural language, and knowledge-based graphics generation. 1993 Deutsches Forschungszentrum für Künstliche Intelligenz,DFKI DFKI Documents, D DFKI Document D-93-05 Elisabeth Andre Winfried Graf Jochen Heinsohn Bernhard Nebel �Ჹ�Բ�-��ü������� Profitlich Thomas Rist Wolfgang Wahlster inproceedings ns00x Two different object-oriented modeling approaches, DEVS and EMSY, constitute the background to explore the area of variable structure modeling. The realization of various kinds of structural changes is discussed in both approaches. Against the background of their prime application domain, both approaches deal with the problem of structural change differently. While DEVS implies attention more to the intelligent control of structural change, EMSY emphasizes the autonomous character of the system. Nevertheless, control and autonomy are intertwined in both approaches to handle structural change. 1993 10.1109/AIHAS.1993.410588 Proceedings of the 4th Annual Conference on AI, Simulation, and Planning in High Autonomy Systems - Integrating Virtual Reality and Model-Based Environments IEEE Press

Tucson, AZ

133--139 Adelinde M. Uhrmacher inproceedings Foerster93VSE The potential dangers from a malfunctioning of information processing systems range from simple loss of data to loss of life. This led many states come up with (hierarchies of) criteria to evaluate the trustworthiness of software systems. The Verification Support Environment (VSE) was designed to satisfies the requirements of the higher levels of such catalogs of criteria. VSE complements the usual functionality of CASE tools with support for formal specification and verification of software systems or parts thereof. In this paper we will outline the formal concepts of VSE, the system architecture, and the system's application to real world examples, taking the VSE [Vorgehensmodell] as a guideline. 1993 Proceedings of the 3. Deutscher IT-Sicherheitskongress des BSI 327--337 R. ��ö�����ٱ�� P. Kejwal P. Baur P. ��ö��Ա�� J. Cleve R. Drexler D. Hutter C. Sengler Siekmann Werner Stephan A. Wolpers W. Reif Ercument Canver Friedrich von Henke incollection Ullmann93VerificationSupport Um das Vertrauen in die Korrektheit eines IT-Systems (Informationstechnisches System) zu beurteilen, werden in einschlägigen Sicherheitskriterien [IT-SK, ITSEC] Qualitätsanforderungen u.a. an den Entwicklungsprozeß der Sicherheitsfunktionalität von IT-Systemen gestellt. Für die hohen Qualitätssstufen [IT-SK]/Evaluationsstufen [ITSEC] wird insbesondere der Einsatz formaler Methoden zur Entwicklung der sicherheitsrelevanten Systemkomponenten vorgeschrieben.In diesem Beitrag wird das Entwicklungswerkzeug Verification Support Environment und seine Methodik zur Entwicklung vertrauenswürdiger Software-Systeme vorgestellt. Dieses Werkzeug ist konzeptionell an den Anforderungen der höheren Qualitätsstufen/Evaluationsstufen einschlägiger Sicherheitskriterienwerke ausgerichtet.Das Neue und Außergewöhnliche an diesem Werkzeug gegenüber klassischen CASE-Werkzeugen ist die Möglichkeit, über formale Spezifikations- und Verifikationsmethodiken, die Korrektheit ganzer Software-Systeme oder Teilen davon formal nachzuweisen. 1993 978-3-528-05344-4 10.1007/978-3-322-88782-5_12 Verläßliche Informationssysteme Vieweg+Teubner Verlag �ٳܶ�-�󲹳�����𾱳ٰ�ä���� Weck, Gerhard and Horster, Patrick 175--190 M. Ullmann H. Hauff D. Loevenich P. Kejwal R. ��ö�����ٱ�� P. Baur P. ��ö��Ա�� R. Drexler W. Reif Werner Stephan A. Wolpers J. Cleve D. Hutter C. Sengler Ercument Canver incollection ns00l 1992 AI, Expert Systems, and Symbolic Computing for Scientific Computation North Holland, Amsterdam Houstis, E. N. and Rice, J. R. Adelinde M. Uhrmacher inproceedings ns00y 1992 SoftStat '91. Advances in Statistical Software. Gustav Fischer

Stuttgart

343-352 Adelinde M. Uhrmacher inproceedings Baur92VSE 1992 IFA Symposium on Safety, Security and Reliability of Computers P. Baur Plasa P. Kejwal R. Drexler W. Reif Werner Stephan A. Wolpers D. Hutter C. Sengler Ercument Canver