Suche mittels Attribut

Diese Seite stellt eine einfache Suchoberfläche zum Finden von Objekten bereit, die ein Attribut mit einem bestimmten Datenwert enthalten. Andere verfügbare Suchoberflächen sind die Attributsuche sowie der Abfragengenerator.

Liste der Ergebnisse

Notation3 Logic: From informal to formal semantics + (Notation3 Logic is a rule-based extension … Notation3 Logic is a rule-based extension of RDF. Since its invention, the logic has been refined and applied in several reasoning engines like for example EYE, Cwm and FuXi. But despite these developments, a clear formal definition of Notation3’s semantics is still missing and the details of the logic are only defined in an informal way. This lack of formalisation does not only cause theoretical problems - the relationship to other logics cannot be investigated - it also has practical consequences: in many cases the interpretations of the same formula differ between reasoning engines. In this talk, I will explain these differences and discuss how the formal semantics of the logic can be defined based on the informal specifications and the implementations.This talk will be held online. If there is any interest in attending, please send an e-mail to thomas.feller@tu-dresden.de. an e-mail to thomas.feller@tu-dresden.de.)
Enabling Fine-grained RDF Data Completeness Assessment + (Nowadays, more and more RDF data is becomi … Nowadays, more and more RDF data is becoming available on the Semantic Web. While the Semantic Web is generally incomplete by nature, on certain topics, it already contains complete information and thus, queries may return all answers that exist in reality. We develop a technique to check query completeness based on RDF data annotated with completeness information, taking into account data-specific inferences that lead to an inference problem which is \Pi^P_2-complete. We then identify a practically relevant fragment of completeness information, suitable for crowdsourced, entity-centric RDF data sources such as Wikidata, for which we develop an indexing technique that allows to scale completeness reasoning to Wikidata-scale data sources. We verify the applicability of our framework using Wikidata and develop COOL-WD, a completeness tool for Wikidata, used to annotate Wikidata with completeness statements and reason about the completeness of query answers over Wikidata. The tool is available [http://cool-wd.inf.unibz.it/ here].lable [http://cool-wd.inf.unibz.it/ here].)
Context Reasoning for Role-Based Models + (Nowadays, we are literally everywhere surr … Nowadays, we are literally everywhere surrounded by software systems. These should cope with very complex scenarios including the ability of context-awareness and self-adaptability. The concept of roles provide the means to model such complex, context-dependent systems. In role-based systems, the relational and context-dependent properties of objects are transferred into the roles that the object plays in a certain context. However, even if the domain can be expressed in a well-structured and modular way, role-based models can still be hard to comprehend due to the sophisticated semantics of roles, contexts and different constraints. Hence, unintended implications or inconsistencies may be overlooked. A feasible logical formalism is required here. In this setting Description Logics (DLs) fit very well as a starting point for further considerations since as a decidable fragment of first-order logic they have both an underlying formal semantics and decidable reasoning problems. DLs are a well-understood family of knowledge representation formalisms which allow to represent application domains in a well-structured way by DL-concepts, i.e. unary predicates, and DL-roles, i.e. binary predicates. However, classical DLs lack expressive power to formalise contextual knowledge which is crucial for formalising role-based systems. We investigate a novel family of contextualised description logics that is capable of expressing contextual knowledge and preserves decidability even in the presence of rigid DL-roles, i.e. relational structures that are context-independent. For these contextualised description logics we thoroughly analyse the complexity of the consistency problem. Furthermore, we present a mapping algorithm that allows for an automated translation from a formal role-based model, namely a Compartment Role Object Model (CROM), into a contextualised DL ontology. We prove the semantical correctness and provide ideas how features extending CROM can be expressed in our contextualised DLs. As final step for a completely automated analysis of role-based models, we investigate a practical reasoning algorithm and implement the first reasoner that can process contextual ontologies.er that can process contextual ontologies.)
11. EMCL Workshop + (On the 11th and 12th February, the 11th EM … On the 11th and 12th February, the 11th EMCL student workshop took place in Vienna (see http://www.logic.at/emcl2016/).Students in the European Master's Program in Computational Logic of the universities in Bozen, Dresden, Vienna, and Lisbon organized the workshop.The program contains presentations by the students suggested for master theses, presentations by alumni about their continued education in PhD programs or in industry, and research talks by the partner universities.Students from more than 21 nations participated.During the workshop, the Best Master Thesis Award 2015 was given to Adrian Rebola Pardo for his thesis about the generation of proofs in SAT solvers.The social program included a city tour to St. Stephen's Cathedral, ice skating and a dinner at Die Halle. [http://www.emcl-study.eu www.emcl-study.eu]ttp://www.emcl-study.eu www.emcl-study.eu])
12. EMCL Workshop + (On the 20th and 21th February, the 12th EM … On the 20th and 21th February, the 12th EMCL student workshop takes place in Dresden (see http://www.pk.workshop.computational-logic.org/).Students in the European Master's Program in Computational Logic of the universities in Bozen, Dresden, Vienna, and Lisbon organize the workshop.The program contains presentations by the students suggested for master theses, presentations by alumni about their continued education in PhD programs or in industry, and research talks by the partner universities. During the workshop, the Best Master Thesis Award 2017 will be given.st Master Thesis Award 2017 will be given.)
Pattern-based ontology modeling and some of its implications for Description Logics research + (One of the original motivations for develo … One of the original motivations for developing ontologies was that they were to act as generic domain models which can be easily reused and repurposed. However, ontology modeling for applications in practice is often driven by very concrete use cases, and thus the corresponding ontologies are often strongly tailored towards meeting very specific use case requirements. As a consequence, ontologies in practice are often not easy to repurpose. In this presentation, we discuss how to model ontologies in such a way as to simplify future reuse. In particular, we will discuss modularization of ontologies, the role of ontology design patterns, and ontology views. Our observations furthermore expose limitations of current description logics which may stimulate research investigations.Pascal Hitzler is (full) Professor and Director of Data Science at the Department of Computer Science and Engineering at Wright State University in Dayton, Ohio, U.S.A. His research record lists over 300 publications in such diverse areas as semantic web, neural-symbolic integration, knowledge representation and reasoning, machine learning, denotational semantics, and set-theoretic topology. He is Editor-in-chief of the Semantic Web journal by IOS Press, and of the IOS Press book series Studies on the Semantic Web. He is co-author of the W3C Recommendation OWL 2 Primer, and of the book Foundations of Semantic Web Technologies by CRC Press, 2010 which was named as one out of seven Outstanding Academic Titles 2010 in Information and Computer Science by the American Library Association's Choice Magazine, and has translations into German and Chinese. He is on the editorial board of several journals and book series and is a founding steering committee member of the Web Reasoning and Rule Systems (RR) conference series, of the Neural-Symbolic Learning and Reasoning (NeSy) workshop series, and of the Association for Ontology Design and Patterns (ODPA). He also frequently acts as conference chair in various functions. as conference chair in various functions.)
Explaining Answer Sets using Argumentation Theory + (One of the prominent techniques for solvin … One of the prominent techniques for solving knowledge representation and reasoning problems is answer set programming (ASP). A problem is encoded as a set of inference rules expressing everything known about this problem, and the problem's solutions, the answer sets, are the sets of all non-conflicting literals deducible from these rules. Answer sets can be efficiently computed using answer set solvers; however they do not provide any explanation as to why a literal is or is not part of this answer set. Having an explanation of literals in a solution is particularly desirable when ASP is used as a reasoning tool in applications such as medical decision making, where the solutions are used by non-ASP-experts like doctors.In this talk I will present ABA-Based Answer Set Justifications, which based on Argumentation Theory explain why a literal is or is not contained in an answer set. Reasoning in Argumentation Theory involves forming arguments from the given knowledge and evaluating the conflicts between them. Since this type of reasoning is easily understandable for humans yet processable by computers, Argumentation Theory is a suitable technique for providing explanations of answer sets for humans. ABA-Based Answer Set Justifications are based on the correspondence between answer sets and stable extensions in Argumentation Theory and provide an explanation in terms of an admissible fragment of the stable extension corresponding to the answer set in question.rresponding to the answer set in question.)
Standpoint Logic: Multi-Perspective Knowledge Representation + (Ontologies and knowledge bases encode, to … Ontologies and knowledge bases encode, to a certain extent, the stand-points or perspectives of their creators. As differences and conflicts between stand-points should be expected in multi-agent scenarios, this will pose challenges for shared creation and usage of knowledge sources.Our work pursues the idea that, in some cases, a framework that can handle diverse and possibly conflicting standpoints is more useful and versatile than forcing their unification, and avoids common compromises required for their merge. Moreover, in analogy to the notion of family resemblance concepts, we propose that a collection of standpoints can provide a simpler yet more faithful and nuanced representation of some domains.To this end, we present standpoint logic, a multi-modal framework that is suitable for expressing information with semantically heterogeneous vocabularies, where a standpoint is a partial and acceptable interpretation of the domain. Standpoints can be organised hierarchically and combined, and complex correspondences can be established between them. We provide a formal syntax and semantics, outline the complexity for the propositional case, and explore the representational capacities of the framework in relation to standard techniques in ontology integration, with some examples in the Bio-Ontology domain.This is a test talk for a presentation at FOIS 2021. Thus it will have a duration of 15 minutes after which questions can be asked. The talk will be given online via BigBlueButton. To access the room, use one of the following links:with ZIH-login:https://selfservice.zih.tu-dresden.de/l/link.php?m=145027&p=4d1d790dwithout ZIH-login:https://selfservice.zih.tu-dresden.de/link.php?m=145027&p=93e20500zih.tu-dresden.de/link.php?m=145027&p=93e20500)
Description Logic with Abstraction and Refinement + (Ontologies often require knowledge represe … Ontologies often require knowledge representation on multiple levels of abstraction, but description logics (DLs) are not well-equipped for supporting this. We propose an extension of DLs in which abstraction levels are first-class citizens and which provides explicit operators for the abstraction and refinement of concepts and roles across multiple abstraction levels, based on conjunctive queries. We prove that reasoning in the resulting family of DLs is decidable while several seemingly harmless variations turn out to be undecidable. We also pinpoint the precise complexity of our logics and several relevant fragments.our logics and several relevant fragments.)
Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata + (Ontologies represent one of the basic elem … Ontologies represent one of the basic elements in the Semantic Web. They contain backgroundknowledge represented by relevant terms and formal relations between them, so that machinescan read it automatically. Ontologies on the Semantic Web come from a vast variety of differentsources, spanning institutions, and persons aiming for different goals and quality criteria.Measuring some of the aspects of ontologies, enables us to answer the question: “How to assessthe quality of an ontology on the Web?”. The ontology evaluation task is essential for a wideadoption of ontologies, in the Semantic Web and in other semantically enabled technologies.The Wikidata project, being a part of a big Wikimedia family, is widely known for its data that isprovided freely to the public. The data is structured and stored in a web ontology. This ontologyhas turned immediately into a resource of big value, with a large range of potential applicationsacross all areas of science, technology, and culture. Unfortunately, at the moment there is nopossibility to assess the quality of the Wikidata ontology.We have chosen Wikidata as a basic scenario for implementation of an automated system whichwould allow to browse the class hierarchy contained in the Wikidata ontology. The class hier-archy is created by the class entities and two properties (‘subclass of’ and ‘instance of’) whichdenote relations between classes. Besides the Wikidata taxonomy browser, additionally we im-plemented a component for ontology evaluation, which shows how the quality of the Wikidataontology is assessed for several evaluation criteria.This is the defence of the eponymous Master thesis by Serge Stratan. eponymous Master thesis by Serge Stratan.)
Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata + (Ontologies represent one of the basic elem … Ontologies represent one of the basic elements in the Semantic Web. They contain backgroundknowledge represented by relevant terms and formal relations between them, so that machinescan read it automatically. Ontologies on the SemanticWeb come from a vast variety of differentsources, spanning institutions, and persons aiming for different goals and quality criteria. Measuring some of the aspects of ontologies, enables us to answer the question: “How to assessthe quality of an ontology on the Web?”. The ontology evaluation task is essential for a wideadoption of ontologies, in the Semantic Web and in other semantically enabled technologies. The Wikidata project, being a part of a big Wikimedia family, is widely known for its data that isprovided freely to the public. The data is structured and stored in a web ontology. This ontologyhas turned immediately into a resource of big value, with a large range of potential applicationsacross all areas of science, technology, and culture. Unfortunately, at the moment there is nopossibility to assess the quality of the Wikidata ontology. We have chosen Wikidata as a basic scenario for implementation of an automated system whichwould allow to browse the class hierarchy contained in the Wikidata ontology. The class hierarchyis created by the class entities and two properties (‘subclass of’ and ‘instance of’) whichdenote relations between classes. Besides the Wikidata taxonomy browser, additionally we implementeda component for ontology evaluation, which shows how the quality of the Wikidataontology is assessed for several evaluation criteria.kidata ontology is assessed for several evaluation criteria.)
Iterative Ontology Update with Minimum Change + (Ontologies, which form the core of Semanti … Ontologies, which form the core of Semantic Web systems, need to evolve to meet the changing needs of the system and its users. The dynamic nature of ontology development has motivated the formal study of ontology evolution problems, which is one of the important problems in the current Semantic Web research. Ontology evolution approaches suffer from intrinsic information loss. The current study deals with the problem of minimizing information loss during iterative ontology update. It provides a framework combining the ontology evolution tasks with context-based reasoning method. Using this framework, all the solutions obtained in an ontology evolution task, which are partly redundant, can be described as contexts and compactly represented in a single labelled ontology. Further updates and reasoning can be done on this ontology efficiently.We propose new approaches to do ontology contraction, ontology expansion and ontology revision using context-based reasoning method. These approaches show how ontology evolution can be done with minimum information loss by using all the solutions obtained at every stage of the evolution task, efficiently using our framework. We also propose theoreticalmethods to extract the optimal solutions from the ontology obtained as the result of iterative ontology update. We show that, optimal solutions in the intermediate stages of iterative ontology update may not be the optimal solutions in the result obtained at the end of all the stages. We handle various notions of an optimal solution: the solution whichchanges the semantics of the ontology as minimum as possible, the solution which contains some of the intended consequences, the solution which has the most original axioms of the ontology. We also propose theoretical methods to do context-based reasoning over the optimal solutions extracted.We present the first prototypical implementation of the theoretical methods developed in this thesis and show the preliminary results of our implementation on the real-world ontologies.plementation on the real-world ontologies.)
Temporal Query Answering in EL + (Ontology-based query answering (OBQA) augm … Ontology-based query answering (OBQA) augments classical query answering in databases by adopting the open-world assumption and including domain knowledge provided by an ontology. We investigate temporalized OBQA w.r.t. ontologies formulated in EL, a description logic that allows for efficient reasoning and is successfully applied in practice. We specifically focus on a recently proposed temporalized query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL), and study both data and combined complexity of query entailment in this setting. We also analyze the satisfiability problem in the similar formalism EL-LTL.y problem in the similar formalism EL-LTL.)
Answering Queries with Negation over Existential Rules + (Ontology-based query answering with existe … Ontology-based query answering with existential rules is well understood and implemented for positive queries, in particular conjunctive queries. The situation changes drastically for queries with negation, where there is no agreed-upon semantics or standard implementation. Stratification, as used for Datalog, is not enough for existential rules, since the latter still admit multiple universal models that can differ on negative queries. We, therefore, propose universal core models as a basis for meaningful (non-monotonic) semantics for queries with negation. Since cores are hard to compute, we identify syntactic descriptions of queries that can equivalently be answered over other types of models. This leads to fragments of queries with negation that can safely be evaluated by current chase implementations. We establish new techniques to estimate how the core model differs from other universal models, and we incorporate our findings into a new reasoning approach for existential rules with negation.The talk is about an upcoming publication in AAAI 2022 by Stefan Ellmauthaler, Markus Krötzsch, Stephan MennickeThe talk is online,Link: https://bbb.tu-dresden.de/b/ali-zgz-l8d-52nttps://bbb.tu-dresden.de/b/ali-zgz-l8d-52n)
Aktivitaet2044 + (Organiser of the 2nd Internationalen Competition on Computational Models of Argumentation (ICCMA 2017))
Aktivitaet2069 + (Organisor of the 3rd Internationalen Workshops on Systems and Algorithms for Formal Argumentation (SAFA 2020))
Aktivitaet2097 + (Organisor of the 4th Internationalen Workshops on Systems and Algorithms for Formal Argumentation (SAFA 2022))
Query Stability in Data-aware Business Processes + (Organizations continuously accumulate data … Organizations continuously accumulate data, often according to some business processes. If one poses a query over such data for decision support, it is important to know whether the query is stable, that is, whether the answers will stay the same or may change in the future because business processes may add further data.We investigate query stability for conjunctive queries. To this end, we define a formalism that combines an explicit representation of the control flow of a process with a specification of how data is read and inserted into the database. We consider different restrictions of the process model and the state of the system, such as negation in conditions, cyclic executions, read access to written data, presence of pending process instances, and the possibility to start fresh process instances. We identify for which combinations of restrictions stability of conjunctive queries is decidable and provide encodings into variants of Datalog that are optimal with respect to the worst-case complexity of the problem.Werner Nutt is a professor at the Faculty of Computer Science at the University of Bozen since 2005. Prior to this, he was reader at Heriot-Watt University, Edinburgh (2000-2005), visiting professor at the Hebrew University of Jerusalem, and research scientist at the German Research Center for Artificial Intelligence (DFKI) in Saarbruecken (1992-2000). His research interests are in knowledge representation and databases.in knowledge representation and databases.)
Aktivitaet2020 + (Organizer of the ICCL Summerschool 2015)
Augmenting human cognition in collaborative knowledge collections + (Over the past decade, a wide range of coll … Over the past decade, a wide range of collaborative knowledge collections has emerged on the Web that are the direct product of cognitive user activities. These activities include editing an article on Wikipedia, providing a patch to open source software, or tagging pictures on Flickr. Collaborative knowledge collections provide a unique research environment for studying existing interdependencies between people's participation processes (the social system), the employed software (the technical system) and the collectively created artifact (the knowledge system). By unfolding existing design parameters of these systems, we can design more effective collaborative knowledge creation and learning processes and build new software that augment human cognition by computation. In this talk, I intend to (i) introduce three perspectives whose linkage disclose various research challenges for building social computing systems, (ii) present selected results of my research in which I looked at social computing systems from multiple vantage points, and (iii) illustrate how we can augment knowledge creation processes by building software that combines human and machine intelligence.t combines human and machine intelligence.)
Aktivitaet2041 + (PC DCFS 2017)
Aktivitaet2054 + (PC Member: 27th International Joint Conference on Artificial Intelligence (IJCAI 2018))
Aktivitaet2055 + (PC Member: 27th International Joint Conference on Artificial Intelligence (IJCAI 2018))
Aktivitaet2042 + (PC NCMA 2017)
Aktivitaet2080 + (PC member of AJCAI 2021)

Aktivitaet2102 + (PC member of AJCAI 2022)

Aktivitaet2115 + (PC member of ECAI 2023)
Aktivitaet2121 + (PC member of ECAI 2024)
Aktivitaet2107 + (PC member of IJCAI 2023)
Aktivitaet2122 + (PC member of IJCAI 2024)
Aktivitaet2083 + (PC member of IJCAI-ECAI 2022)
Aktivitaet2101 + (PC member of KR 2022)
Aktivitaet2125 + (PC member of KR 2024)
Aktivitaet2103 + (PC member of the 16th International Rule Challenge @RuleML+RR 2022)
Aktivitaet2104 + (PC member of the 37th AAAI Conference on Aritficial Intelligence (AAAI 2023))
Finding p-indecomposable Functions + (Parametric expressibility of functions is … Parametric expressibility of functions is a generalization of expressibility via composition. All parametrically closed classes of functions form a lattice. For finite domains the lattice is shown to be finite, however straight-forward iteration over all functions is infeasible, and so far the indecomposable functions are only known for domains with two and three elements. In this work we show how p-indecomposable functions can be computed more efficiently by means of an extended version of attribute exploration - a robust active learning technique. Under certain assumptions it is possible to complete the lattice of parametrically closed classes of functions for a finite domain. Attribute exploration relies on the routine of finding counter-examples to attribute implications. This routine will be the focus of the talk.his routine will be the focus of the talk.)
On the Complexity of Universality for Partially Ordered NFAs + (Partially ordered nondeterminsitic finite … Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, i.e., for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it accepts all words over its input alphabet. Deciding universality is PSpace-complete for poNFAs, and we show that this remains true even when restricting to a fixed alphabet. This is nontrivial since standard encodings of alphabet symbols in, e.g., binary can turn self-loops into longer cycles. A lower coNP-complete complexity bound can be obtained if we require that all self-loops in the poNFA are deterministic, in the sense that the symbol read in the loop cannot occur in any other transition from that state. Nevertheless, the limitation to fixed alphabets turns out to be essential even in the restricted case: deciding universality of rpoNFAs with unbounded alphabets is PSpace-complete.This is a joint work with Markus Krötzsch and Michaël Thomazo.with Markus Krötzsch and Michaël Thomazo.)
Neuer Mitarbeiter: Piotr Ostropolski-Nalewaja + (Piotr Ostropolski-Nalewaja joined the [[Computational Logic]] … Piotr Ostropolski-Nalewaja joined the [[Computational Logic]] group in October 2021. For the next couple of years, he will be working as a postdoc researcher in the group of Prof. [[Sebastian Rudolph]] on the ERC project [[DeciGUT]]. Before that Piotr was a PhD student at the University of Wrocław, where he was doing research on existential rules (see https://orcid.org/0000-0002-8021-1638 for more info). Good luck, Piotr!r more info). Good luck, Piotr!)
Aktivitaet2063 + (President of the ICCMA Steering Committee (since Oktober 2019))
Aktivitaet2009 + (President of the Open Semantic Data Association (OSDA))
Aktivitaet2003 + (Principal Investigator in the DFG Research Training Group "Quantitative Logics and Automata" (QuantLA))
Aktivitaet2001 + (Proceedings & Publicity Chair of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2012))
Automatentheorie + (Prof. Dr.-Ing. Franz Baader was appointed … Prof. Dr.-Ing. Franz Baader was appointed to the chair of automata theory in 2002. His chair offers basic and in-depth courses for various degree programmes, and conducts research in the areas of deduction, knowledge representation, as well as computing with molecules.Further information: https://lat.inf.tu-dresden.deinformation: https://lat.inf.tu-dresden.de)
Award1000 + (Prof. Franz Baader was selected as an [https://www.eurai.org/awards_and_grants/fellows ECCAI Fellow]. Here is a [https://lat.inf.tu-dresden.de/research/ECCAIfellow.html picture] of the award ceremony at the ECCAI fellows lunch at ECAI'04 in August 2004.)
Award1009 + (Prof. Franz Baader, Rafael Peñaloza and Bo … Prof. Franz Baader, Rafael Peñaloza and Boontawee Suntisrivaraporn have been nominated for the Best Paper Award of the [http://www.ki2007.uni-osnabrueck.de/ German Conference on Artificial Intelligence (KI-2007)] in September 2007 for their scientific contribution on Pinpointing in the Description Logic EL+. Pinpointing in the Description Logic EL+.)
Award1008 + (Prof. Luís Moniz Pereira from the Universidade Nova de Lisboa, Portugal received the Honorary Doctoral Degree from Technische Universität Dresden on 4th December 2006. For more information please [[Honorary_Doctoral_Degree_2006/en|click here]].)
Award1015 + (Prof. Michael Thielscher received the Awar … Prof. Michael Thielscher received the Award for an Outstanding Paper with a Student Author (Hannes Straß) at the [http://commonsensereasoning.org/2009/ 9th International Symposium on Logical Formalizations of Commonsense Reasoning] in Toronto, Canada in June 2009.easoning] in Toronto, Canada in June 2009.)
Award1016 + (Prof. Michael Thielscher received the Future Fellowship Award by the Australian Research Council (ARC).)
Award1001 + (Prof. Steffen Hölldobler received the 2004 Teaching Award by the Association of Friends and Sponsors of the Technische Universität Dresden on July 15, 2005. See [[Teaching_Award_TUD_2004/en|here]] for details.)
Award1013 + (Prof. Steffen Hölldobler received the Award for German University Coordinators in Erasmus Mundus 2004-2008 by the DAAD for the organization of the European Master's Program in CL. For more information please click [[DAAD_Award_2008/en|here]].)
Award1007 + (Prof. Steffen Hölldobler received the Dresden Congress Award 2006 for the organization of the ICCL Summer School on Logic-based Knowledge Representation on 8th November 2006. For more information please [[Dresden_Congress_Award_2006/en|click here]].)