Suche mittels Attribut
Aus International Center for Computational Logic
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
- 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.</br></br></br>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.</br></br></br>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.</br></br></br>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). <br> <br></br></br>Good luck, Piotr!r more info). <br> <br> 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.</br></br>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]].)
- Aktivitaet2035 + (Program Chair and Organizer of the 1st International Workshops on Argumentation in Logic Programming and Non-Monotonic Reasoning (Arg-LPNMR 2016))
- Aktivitaet2026 + (Program Chair and Organizer of the 1st International Workshops on Argumentation and Logic Programming (ArgLP 2015))
- Aktivitaet2010 + (Program chair of the 38th German Conference on Artificial Intelligence (KI 2015))
- Aktivitaet2099 + (Program committee member of the 15th Workshop on Answer Set Programming and Other Computing Paradigms)
- Aktivitaet2119 + (Program committee member of the 26th European Conference on Artificial Intelligence 2023 (ECAI 2023))
- Aktivitaet2123 + (Program committee member of the 27th European Conference on Artificial Inelligence)
- Aktivitaet2106 + (Program committee member of the 37th AAAI Conference on Artifical Intelligence 2023)
- An Introduction to Proof Theory I: Sequent Calculus + (Proof theory is an important branch of mat … Proof theory is an important branch of mathematical logic that is primarily concerned with the study and application of mathematical proofs. One of the preferred formalisms in proof theory for building deductive systems is Gerhard Gentzen's sequent calculus formalism. This talk is intended as an introduction to proof theory and will introduce a variant of Gentzen's sequent calculus for classical propositional logic. Moreover, the sequent calculus will be used to demonstrate and define fundamental proof theoretic notions such as sequents, types of inference rules, methods of soundness and completeness, and properties of calculi.</br></br></br>This lecture will take place online via BigBlueButton. To access the room, take one of the following links:</br></br>with ZIH-login:</br></br>https://selfservice.zih.tu-dresden.de/l/link.php?m=88852&p=57980ee1</br></br>without ZIH-login:</br></br>https://selfservice.zih.tu-dresden.de/link.php?m=88852&p=7788afd1.zih.tu-dresden.de/link.php?m=88852&p=7788afd1)
- Beweistheorie + (Proof theory serves as one of the central … Proof theory serves as one of the central pillars of mathematical logic and concerns the study and application of formal mathematical proofs. Typically, proofs are defined as syntactic objects inductively constructible through applications of inference rules to a given set of assumptions, axioms, or previously constructed proofs. Since proofs are built by means of inference rules, which manipulate formulae and symbols, proof theory is syntactic in nature, making proof systems well-suited for logical reasoning in a computational environment. As such, proof theory has proven to be an effective tool in automated reasoning, allowing for the design of complexity-optimal decision procedures providing verifiable witnesses for (un)satisfiable logical statements. On the theoretical side, techniques in proof theory can be used to establish the consistency, decidability, or interpolability of logics, among other significant properties. <br></br></br>Common questions that arise in the domain of proof theory are: What constitutes a mathematical proof? How can proof systems be constructed so that they are suitable in automated reasoning? What are the relationships between proofs in differing formalisms? How does one construct a proof system for a logic whereby all proofs are analytic (i.e. all information used in the proof is contained in the conclusion of the proof)?of is contained in the conclusion of the proof)?)
- Cyclic Proof Theory + (Proofs are a central tool in mathematics a … Proofs are a central tool in mathematics and a core concept in the study of formal reasoning. Traditionally, a proof is conceived as a finite object which is used to certify the correctness of our mathematical structures and their properties. Less common are so called cyclic proofs which, although infinitary, exhibit periodic patterns. Cyclic proof systems have proven to be a remarkably useful alternative in the mathematical study of computational systems, particularly in connection with algorithms, databases and programs. In this talk we will introduce cyclic proofs and study the extent to which these classes of proofs lend themselves to traditional proof theoretic techniques.to traditional proof theoretic techniques.)
- On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic + (Propositional dynamic logic (PDL) is an im … Propositional dynamic logic (PDL) is an important modal logic used to specify and reason about the behavior of programs. A challenging problem in the context of PDL is solving fixed-point equations, i.e., formulae of the form x ≡ ϕ(x) such that x is a propositional variable and ϕ(x) is a formula containing x. A solution to such an equation is a formula ψ that omits x and satisfies ψ ≡ ϕ(ψ), where ϕ(ψ) is obtained by replacing all occurrences of x with ψ in ϕ(x). In this short talk, we discuss PDL, fixed-point equations, and identify a class of PDL formulae arranged into two dual hierarchies for which every fixed-point equation x ≡ ϕ(x) has a solution.ed-point equation x ≡ ϕ(x) has a solution.)
- Präprozessortechniken für Pseudo-Boolean-Constraints + (Pseudo-Boolean (PB) Constraints bilden die … Pseudo-Boolean (PB) Constraints bilden die Grundlage für viele Formale Problembeschreibungen. Dabei wird die gewichtete Summe von Literalen durch eine Konstante eingeschränkt.</br></br>In dieser Belegarbeit soll die Möglichkeit untersucht werden, PB Constraints durch Präprozessortechniken zu vereinfachen, mit dem Ziel, dass die entstanden Constraints schneller von einem SAT-basierten Solver gelöst werden können als ohne Präprozessortechniken.den können als ohne Präprozessortechniken.)
- From Classical to Consistent Query Answering under Existential Rules + (Querying inconsistent ontologies is an int … Querying inconsistent ontologies is an intriguing new problem that gave rise to a flourishing research activity in the description logic (DL) community. The computational complexity of consistent query answering under the main DLs is rather well understood; however, little is known about existential rules. The goal of this talk is to perform an in-depth analysis of the complexity of consistent query answering under the main decidable classes of existential rules enriched with negative constraints. Our investigation focuses on the standard inconsistency-tolerant semantics, namely, the AR semantics. We establish generic complexity results, which demonstrate the tight connection between classical and consistent query answering. These results allow us to obtain in a uniform way a relatively complete picture of the complexity of our problem.</br></br></br>This is join work with Thomas Lukasiewicz, Maria Vanina Martinez, and Gerardo I. Simariria Vanina Martinez, and Gerardo I. Simari)
- The Curse of Finiteness: Undecidability of Database-Inspired Reasoning Problems in Very Expressive Description Logics + (Recently, the field of knowledge represent … Recently, the field of knowledge representation is drawing a lot of inspiration from database theory. In particular, in the area of description logics and ontology languages, interest has shifted from satisfiability checking to query answering, with various query notions adopted from databases, like (unions of) conjunctive queries or different kinds of path queries. Likewise, the finite model semantics is being established as a viable and interesting alternative to the traditional semantics based on unrestricted models. In this paper, we investigate diverse database-inspired reasoning problems for very expressive description logics (all featuring the worrisome trias of inverses, counting, and nominals) which have in common that role paths of unbounded length can be described (in the knowledge base or of the query), leading to a certain non-locality of the reasoning problem. We show that for all the cases considered, undecidability can be established by very similar means. Most notably, we show undecidability of finite entailment of unions of conjunctive queries for a fragment of SHOIQ (the logic underlying the OWL DL ontology language), and undecidability of finite entailment of conjunctive queries for a fragment of SROIQ (the logical basis of the more recent and popular OWL 2 DL standard).ore recent and popular OWL 2 DL standard).)