{"query":{"result":{"printrequests":[{"label":"","key":"","redi":"","typeid":"_wpg","mode":2,"format":false},{"label":"Start","key":"Start","redi":"","typeid":"_dat","mode":1,"format":""},{"label":"Ende","key":"Ende","redi":"","typeid":"_dat","mode":1,"format":""},{"label":"title","key":"Titel_EN","redi":"","typeid":"_txt","mode":1,"format":""},{"label":"Room","key":"Raum","redi":"","typeid":"_wpg","mode":1,"format":""},{"label":"Type","key":"Veranstaltungsart","redi":"","typeid":"_txt","mode":1,"format":""},{"label":"Speaker","key":"Vortragender","redi":"","typeid":"_txt","mode":1,"format":""},{"label":"Details","key":"Beschreibung_EN","redi":"","typeid":"_txt","mode":1,"format":""}],"results":{"\"Most of\" leads to undecidability: Failure of adding frequencies to LTL.":{"printouts":{"Start":[{"timestamp":"1616677200","raw":"1\/2021\/3\/25\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1616682600","raw":"1\/2021\/3\/25\/14\/30\/0\/0"}],"title":["\"Most of\" leads to undecidability: Failure of adding frequencies to LTL"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["(joint work with Jakub Michaliszyn from University of Wroc\u0142aw)\n\nLinear Temporal Logic (LTL) interpreted on finite traces is a robust specification framework popular in formal verification. However, despite the high interest in the logic in recent years, the topic of their quantitative extensions is not yet fully explored. The main goal of this work is to study the effect of adding weak forms of percentage constraints (e.g. that most of the positions in the past satisfy a given condition, or that sigma is the most-frequent letter occurring in the past) to fragments of LTL. Such extensions could potentially be used for the verification of influence networks or statistical reasoning. Unfortunately, as we prove in the paper, it turns out that percentage extensions of even tiny fragments of LTL have undecidable satisfiability and model-checking problems. Our undecidability proofs not only sharpen most of the undecidability results on logics with arithmetics interpreted on words known from the literature, but also are fairly simple. We also show that the undecidability can be avoided by restricting the allowed usage of the negation, and briefly discuss how the undecidability results transfer to first-order logic on words.\n\nThe talk will take approximately 30 minutes and will be held online via BigBlueButton. To access the room, take one of the following links: \n\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=67110&p=dbb695ef\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=67110&p=cf01a562"]},"fulltext":"\"Most of\" leads to undecidability: Failure of adding frequencies to LTL.","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/%22Most_of%22_leads_to_undecidability:_Failure_of_adding_frequencies_to_LTL.","namespace":0,"exists":"1","displaytitle":"\"Most of\" leads to undecidability: Failure of adding frequencies to LTL"},"11th European Conference on Logics in Artificial Intelligence (JELIA-2008)":{"printouts":{"Start":[{"timestamp":"1222617600","raw":"1\/2008\/9\/28\/16\/0\/0\/0"}],"Ende":[{"timestamp":"1222874100","raw":"1\/2008\/10\/1\/15\/15\/0\/0"}],"title":["11th European Conference on Logics in Artificial Intelligence (JELIA-2008)"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["Logics have, for many years, laid claim to providing a formal basis for the study and development of applications and systems in Artificial Intelligence. With the depth and maturity of formalisms, methodologies and logic-based systems today, this claim is stronger than ever.\n\nThe European Conference on Logics in Artificial Intelligence (or Journ\u00e9es Europ\u00e9ennes sur la Logique en Intelligence Artificielle - JELIA) began back in 1988, as a workshop, in response to the need for a European forum for the discussion of emerging work in this field. Since then, JELIA has been organised biennially, with English as official language, and with proceedings published in Springer-Verlag's Lecture Notes in Artificial Intelligence. Previous meetings took place in Roscoff, France (1988), Amsterdam, Netherlands (1990), Berlin, Germany (1992), York, UK (1994), \u00c9vora, Portugal (1996), Dagstuhl, Germany (1998), M\u00e1laga, Spain (2000), Cosenza, Italy (2002), Lisbon, Portugal (2004), and Liverpool, UK (2006).\n\nThe increasing interest in this forum, its international level with growing participation from researchers outside Europe, and the overall technical quality, has turned JELIA into a major biennial forum for the discussion of logic-based approaches to artificial intelligence."]},"fulltext":"11th European Conference on Logics in Artificial Intelligence (JELIA-2008)","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/11th_European_Conference_on_Logics_in_Artificial_Intelligence_(JELIA-2008)","namespace":0,"exists":"1","displaytitle":"11th European Conference on Logics in Artificial Intelligence (JELIA-2008)"},"12th EMCL Workshop":{"printouts":{"Start":[{"timestamp":"1519117200","raw":"1\/2018\/2\/20\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1519232400","raw":"1\/2018\/2\/21\/17\/0\/0\/0"}],"title":["12th EMCL Workshop"],"Room":[],"Type":["sonstige Veranstaltung"],"Speaker":[],"Details":["On the 20th and 21th February, the 12th EMCL student workshop takes place in Dresden (see http:\/\/www.pk.workshop.computational-logic.org\/).\nStudents in the European Master's Program in Computational Logic of the universities in Bozen, Dresden, Vienna, and Lisbon organize the workshop.\nThe 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."]},"fulltext":"12th EMCL Workshop","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/12th_EMCL_Workshop","namespace":0,"exists":"1","displaytitle":"12. EMCL Workshop"},"17. WLP - Workshop Logic Programming":{"printouts":{"Start":[{"timestamp":"1039597200","raw":"1\/2002\/12\/11\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1039795200","raw":"1\/2002\/12\/13\/16\/0\/0\/0"}],"title":["17. WLP - Workshop Logic Programming"],"Room":[],"Type":["Vortrag"],"Speaker":[],"Details":["Logische Programmierung ist eine besonders weitgehende Art, Probleme deklarativ zu spezifizieren. In der Form von Prolog geschieht das durch den Einsatz eines Fragments der Logik. Weitergehende Konzepte integrieren in dieses urspr\u00fcnglich rein relationale Konzept auch Funktionen und Constraints. In den vergangenen Jahren hat dieses Paradigma eine hohe Attraktivit\u00e4t erworben, u.a. in den Bereichen Datenbanken und Verarbeitung von nat\u00fcrlicher Sprache und bei der Modellierung und Bearbeitung komplexer kombinatorischer Probleme. Die Logikprogrammierung ist somit ein aktives Gebiet geblieben, das sich zunehmend auch den schwierigen Thematiken der Integration in die \u00fcbrige Softwarelandschaft, der Behandlung von Dynamik und des Umgangs mit Kommunikation stellt."]},"fulltext":"17. WLP - Workshop Logic Programming","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/17._WLP_-_Workshop_Logic_Programming","namespace":0,"exists":"1","displaytitle":"17. WLP - Workshop Logische Programmierung"},"22nd Workshop on (Constraint) Logic Programming 2008":{"printouts":{"Start":[{"timestamp":"1222768800","raw":"1\/2008\/9\/30\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1222884000","raw":"1\/2008\/10\/1\/18\/0\/0\/0"}],"title":["22nd Workshop on (Constraint) Logic Programming 2008"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["The workshops on (constraint) logic programming are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases and artificial intelligence. Previous workshops have been held in Germany, Austria and Switzerland. The technical program of the workshop will include invited talks, presentations of refereed papers and demo presentations."]},"fulltext":"22nd Workshop on (Constraint) Logic Programming 2008","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/22nd_Workshop_on_(Constraint)_Logic_Programming_2008","namespace":0,"exists":"1","displaytitle":"22nd Workshop on (Constraint) Logic Programming 2008"},"29th Workshop on (Constraint) Logic Programming (WLP 2015)":{"printouts":{"Start":[{"timestamp":"1442822400","raw":"1\/2015\/9\/21\/8\/0\/0\/0"}],"Ende":[{"timestamp":"1442944800","raw":"1\/2015\/9\/22\/18\/0\/0\/0"}],"title":["29th Workshop on (Constraint) Logic Programming (WLP 2015)"],"Room":[{"fulltext":"Faculty of Computer Science","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Faculty_of_Computer_Science","namespace":0,"exists":"","displaytitle":""}],"Type":["Konferenz"],"Speaker":[],"Details":["The Workshops on (Constraint) Logic Programming are the annual meeting of the German Society of Logic Programming Gesellschaft f\u00fcr Logische Programmierung e.V. (GLP) and brings together researchers interested in logic programming, constraint programming, answer set programming, and related areas like databases and artificial intelligence (not only from Germany).\n\n\nThe workshops provide a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation, and facilitate interactions between research in theoretical foundations and in the design and implementation of logic-based programming systems.\n\nThe technical program of the workshop will include invited talks, presentations of refereed papers, and system demonstrations."]},"fulltext":"29th Workshop on (Constraint) Logic Programming (WLP 2015)","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/29th_Workshop_on_(Constraint)_Logic_Programming_(WLP_2015)","namespace":0,"exists":"1","displaytitle":"29th Workshop on (Constraint) Logic Programming (WLP 2015)"},"38th German Conference on Artificial Intelligence":{"printouts":{"Start":[{"timestamp":"1442822400","raw":"1\/2015\/9\/21\/8\/0\/0\/0"}],"Ende":[{"timestamp":"1443204000","raw":"1\/2015\/9\/25\/18\/0\/0\/0"}],"title":["38th German Conference on Artificial Intelligence"],"Room":[{"fulltext":"Faculty of Computer Science","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Faculty_of_Computer_Science","namespace":0,"exists":"","displaytitle":""}],"Type":["Konferenz"],"Speaker":[],"Details":["KI 2015 is the 38th edition of the German Conference on Artificial Intelligence, which traditionally brings together academic and industrial researchers from all areas of AI, providing a premier forum for exchanging news and research results on theory and applications of intelligent system technology.\n\nIn September 2015, prior to the conference, there is an international summer school on reasoning organized by the international center of computational logic."]},"fulltext":"38th German Conference on Artificial Intelligence","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/38th_German_Conference_on_Artificial_Intelligence","namespace":0,"exists":"1","displaytitle":"38th German Conference on Artificial Intelligence"},"9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA)":{"printouts":{"Start":[{"timestamp":"1222678800","raw":"1\/2008\/9\/29\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1222779600","raw":"1\/2008\/9\/30\/13\/0\/0\/0"}],"title":["9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA)"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["Multi-Agent Systems are communities of problem-solving entities that can perceive and act upon their environment in order to achieve both their individual goals and their joint goals. The work on such systems integrates many technologies and concepts from artificial intelligence and other areas of computing as well as other disciplines. Over recent years, the agent paradigm gained popularity, due to its applicability to a full spectrum of domains, such as search engines, recommendation systems, educational support, e-procurement, simulation and routing, electronic commerce and trade, etc. Computational logic provides a well-defined, general, and rigorous framework for studying the syntax, semantics and procedures for the various tasks in individual agents, as well as the interaction between, and integration amongst, agents in multi-agent systems. It also provides tools, techniques and standards for implementations and environments, for linking specifications to implementations, and for the verification of properties of individual agents, multi-agent systems and their implementations."]},"fulltext":"9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA)","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/9th_International_Workshop_on_Computational_Logic_in_Multi-Agent_Systems_(CLIMA)","namespace":0,"exists":"1","displaytitle":"9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA)"},"A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic":{"printouts":{"Start":[{"timestamp":"1648724400","raw":"1\/2022\/3\/31\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1648728000","raw":"1\/2022\/3\/31\/12\/0\/0\/0"}],"title":["A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Martin Bromberger"],"Details":["In a previous paper [1], we have shown that clause sets belonging to the Horn Bernays-Sch\u00f6nfinkel fragment over simple linear arithmetic (HBS(SLA)) can be translated into HBS clause sets over a finite set of first-order constants.\nHBS clause sets are also called Datalog programs and HBS(SLA) can be seen as an extension of Datalog programs that allow simple arithmetic inequalities in the bodies of rules. The translation from HBS(SLA) to HBS preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. As a result, we were able to verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine.\n\nIn this talk, we present several new improvements to our Datalog hammer: we have generalized it to mixed real-integer arithmetic and finite first-order sorts; we extended the class of acceptable inequalities beyond variable bounds and positively grounded inequalities, and we significantly reduced the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real-world benchmark examples.\n\nReferences:\n[1] Bromberger, M., Dragoste, I., Faqeh, R., Fetzer, C., Kr\u00f6tzsch, M., Weidenbach, C.: A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic. In: Reger, G.,Konev, B. (eds.) Frontiers of Combining Systems - 13th International Symposium, FroCoS 2021, Birmingham, United Kingdom, September 8-10, 2021. Proceedings. Lecture Notes in Computer Science, vol. 12941, pp. 3\u201324. Springer (2021)\n\nOnline talk link: \nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_Datalog_hammer_for_supervisor_verification_conditions_modulo_simple_linear_arithmetic","namespace":0,"exists":"1","displaytitle":"A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic"},"A Dichotomy for Evaluating Simple Regular Path Queries":{"printouts":{"Start":[{"timestamp":"1530795600","raw":"1\/2018\/7\/5\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1530801000","raw":"1\/2018\/7\/5\/14\/30\/0\/0"}],"title":["A Dichotomy for Evaluating Simple Regular Path Queries"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Wim Martens"],"Details":["Regular path queries (RPQs) are a central component of graph databases. We investigate decision- and enumeration problems concerning the evaluation of RPQs under several semantics that have recently been considered: arbitrary paths, shortest paths, and simple paths.\nWhereas arbitrary and shortest paths can be enumerated in polynomial delay, the situation is much more intricate for simple paths. For instance, already the question if a given graph contains a simple path of a certain length has cases with highly non-trivial solutions and cases that are long-standing open problems. We study RPQ evaluation for simple paths from a parameterized complexity perspective and define a class of simple transitive expressions that is prominent in practice and for which we can prove a dichotomy for the evaluation problem. We observe that, even though simple path semantics is intractable for RPQs in general, it is feasible for the vast majority of RPQs that are used in practice. At the heart of our study on simple paths is a result of independent interest: the two disjoint paths problem in directed graphs is W[1]-hard if parameterized by the length of one of the two paths.\n\n'''Bio:''' Wim Martens is a professor for Theoretical Computer Science at the University of Bayreuth. He is interested in theoretical aspects of data management, formal language theory, logic, and complexity. He was an invited speaker at STOC 2017 and his research received several awards, including the ACM SIGMOD research highlight award and the Dissertation Award for Computer Science, Belgium. Currently, he is on the editorial board of ACM TODS and he is chairing the ICDT Council. His talk reports about research for which he recently received the Best Paper Award of the International Conference on Database Theory 2018."]},"fulltext":"A Dichotomy for Evaluating Simple Regular Path Queries","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_Dichotomy_for_Evaluating_Simple_Regular_Path_Queries","namespace":0,"exists":"1","displaytitle":"A Dichotomy for Evaluating Simple Regular Path Queries"},"A Distributed Blockchain Model of Selfish Mining":{"printouts":{"Start":[{"timestamp":"1582720200","raw":"1\/2020\/2\/26\/12\/30\/0\/0"}],"Ende":[{"timestamp":"1582725600","raw":"1\/2020\/2\/26\/14\/0\/0\/0"}],"title":["A Distributed Blockchain Model of Selfish Mining"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Ansgar Fehnker"],"Details":["Abstract:\n\tBitcoin is currently still the most widely used cryptocurrency, judging from its market cap and trade volume. A big part of Bitcoin's appeal is the mining process, which makes sure that new transactions are being validated and processed in a distributed fashion, maintaining a distributed ledger known as the blockchain. Miners receive a fee for every block of transactions that they mine, as an incentive for their computational effort. In the long run, they can expect a reward proportional to the computational power they provide to the network.\nHowever, Eyal and Sirer introduced a strategy for a miner to time the publishing of blocks that will give them a significant edge in profits. \nThis talk will present a model for the behaviour of honest and selfish mining pools in UPPAAL, that can be used for analysing properties of the mining process in the presence of network delay, and taking into account the distributed nature of the process. The analysis shows what effects selfish mining would have on the share of profits, but also on the number of orphaned blocks in the blockchain. This analysis also allows us to compares those results to real-world data, to establish if there is evidence for the presence of selfish miners.\n\nBio:\n\tAnsgar Fehnker is Associate Professor for Programming Education at the Faculty of Electrical Engineeering, Mathematics, and Computer Science, at the University of Twente. He is part of the Formal Methods and Tools group and has been previously professor at the University of the South Pacific and researcher at Australia's ICT research centre NICTA, working on static analysis for C\/C++ and on analysis of wireless network protocols with model checking. Prior to joining NICTA he was a PostDoc in the model-checking teams at Carnegie Mellon University, US. He received his PhD from the Radboud University Nijmegen on verification of real-time and hybrid systems."]},"fulltext":"A Distributed Blockchain Model of Selfish Mining","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_Distributed_Blockchain_Model_of_Selfish_Mining","namespace":0,"exists":"1","displaytitle":"A Distributed Blockchain Model of Selfish Mining"},"A Glimpse into Propositional Model Counting":{"printouts":{"Start":[{"timestamp":"1657191600","raw":"1\/2022\/7\/7\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1657195200","raw":"1\/2022\/7\/7\/12\/0\/0\/0"}],"title":["A Glimpse into Propositional Model Counting"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Johannes K. Fichte"],"Details":["Model counting (#SAT) asks to compute the number of satisfying assignments for a propositional formula. The decision version (SAT) received widespread interest in computational complexity, formed many applications in modern combinatorial problem solving, and can be solved effectively for millions of variables on structured instances. #SAT is much harder than SAT and requires more elaborate solving techniques. In this talk, we revisit the problem, its complexity, and explain its connection to quantitative AI. We briefly overview solving techniques and illustrate a parameterized algorithm and implementation to tackle the problem. While purely parameterized approaches from theory often suffer practical limitations, we elaborate that a parameterized algorithm can be successful when combining it with modern hardware that takes advantage of parallelism."]},"fulltext":"A Glimpse into Propositional Model Counting","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_Glimpse_into_Propositional_Model_Counting","namespace":0,"exists":"1","displaytitle":"A Glimpse into Propositional Model Counting"},"A Logic-based Reasoning Framework for Graph Databases":{"printouts":{"Start":[{"timestamp":"1705575600","raw":"1\/2024\/1\/18\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1705579200","raw":"1\/2024\/1\/18\/12\/0\/0\/0"}],"title":["A Logic-based Reasoning Framework for Graph Databases"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Davide Di Pierro"],"Details":["In many scientific and industrial applications, graph databases are gaining momentum thanks to the competitive performance they offer and their flexibility, not to mention their interpretability. Still, their uses remain somehow limited due to their lack of consistency-checking strategies. Here, I introduce a scheme-based access to data in order to assert constraints and keep consistency, while also opening possibilities for reasoning in logic-based approaches, in a multi-strategy setting. The possible uses and capabilities are still under investigation, but the potentialities in almost every domain seem to be promising.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"A Logic-based Reasoning Framework for Graph Databases","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_Logic-based_Reasoning_Framework_for_Graph_Databases","namespace":0,"exists":"1","displaytitle":"A Logic-based Reasoning Framework for Graph Databases"},"A Pitch Rich with Width-Witchcraft \u2013 Model-Theoretic Criteria for Decidable Query Entailment":{"printouts":{"Start":[{"timestamp":"1681988400","raw":"1\/2023\/4\/20\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1681992000","raw":"1\/2023\/4\/20\/12\/0\/0\/0"}],"title":["A Pitch Rich with Width-Witchcraft \u2013 Model-Theoretic Criteria for Decidable Query Entailment"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Sebastian Rudolph"],"Details":["Abstract: Decidability of inferencing is commonly considered a very important property of logic-based knowledge representation formalisms, required for the algorithmization and automation of reasoning. Yet, oftentimes, the corresponding (un)decidability arguments are idiosyncratic and do not shed much light on the underlying principles governing the divide.\nIn my talk, I will review generic model-theoretic criteria for decidability of querying in fragments of first-order logic. I will describe a general framework by means of which decidability of query entailment can be established based on the existence of countermodels with certain structural properties. These properties depend on the ontology and query language used and range from finite domain over forest-like shape to width-finiteness employing width notions like treewidth and cliquewidth.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"A Pitch Rich with Width-Witchcraft \u2013 Model-Theoretic Criteria for Decidable Query Entailment","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_Pitch_Rich_with_Width-Witchcraft_%E2%80%93_Model-Theoretic_Criteria_for_Decidable_Query_Entailment","namespace":0,"exists":"1","displaytitle":"A Pitch Rich with Width-Witchcraft \u2013 Model-Theoretic Criteria for Decidable Query Entailment"},"A SHACL primer for KR researchers":{"printouts":{"Start":[{"timestamp":"1719313200","raw":"1\/2024\/6\/25\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1719316800","raw":"1\/2024\/6\/25\/12\/0\/0\/0"}],"title":["A SHACL primer for KR researchers"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Magdalena Ortiz"],"Details":["The Shapes Constraint Language (SHACL) was recommended by the W3C in 2017 for describing constraints on RDF graphs and validating them. As it turns out, SHACL is closely related to Description Logics and to monadic Datalog, both familiar KR languages. Building on these connections, we introduce SHACL and its main reasoning problems in familiar KR terms. We discuss in particular the different approaches to the semantics of recursive SHACL, and the complexity of validation in some important fragments. Then we will recap some recent and ongoing research work on SHACL, and point to some of the many interesting open challenges, shedding light on how ideas and techniques from familiar KR areas can help develop SHACL further."]},"fulltext":"A SHACL primer for KR researchers","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_SHACL_primer_for_KR_researchers","namespace":0,"exists":"1","displaytitle":"A SHACL primer for KR researchers"},"A Semantic Characterization of Belief Base Revision for Arbitrary Monotonic Logics":{"printouts":{"Start":[{"timestamp":"1619096400","raw":"1\/2021\/4\/22\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1619101800","raw":"1\/2021\/4\/22\/14\/30\/0\/0"}],"title":["A Semantic Characterization of Belief Base Revision for Arbitrary Monotonic Logics"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Faiq Miftakhul Falakh"],"Details":["The AGM postulates by Alchourron, G\u00e4rdenfors, and Makinson continue to represent a cornerstone in research related to belief change. We generalize the approach of Katsuno and Mendelzon (KM) for characterizing AGM base revision from propositional logic to the setting of (multiple) base revision in arbitrary monotonic logics. Our core result is a representation theorem using the assignment of total \u2013 yet not transitive \u2013 \u201cpreference\u201d relations to belief bases. We also provide a characterization of all logics for which our result can be strengthened to preorder assignments (as in KM\u2019s original work).\n\n\nThis talk will take place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login: \n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=103268&p=3fab0d1a\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=103268&p=c61bdf2f"]},"fulltext":"A Semantic Characterization of Belief Base Revision for Arbitrary Monotonic Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_Semantic_Characterization_of_Belief_Base_Revision_for_Arbitrary_Monotonic_Logics","namespace":0,"exists":"1","displaytitle":"A Semantic Characterization of Belief Base Revision for Arbitrary Monotonic Logics"},"A Single Approach to Decide Chase Termination on Linear Existential Rules":{"printouts":{"Start":[{"timestamp":"1533819600","raw":"1\/2018\/8\/9\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1533825000","raw":"1\/2018\/8\/9\/14\/30\/0\/0"}],"title":["A Single Approach to Decide Chase Termination on Linear Existential Rules"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Micha\u00ebl Thomazo"],"Details":["Abstract:<\/b> Existential rules are a knowledge representation and reasoning formalism that extends both positive rules a la Datalog and most description logics used in ontology-based query answering. The chase is a fundamental tool for reasoning on knowledge bases composed of an instance and a set of existential rules. It is well-known that deciding, given a chase variant and a set of existential rules, whether the chase will halt for any instance is an undecidable problem. Hence, a crucial issue is whether it becomes decidable for known classes of existential rules. We focus on three main chase variants, namely semi-oblivious, restricted and core chase, and consider linear existential rules, a simple yet important subclass of existential rules. We show that the termination problem is decidable in these three variants with a novel unified approach based on a single graph and a single notion of forbidden pattern.\n\nJoint work with M. Lecl\u00e8re, M.-L. Mugnier and F. Ulliana.\n\nSpeaker Bio:<\/b> Micha\u00ebl Thomazo is an INRIA researcher (CEDAR team), currently working on ontology-based query answering, and especially efficient evaluation of reformulated queries. He had been a post-doc at TU Dresden, working with S. Rudolph, and got his Ph.D from the University of Montpellier, supervised by J.-F. Baget and M.-L. Mugnier. You can find more details at http:\/\/pages.saclay.inria.fr\/michael.thomazo\/."]},"fulltext":"A Single Approach to Decide Chase Termination on Linear Existential Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_Single_Approach_to_Decide_Chase_Termination_on_Linear_Existential_Rules","namespace":0,"exists":"1","displaytitle":"A Single Approach to Decide Chase Termination on Linear Existential Rules"},"A diamond in the rough: Theorizing column stores":{"printouts":{"Start":[{"timestamp":"1574341200","raw":"1\/2019\/11\/21\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1574346600","raw":"1\/2019\/11\/21\/14\/30\/0\/0"}],"title":["A diamond in the rough: Theorizing column stores"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Eyal Rozenberg"],"Details":["Column stores have been a 'neglected child' relative to traditional, row-oriented, relation-focused database management systems: The systems people came up with them, and the theoreticians did not really give them the time of day. This talk will discuss what happens when we pick up the slack and formalize a model for analytic computation with columns. In addition to sound conceptual grounding being its own aesthetic reward, we will touch on some of the examples of how such a formalization enables architectural and performance improvements in real-life systems:\n\n\nSeamless integration of decompression and query execution; removal of special-case handling of different column features (such as nullability and variable-length elements); closure of query execution plans to partial execution; et cetera. Central to achieving such benefits will be the discussion of what constitutes a column, how columns are to be represented, and what they can represent."]},"fulltext":"A diamond in the rough: Theorizing column stores","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_diamond_in_the_rough:_Theorizing_column_stores","namespace":0,"exists":"1","displaytitle":"A diamond in the rough: Theorizing column stores"},"Lecture on Partition Width":{"printouts":{"Start":[{"timestamp":"1568293200","raw":"1\/2019\/9\/12\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1568298600","raw":"1\/2019\/9\/12\/14\/30\/0\/0"}],"title":["A gentle introduction to partition width"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Thomas Feller"],"Details":["In this talk we will take an introductory glance at the notion of \"partition width\", first conceived by Achim Blumensath. As partition width is also closely related to a notion of decomposition of an arbitrary structure into a tree-like shape, the so called \"partition refinement\", we will also take a look at the relation of both these notions to more established notions of decomposition and width measures (namely tree-decompositions, tree width, and clique width)."]},"fulltext":"Lecture on Partition Width","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Lecture_on_Partition_Width","namespace":0,"exists":"1","displaytitle":"A gentle introduction to partition width"},"A pragmatic approach to translation: Vocabulary alignment through Multiagent Interaction and Observation":{"printouts":{"Start":[{"timestamp":"1524747600","raw":"1\/2018\/4\/26\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1524753000","raw":"1\/2018\/4\/26\/14\/30\/0\/0"}],"title":["A pragmatic approach to translation: Vocabulary alignment through Multiagent Interaction and Observation"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Paula Chocr\u00f3n"],"Details":["Talk by: Paula Chocr\u00f3n \nInstitute: Artificial Intelligence Research Institute (IIIA-CSIC), Barcelona, Spain \n\nAbstract: \n\"Every speaker that has been abroad knows that understanding a foreign language is easier when performing simple, well-defined interactions. For example, it is easier to ask for a coffee than to discuss politics in a language we do not master. In this talk I will discuss how this idea can be applied to help achieve meaningful communication in artificial multi-agent systems. In open, heterogeneous environments, it is likely that interlocutors with different backgrounds use different languages. Can the contextual information about the tasks being performed be used to learn a translation that allows agents to interact?\"\n\nI will start by presenting a notion of context that is based on the formal specifications of the tasks performed by agents. I will then show how this context can be used by agents to align their vocabularies dynamically, by learning mappings from the experience of previous interactions. In doing so, we will also rethink the traditional approach to semantic matching and its evaluation, tackling the following questions: What does it mean for agents to \"understand each other\"? When is an alignment good for a particular application? Finally, I will present an application to agents that interact using procedural protocols obtained from the WikiHow website, showing how they can infer a translation between English and Spanish without using external resources."]},"fulltext":"A pragmatic approach to translation: Vocabulary alignment through Multiagent Interaction and Observation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_pragmatic_approach_to_translation:_Vocabulary_alignment_through_Multiagent_Interaction_and_Observation","namespace":0,"exists":"1","displaytitle":"A pragmatic approach to translation: Vocabulary alignment through Multiagent Interaction and Observation"},"A proof of CSP Dichotomy conjecture":{"printouts":{"Start":[{"timestamp":"1527254100","raw":"1\/2018\/5\/25\/13\/15\/0\/0"}],"Ende":[{"timestamp":"1527259500","raw":"1\/2018\/5\/25\/14\/45\/0\/0"}],"title":["A proof of CSP Dichotomy conjecture"],"Room":[{"fulltext":"WIL\/C115, or in WIL\/C204 if more space is needed","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/WIL\/C115,_or_in_WIL\/C204_if_more_space_is_needed","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Dmitriy Zhuk (Lomonosov Moscow State University)"],"Details":["Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The main problem is to classify those subclasses that are solvable in polynomial time and those that are NP-complete. It was conjectured that if a constraint language has a weak near unanimity polymorphism then the corresponding constraint satisfaction problem is tractable, otherwise it is NP-complete. The hardness result is known since 2001. We present an algorithm that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture."]},"fulltext":"A proof of CSP Dichotomy conjecture","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A_proof_of_CSP_Dichotomy_conjecture","namespace":0,"exists":"1","displaytitle":"A proof of CSP Dichotomy conjecture"},"A.M.B.R.O.S.I.A. - Conferring Immortality on Distributed Applications":{"printouts":{"Start":[{"timestamp":"1568984400","raw":"1\/2019\/9\/20\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1568988000","raw":"1\/2019\/9\/20\/14\/0\/0\/0"}],"title":["A.M.B.R.O.S.I.A. - Conferring Immortality on Distributed Applications"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Jonathan Goldstein"],"Details":["'''Abstract:'''\n\nWhen writing today\u2019s distributed programs, which frequently span both devices and cloud services, programmers are faced with complex decisions and coding tasks around coping with failure, especially when these distributed components are stateful. If their application can be cast as pure data processing, they benefit from the past 40-50 years of work from the database community, which has shown how declarative database systems can completely isolate the developer from the possibility of failure in a performant manner. Unfortunately, while there have been some attempts at bringing similar functionality into the more general distributed programming space, a compelling general-purpose system must handle non-determinism, be performant, support a variety of machine types with varying resiliency goals, and be language agnostic, allowing distributed components written in different languages to communicate. This talk describes the first system, publicly available on GitHub, called Ambrosia, to satisfy all these requirements. We coin the term \u201cvirtual resiliency\u201d, analogous to virtual memory, for the platform feature which allows failure oblivious code to run in a failure resilient manner. We also introduce a programming construct, the \u201cimpulse\u201d, which resiliently handles non-deterministic information originating from outside the resilient component. Of further interest to our community is the effective reapplication of much database performance optimization technology to make Ambrosia more performant than many of today\u2019s non-resilient cloud solutions.\n\n\n'''Bio:'''\n\nOver the last 20 years, I have worked at Microsoft in a combination of research and product roles. In particular, I\u2019ve spent about 15 years as a researcher at MSR, doing fundamental research in streaming, big data processing, databases, and distributed computing. My style of working is to attack difficult problems, and through fundamental understanding and insight, create new artifacts that enable important problems to be solved in vastly better ways. For instance, my work on streaming data processing enabled people with real time data processing problems to specify their processing logic in new, powerful ways, and also resulted in an artifact called Trill, which was orders of magnitude more performant than anything which preceded it. Within the academic community, I have published many papers, some with best paper awards (e.g. Best Paper Award at ICDE 2012), and two with test of time awards (e.g. SIGMOD 2011 Test of Time award and ICDT 2018 Test of Time award), and have also taken many organizational roles in database conferences. My research has also had significant impact on many Microsoft products, including SQL Server, Office, Windows, Bing, and Halo, as well as leading to the creation of entirely new products like Microsoft StreamInsight, Azure Stream Analytics, Trill, and most recently, Ambrosia. I spent 5 years building Microsoft StreamInsight, serving as a founder and architect for the product. Trill has become the de-facto standard for temporal and stream data processing within Microsoft, and years after creation, is still the most expressive and performant general purpose stream data processor in the world. I am also an inventor of 30+ patents."]},"fulltext":"A.M.B.R.O.S.I.A. - Conferring Immortality on Distributed Applications","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/A.M.B.R.O.S.I.A._-_Conferring_Immortality_on_Distributed_Applications","namespace":0,"exists":"1","displaytitle":"A.M.B.R.O.S.I.A. - Conferring Immortality on Distributed Applications"},"ASNP: a tame fragment of existential second-order logic":{"printouts":{"Start":[{"timestamp":"1593090000","raw":"1\/2020\/6\/25\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1593095400","raw":"1\/2020\/6\/25\/14\/30\/0\/0"}],"title":["ASNP: a tame fragment of existential second-order logic"],"Room":[{"fulltext":"Digital","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Digital","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Manuel Bodirsky and Simon Kn\u00e4uer"],"Details":["Amalgamation SNP (ASNP) is a fragment of existential second-order logic that strictly contains binary connected MMSNP of Feder and Vardi and binary connected guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate for an expressive subclass of NP that exhibits a complexity dichotomy. We show that ASNP has a complexity dichotomy if and only if the infinite-domain dichotomy conjecture holds for constraint satisfaction problems for first-order reducts of binary finitely bounded homogeneous structures. For such CSPs, powerful universal-algebraic hardness conditions are known that are conjectured to describe the border between NP-hard and polynomial-time tractable CSPs. The connection to CSPs also implies that every ASNP sentence can be evaluated in polynomial time on classes of finite structures of bounded treewidth. We show that the syntax of ASNP is decidable. The proof relies on the fact that for classes of finite binary structures given by finitely many forbidden substructures, the amalgamation property is decidable.\n\n\nThis will be a test talk for the presentation of an eponymous paper consisting of the 20 minute long prerecorded talk (like it will be presented at the conference) which will be followed up with a Q&A session to the talk where questions will be answered by Simon Kn\u00e4uer, one of the authors. Feedback and suggestions in preperation for the conference talk are heavily encouraged.\n\nThis talk will be held digitally. If there is any interest in attending, please write an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"ASNP: a tame fragment of existential second-order logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ASNP:_a_tame_fragment_of_existential_second-order_logic","namespace":0,"exists":"1","displaytitle":"ASNP: a tame fragment of existential second-order logic"},"ASPARTIX-D Ready for the Competition":{"printouts":{"Start":[{"timestamp":"1430751000","raw":"1\/2015\/5\/4\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1430754600","raw":"1\/2015\/5\/4\/15\/50\/0\/0"}],"title":["ASPARTIX-D Ready for the Competition"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Sarah Alice Gaggl"],"Details":["ASPARTIX-D is a system designed to evaluate abstract argumentation frameworks. It consists of collection of answer-set programming (ASP) encodings together with an optimal ASP (resp. SAT) solver configuration for each reasoning problem. In this talk we will give an overview of the modifications and the evalutation performed to make ASPARTIX-D\nready for the first International Competition on Computational Models of Argumentation (ICCMA 2015)."]},"fulltext":"ASPARTIX-D Ready for the Competition","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ASPARTIX-D_Ready_for_the_Competition","namespace":0,"exists":"1","displaytitle":"ASPARTIX-D Ready for the Competition"},"ASYDE: An Argumentation-based System for classifYing Driving bEhaviors":{"printouts":{"Start":[{"timestamp":"1706785200","raw":"1\/2024\/2\/1\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1706788800","raw":"1\/2024\/2\/1\/12\/0\/0\/0"}],"title":["ASYDE: An Argumentation-based System for classifYing Driving bEhaviors"],"Room":[{"fulltext":"APB room 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Giuseppina Monterosso"],"Details":["Abstract: \nExamining the influence of human behavior on road safety is a matter of considerable interest. As\nstudies in this field have demonstrated a correlation between driver behavior and road safety over\nthe past decades, there is a compelling need to develop a software system capable of impartially\nidentifying the typical driving behavior of motorists. The objective of this research is to create one\nor more algorithms capable of recognizing and classifying a driver's typical driving behavior by\nintegrating various data sources. Since different data sources may present conflicting information\ndue to noise errors or failures, our goal is to resolve such ambiguities by employing artificial\nintelligence paradigms. We are currently exploring the potential use of a well-known AI framework,\nnamely Dung\u2019s Abstract Argumentation Framework (AAF). Argumentation Frameworks, indeed,\nprovide a valuable tool for analyzing and assessing conflicting pieces of information, enabling us to\ndraw more accurate and dependable conclusions. Our argumentation-based system provides the\nuser with a driving certificate describing their driving behavior. In the certificate, we outline, for\neach predefined class C of driving behavior (e.g., calm driving, normal driving, aggressive driving),\nthe minimum and maximum percentage of time points where the driving behavior falls in C. The\nminimum percentage represents the time points where driver behavior has been classified in C\nwithout uncertainty, whereas the maximum percentage encodes the time points where some other\nclasses in addition to C have been identified, allowing for multiple interpretations.\nThe experimental evaluation baked up the need for intervals, as for several time points ambiguity in\nidentifying classes occurred, due to different measures collected by different sensors leading to\nconflicting information. Therefore, assigning a single class is not always possible; instead, multiple\npossible interpretations need to be considered.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 2026, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"ASYDE: An Argumentation-based System for classifYing Driving bEhaviors","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ASYDE:_An_Argumentation-based_System_for_classifYing_Driving_bEhaviors","namespace":0,"exists":"1","displaytitle":"ASYDE: An Argumentation-based System for classifYing Driving bEhaviors"},"Seminar 22.07.2021":{"printouts":{"Start":[{"timestamp":"1626958800","raw":"1\/2021\/7\/22\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1626964200","raw":"1\/2021\/7\/22\/14\/30\/0\/0"}],"title":["Abstract Dialectical Frameworks. An Analysis of their Properties and Role in Knowledge Representation and Reasoning"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Hannes Stra\u00df"],"Details":["Abstract dialectical frameworks (ADFs) are a formalism for representing knowledge about abstract arguments and various logical relationships between them. This talk presents an overview of some of our results on ADFs.\n\nFirstly, we use the framework of approximation fixpoint theory to define various semantics that are known from related knowledge representation formalisms also for ADFs.\n\nWe then analyse the computational complexity of a variety of reasoning problems related to ADFs.\n\nAfterwards, we also analyse the formal expressiveness in terms of realisable sets of interpretations and show how ADFs fare in comparison to other formalisms.\n\nFinally, we show how ADFs can be put to use in instantiated argumentation, where researchers try to assign meaning to sets of defeasible and strict rules.\n\nThe main outcomes of our work show that in particular the sublanguage of *bipolar* ADFs are a useful knowledge representation formalism with meaningful representational capabilities and acceptable computational properties. \n\n\n'''Short Bio:''' The speaker is a research associate in the Computational Logic Group. He obtained his BSc in Computer Science in 2006, his (European) MSc in Computational Logic in 2008, both from TUD; his PhD about Non-monotonic Reasoning in Action Theories in 2012, his Habilitation about the topic of this talk in 2017, both from Leipzig University. Most recently, he worked at compl3te GmbH in Leipzig dealing with automated problem solving, before he joined TUD again.\n\n\nThis talk will take place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=139679&p=9e3a0a4a\n\nwithout ZIH-login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=139679&p=7cb3769c"]},"fulltext":"Seminar 22.07.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_22.07.2021","namespace":0,"exists":"1","displaytitle":"Abstract Dialectical Frameworks. An Analysis of their Properties and Role in Knowledge Representation and Reasoning"},"Abstract Domains for Database Manipulating Processes":{"printouts":{"Start":[{"timestamp":"1699527600","raw":"1\/2023\/11\/9\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1699531200","raw":"1\/2023\/11\/9\/12\/0\/0\/0"}],"title":["Abstract Domains for Database Manipulating Processes"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Stephan Mennicke"],"Details":["Database manipulating systems (DMS) formalize operations on relational databases like adding new tuples or deleting existing ones. To ensure sufficient expressiveness for capturing practical database systems, DMS operations incorporate guarding expressions first-order formulas over countable value domains. Those features impose infinite state, infinitely branching processes thus making automated reasoning about properties like the reachability of states intractable. Most recent approaches, therefore, restrict DMS to obtain decidable fragments. Nevertheless, a comprehensive semantic framework capturing full DMS, yet incorporating effective notions of data abstraction and process equivalence is an open issue. In this paper, we propose DMS process semantics based on principles of abstract interpretation. The concrete domain consists of all valid databases, whereas the abstract domain employs different constructions for unifying sets of databases being semantically equivalent up to particular fragments of the DMS guard language. The connection between abstract and concrete domains is effectively established by homomorphic mappings whose properties and restrictions depend on the expressiveness of the DMS fragment under consideration. We instantiate our framework for canonical DMS fragments and investigate semantical preservation of abstractions up to bisimilarity, being one of the strongest equivalence notions for operational process semantics.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Abstract Domains for Database Manipulating Processes","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Abstract_Domains_for_Database_Manipulating_Processes","namespace":0,"exists":"1","displaytitle":"Abstract Domains for Database Manipulating Processes"},"Adaptive Language Interaction":{"printouts":{"Start":[{"timestamp":"1525345200","raw":"1\/2018\/5\/3\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1525350600","raw":"1\/2018\/5\/3\/12\/30\/0\/0"}],"title":["Adaptive Language Interaction"],"Room":[{"fulltext":"APB 1004","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_1004","namespace":0,"exists":"1","displaytitle":"Raum APB 1004"}],"Type":["Vortrag"],"Speaker":["Prof. Dr. Vera Demberg (Saarland University, Saarland Informatics Campus, Computer Science and Computational Linguistics)"],"Details":["This talk is part of Dresden Talks on Interaction & Visualization: \n\n\nLanguage-based interaction with digital agents (e.g. Siri, Alexa) has become ubiquitous, and is used in various situations and by an increasingly large variety of different users. Research shows however that a dialog system should not just be able to understand and generate language correctly, but that it should also adapt the way it formulates its messages to fit the user and the situation (for instance, it should use simpler formulations to avoid distraction during driving).\n\nIn this talk, I will start out by presenting an information-theoretic measure, surprisal, as a way of quantifying linguistically induced cognitive load on a word-by-word basis. I will then proceed to talk about neural network models that we have recently developed to estimate semantic surprisal, i.e. the amount of cognitive load that will be caused by an unexpected word like \"bathtub\" in context, such as \"I did the dishes in the bathtub.\".\n\nFinally, I will report on our recent work using a novel pupillometry-based measure of cognitive load, the Index of Cognitive Activity (ICA), which allows us to assess cognitive load in dual task settings such as driving a car."]},"fulltext":"Adaptive Language Interaction","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Adaptive_Language_Interaction","namespace":0,"exists":"1","displaytitle":"Adaptive Language Interaction"},"Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster":{"printouts":{"Start":[{"timestamp":"1728558000","raw":"1\/2024\/10\/10\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1728561600","raw":"1\/2024\/10\/10\/12\/0\/0\/0"}],"title":["Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster"],"Room":[{"fulltext":"Https:\/\/bbb.tu-dresden.de\/rooms\/n5w-ghp-qoq-kts\/join","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Https:\/\/bbb.tu-dresden.de\/rooms\/n5w-ghp-qoq-kts\/join","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Quentin Maniere"],"Details":["We study extensions of expressive decidable fragments of first-order logic with circumscription, in particular the two-variable fragment FO2, its extension C2 with counting quantifiers, and the guarded fragment GF. We prove that if only unary predicates are minimized (or fixed) during circumscription, then decidability of logical consequence is preserved. For FO2 the complexity increases from coNExp to coNExp^NP-complete, for GF it (remarkably!) increases from 2Exp to Tower-complete, and for C2 the complexity remains open. We also consider querying circumscribed knowledge bases whose ontology is a GF sentence, showing that the problem is decidable for unions of conjunctive queries, Tower-complete in combined complexity, and Elementary in data complexity. Already for atomic queries and ontologies that are sets of guarded existential rules, however, for every k \u2265 0 there is an ontology and query that are k-Exp-hard in data complexity."]},"fulltext":"Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Adding_Circumscription_to_Decidable_Fragments_of_First-Order_Logic:_A_Complexity_Rollercoaster","namespace":0,"exists":"1","displaytitle":"Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster"},"Adding Threshold Concepts to the Description Logic EL":{"printouts":{"Start":[{"timestamp":"1462978200","raw":"1\/2016\/5\/11\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1462981800","raw":"1\/2016\/5\/11\/15\/50\/0\/0"}],"title":["Adding Threshold Concepts to the Description Logic EL"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Oliver Fern\u00e1ndez Gil"],"Details":["We introduce a family of logics extending the lightweight Description Logic EL, that allows us to define concepts in an approximate way. The main idea is to use a graded membership function m, which for each individual and concept yields a number in the interval [0,1] expressing the degree to which the individual belongs to the concept. Threshold concepts C~t for ~ in {<,<=,>,>=} then collect all the individuals that belong to C with degree ~t. We further study this framework in two particular directions. First, we define a specific graded membership function deg and investigate the complexity of reasoning in the resulting Description Logic tEL(deg) w.r.t. both the empty terminology and acyclic TBoxes. Second, we show how to use the relaxed instance query approach of Ecke et al. to turn concept similarity measures into membership degree functions. It turns out that under certain conditions such functions are well-defined, and therefore induce a wide range of threshold logics. Last, we present preliminary results on the computational complexity landscape of reasoning in such a big family of threshold logics."]},"fulltext":"Adding Threshold Concepts to the Description Logic EL","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Adding_Threshold_Concepts_to_the_Description_Logic_EL","namespace":0,"exists":"1","displaytitle":"Adding Threshold Concepts to the Description Logic EL"},"Admissibility in Probabilistic Argumentation":{"printouts":{"Start":[{"timestamp":"1636023600","raw":"1\/2021\/11\/4\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1636027200","raw":"1\/2021\/11\/4\/12\/0\/0\/0"}],"title":["Admissibility in Probabilistic Argumentation"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Nikolai K\u00e4fer"],"Details":["Abstract argumentation is a prominent reasoning framework. It comes with a variety of semantics and has lately been enhanced by probabilities to enable a quantitative treatment of argumentation. While admissibility is a fundamental notion in the classical setting, it has been merely reflected so far in the probabilistic setting. In this paper, we address the quantitative treatment of argumentation based on probabilistic notions of admissibility in a way that they form fully conservative extensions of classical notions. In particular, our building blocks are not the beliefs regarding single arguments. Instead, we start from the fairly natural idea that whatever argumentation semantics is to be considered, semantics systematically induces constraints on the joint probability distribution on the sets of arguments. In some cases there might be many such distributions, even infinitely many ones, in other cases, there may be one or none. Standard semantic notions are shown to induce such sets of constraints, and so do their probabilistic extensions. This allows them to be tackled by SMT solvers, as we demonstrate by a proof-of-concept implementation. We present a taxonomy of semantic notions, also in relation to published work, together with a running example illustrating our achievements.\n\nThis is a talk regarding the paper at KR 2021. The talk will be given online via BigBlueButton. To access the room, use the following link:\n\nRoom Link: \nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Admissibility in Probabilistic Argumentation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Admissibility_in_Probabilistic_Argumentation","namespace":0,"exists":"1","displaytitle":"Admissibility in Probabilistic Argumentation"},"Advances in Abstract Argumentation - Expressiveness and Dynamics":{"printouts":{"Start":[{"timestamp":"1501160400","raw":"1\/2017\/7\/27\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1501164000","raw":"1\/2017\/7\/27\/14\/0\/0\/0"}],"title":["Advances in Abstract Argumentation - Expressiveness and Dynamics"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Thomas Linsbichler"],"Details":["In recent years the research field of argumentation has become a major\ntopic in the study of artificial intelligence (AI). Within the\nargumentation process, the focus of this work is on the evaluation of\nthe acceptability of conflicting arguments using the formal models of\nabstract argumentation frameworks (AFs) and abstract dialectical\nframeworks (ADFs). While an AF is a directed graph where nodes\nrepresent arguments and directed edges represent conflicts between\narguments, ADFs constitute a very powerful generalization of AFs by\nadditionally assigning to each argument an acceptance condition. In\nthis work we contribute to the advancement of the study of abstract\nargumentation by addressing aspects of expressiveness and dynamics of\nargumentation semantics. In terms of expressiveness we complement\nrecent work on realizability in AFs, investigate the role of rejected\narguments, and study the induced class of compact argumentation\nframeworks. Then, we lift the study of expressiveness to the concept\nof input-output AFs. Finally, we present a unifying algorithmic\napproach to realizability capturing AFs and ADFs as well as\nintermediate formalisms in a modular way, which is also implemented in\nASP. Taking into account the dynamic nature of argumentation, we\nstudy two central issues therein: revision and splitting. For\nrevision we apply the seminal AGM theory of belief change to\nargumentation by presenting representation theorems for revision\noperators which guarantee to result in a single framework. We also\npresent concrete belief change operators and analyze their\ncomputational complexity. Finally, we study splitting of ADFs, aiming\nfor optimization of computation by incremental computation of\nsemantics."]},"fulltext":"Advances in Abstract Argumentation - Expressiveness and Dynamics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Advances_in_Abstract_Argumentation_-_Expressiveness_and_Dynamics","namespace":0,"exists":"1","displaytitle":"Advances in Abstract Argumentation - Expressiveness and Dynamics"},"Adventures in Computer Science -- Grades 1 & 2":{"printouts":{"Start":[{"timestamp":"1680174000","raw":"1\/2023\/3\/30\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1680177600","raw":"1\/2023\/3\/30\/12\/0\/0\/0"}],"title":["Adventures in Computer Science -- Grades 1 & 2"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Stephan Mennicke"],"Details":["Have you sorted you toys at home by color or by size? Have you\never looked for this one particular pencil? Have you asked yourself, why\ndid this search take so long or how can it be faster? The \"World of\nAlgorithms\" (German: Die Welt der Algorithmen) provides some useful\ntools for you to achieve your goals as quick as possible. This includes\nproblems that never crossed your minds before. We are going to look at\ncertain problems and their (algorithmic) solutions. It is our goal the\nlearn about the strategies leading to the solutions. We are also facing\nproblems that are so hard to solve for which a quick solutions is out of\nreach, even for a modern computer.\n\nThis is a translation of the advertisement I provided for pupils at the\n39th Primary School here at Dresden for a so-called \"Ganztagsangebot\"\n(GTA for short) which is basically a 1 hour\/week course\ninstitutionalized as afternoon activity. My target group has been\nchildren at the level of 1st and 2nd grade (ages 6 to 8). In this talk,\nI will briefly explain what I planned to do, what I did and what I'm\nplanning to do in this GTA. I will mainly elaborate on the experiences I\ngathered in teaching 6-8 year-olds over the course of this school year.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Adventures in Computer Science -- Grades 1 & 2","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Adventures_in_Computer_Science_--_Grades_1_%26_2","namespace":0,"exists":"1","displaytitle":"Adventures in Computer Science -- Grades 1 & 2"},"Agile Project Management - An overview on techniques and the agile mindset":{"printouts":{"Start":[{"timestamp":"1645095600","raw":"1\/2022\/2\/17\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1645099200","raw":"1\/2022\/2\/17\/12\/0\/0\/0"}],"title":["Agile Project Management - An overview on techniques and the agile mindset"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Stefan Ellmauthaler"],"Details":["Being agile has become a fashionable word for project management and working methods for companies in recent years.\nThis is synonymous with modern structures, effective organization, and working patterns.\nA number of concepts such as \"design thinking\", \"lean startup\" or \"scrum\" are at least known by their name.\nIn the academic community, these ideas are not applied often and sometimes look a bit overburdening.\nThe aim of this presentation is to provide an overview of the agile mindset and a general introduction to the methodologies used.\nWe will focus on the aspects which might be interesting for academic people, as not all roles and artifacts can and should be realized in a reasonable way in our current environment.\n\nFirst, we address the basic question of what agility is and why we need to be agile.\nFollowing this, we will examine the paradigms and methods used in the agile mindset.\nFinally, we will look at Scrum, which is a method for carrying out complex tasks done in small agile teams.\nThis is particularly interesting as we typically work in small teams in the academic environment.\n\nThis is a condensed overview of the experience from a two-day skill workshop on agile methods.\n\nThe talk is online, link:\n\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Agile Project Management - An overview on techniques and the agile mindset","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Agile_Project_Management_-_An_overview_on_techniques_and_the_agile_mindset","namespace":0,"exists":"1","displaytitle":"Agile Project Management - An overview on techniques and the agile mindset"},"Algebraic Aspects of Propositional Logic, and Future Work in Defeasibile Reasoning":{"printouts":{"Start":[{"timestamp":"1721300400","raw":"1\/2024\/7\/18\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1721304000","raw":"1\/2024\/7\/18\/12\/0\/0\/0"}],"title":["Algebraic Aspects of Propositional Logic, and Future Work in Defeasible Reasoning"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Nicholas Leisegang"],"Details":["This talk will consist of two parts. In the first part, I will discuss work from my masters thesis on algebraic aspects of propositional logic. In particular, I will provide a brief introduction into universal algebra, and describe how a propositional theory of logic corresponds to a variety of universal algebra in a generalized setting. Using this correspondence and certain examples, we will then characterise a notion of completeness in an algebraic setting for propositional logics.\n\nIn the second part of the talk, I will talk a little bit about the area of interest and the central questions for my PhD studies. Specifically, I will give a brief introduction to KLM style defeasibility and introduce the problems I am working on with regards to introducing KLM-style reasoning into more expressive logics."]},"fulltext":"Algebraic Aspects of Propositional Logic, and Future Work in Defeasibile Reasoning","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Algebraic_Aspects_of_Propositional_Logic,_and_Future_Work_in_Defeasibile_Reasoning","namespace":0,"exists":"1","displaytitle":"Algebraic Aspects of Propositional Logic, and Future Work in Defeasible Reasoning"},"An Algebraic Notion of Conditional Independence, and its Application to Knowledge Representation":{"printouts":{"Start":[{"timestamp":"1714042800","raw":"1\/2024\/4\/25\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1714046400","raw":"1\/2024\/4\/25\/12\/0\/0\/0"}],"title":["An Algebraic Notion of Conditional Independence, and its Application to Knowledge Representation"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Jesse Heyninck"],"Details":["Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such as propositional logic and belief revision. In this talk, I show how the notion of conditional independence can be studied in the algebraic framework of approximation fixpoint theory. This gives a language-independent account of conditional independence that can be straightforwardly applied to any logic with fixpoint semantics. It is shown how this notion allows to reduce global reasoning to parallel instances of local reasoning. Furthermore, relations to existing notions of conditional independence are discussed and the framework is applied to normal logic programming and abstract dialectical frameworks."]},"fulltext":"An Algebraic Notion of Conditional Independence, and its Application to Knowledge Representation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/An_Algebraic_Notion_of_Conditional_Independence,_and_its_Application_to_Knowledge_Representation","namespace":0,"exists":"1","displaytitle":"An Algebraic Notion of Conditional Independence, and its Application to Knowledge Representation"},"An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog":{"printouts":{"Start":[{"timestamp":"1663844400","raw":"1\/2022\/9\/22\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1663848000","raw":"1\/2022\/9\/22\/12\/0\/0\/0"}],"title":["An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Ali Elhalawati"],"Details":["Why-provenance \u2014 explaining why a query result is obtained \u2014 is an essential asset for reaching the goal of Explainable AI. For instance, recursive (Datalog) queries may show unexpected derivations due to complex entanglement of database atoms inside recursive rule applications. Provenance, and why-provenance in particular, helps debugging rule sets to eventually obtain the desired set of rules. There are three kinds of approaches to computing why-provenance for Datalog in the literature: (1) the complete ones, (2) the approximate ones, and (3) the theoretical ones. What all these approaches have in common is that they aim at computing provenance for all IDB atoms, while only a few atoms might be requested to be explained. We contribute an on-demand approach: After deriving all entailed facts of a Datalog program, we allow for querying for the provenance of particular IDB atoms and the structures involved in deriving provenance are computed only then. Our framework is based on terminating existential rules, recording the different rule applications. We present two implementations of the framework, one based on the semiring solver FPsolve, the other one based Datalog(S), a recent extension of Datalog by set terms. We perform experiments on benchmark rule sets using both implementations and discuss feasibility of provenance on-demand.\n\nThe talk is based on the upcoming conference paper in RuleML+RR 2022 with Markus Kr\u00f6tzsch and Stephan Mennicke, the paper can be found through the following link: https:\/\/iccl.inf.tu-dresden.de\/web\/Inproceedings3342\n\nThe talk will take place in a hybrid fashion, physically in the seminar room, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/An_Existential_Rule_Framework_for_Computing_Why-Provenance_On-Demand_for_Datalog","namespace":0,"exists":"1","displaytitle":"An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog"},"An Implementation of a Labelling-based Algorithm for the cf2 Argumentation Semantics":{"printouts":{"Start":[{"timestamp":"1429541400","raw":"1\/2015\/4\/20\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1429545000","raw":"1\/2015\/4\/20\/15\/50\/0\/0"}],"title":["An Implementation of a Labelling-based Algorithm for the cf2 Argumentation Semantics"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Javanshir Alammadli"],"Details":["Increasing interest in Argumentation led to several proposals for formalisms. They differ in many aspects, therefore implementation is needed for better analysis and comparison. Different implementation methods, as well as systems should be analyzed to find the most suitable one for each formalization. The purpose of this talk is to go through the steps of implementing the labelling algorithm for cf2 in Java, analyze its performance and compare to the implementation in ASPARTIX."]},"fulltext":"An Implementation of a Labelling-based Algorithm for the cf2 Argumentation Semantics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/An_Implementation_of_a_Labelling-based_Algorithm_for_the_cf2_Argumentation_Semantics","namespace":0,"exists":"1","displaytitle":"An Implementation of a Labelling-based Algorithm for the cf2 Argumentation Semantics"},"Seminar 15.04.2021":{"printouts":{"Start":[{"timestamp":"1618491600","raw":"1\/2021\/4\/15\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1618497000","raw":"1\/2021\/4\/15\/14\/30\/0\/0"}],"title":["An Introduction to Proof Theory I: Sequent Calculus"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Tim Lyon"],"Details":["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.\n\n\nThis lecture will take place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=88852&p=57980ee1\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=88852&p=7788afd1"]},"fulltext":"Seminar 15.04.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_15.04.2021","namespace":0,"exists":"1","displaytitle":"An Introduction to Proof Theory I: Sequent Calculus"},"An Introduction to Proof Theory II: More on the Sequent Calculus":{"printouts":{"Start":[{"timestamp":"1642071600","raw":"1\/2022\/1\/13\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1642075200","raw":"1\/2022\/1\/13\/12\/0\/0\/0"}],"title":["An Introduction to Proof Theory II: More on the Sequent Calculus"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Tim Lyon"],"Details":["This talk is a sequel to the first lecture \"An Introduction to Proof Theory I: Sequent Calculus,\" which can be found at the following link: https:\/\/www.youtube.com\/watch?v=grjMRgmjddE. In this talk, we will briefly review notions introduced in the first talk such as what a sequent is, types of inference rules, and types of rule redundancy. Building off these notions, we will then look at invertible rules, cut-elimination, and touch on how logics can be shown decidable via proof-search. All such concepts will be introduced within the framework of a sequent calculus for classical propositional logic. \n\nThe talk is online via BigBlueButton.\n\nLink:\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"An Introduction to Proof Theory II: More on the Sequent Calculus","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/An_Introduction_to_Proof_Theory_II:_More_on_the_Sequent_Calculus","namespace":0,"exists":"1","displaytitle":"An Introduction to Proof Theory II: More on the Sequent Calculus"},"An Introduction to Wikidata":{"printouts":{"Start":[{"timestamp":"1480517400","raw":"1\/2016\/11\/30\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1480521000","raw":"1\/2016\/11\/30\/15\/50\/0\/0"}],"title":["An Introduction to Wikidata"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Markus Kr\u00f6tzsch"],"Details":["Wikidata is Wikipedia's database sister and one of the major general knowledge bases found on the Web today. After only four years of operation, it has attracted contributions from more than 100,000 editors, amounting to more than 120 million statements about 25 million entities (state November 2016). In this talk, I will give an introduction to the project and to its contents, and discuss possible uses in research and applications."]},"fulltext":"An Introduction to Wikidata","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/An_Introduction_to_Wikidata","namespace":0,"exists":"1","displaytitle":"An Introduction to Wikidata"},"Seminar 20.05.2021":{"printouts":{"Start":[{"timestamp":"1621515600","raw":"1\/2021\/5\/20\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1621521000","raw":"1\/2021\/5\/20\/14\/30\/0\/0"}],"title":["An importance value for temporal logics"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Simon Jantsch"],"Details":["We give a brief account of the Shapley value, which is a powerful and elegant formalism aimed at distributing a surplus achieved jointly by a group of agents to the individual members.\nIt was first studied in theoretical economics, but has since influenced many domains.\nUsing this concept, we derive a notion of importance of states in a system with respect to satisfying a given temporal logic specification.\nThe aim is to measure how much the nondeterministic choices of a state influence the capacity of the system as a whole to satisfy the specification.\nWe will mainly consider linear temporal logic, for which we study the exact complexity of determining the importance value.\nFinally, we discuss how the formalism can be applied to computation tree logic and what additional challenges that brings.\n\n\nThis talk will have a duration of approximately 30 minutes and takes place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=115787&p=a346519e\n\nwithout ZIH-login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=115787&p=c9c0523a"]},"fulltext":"Seminar 20.05.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_20.05.2021","namespace":0,"exists":"1","displaytitle":"An importance value for temporal logics"},"Seminar 07.10.2021":{"printouts":{"Start":[{"timestamp":"1633611600","raw":"1\/2021\/10\/7\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1633617000","raw":"1\/2021\/10\/7\/14\/30\/0\/0"}],"title":["An overview of Datalog boundedness"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Christian Lewe"],"Details":["Datalog boundedness is the property of a Datalog rule set that its recursion depth is independent of the database during query answering. This property is known to be undecidable and has been extensively studied. We give an overview of different perspectives on boundedness and relate boundedness to first-order rewritability. To build a strong intuition for the nature of boundnedness, we define a new fragment of bounded Datalog rule sets and show its place amidst other bounded fragments.\n\n\nThis is a project defence and will be given online via BigBlueButton. To access the room, use one of the following links:\n\nwith ZIH-login: \n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=147898&p=494d5a1d\n\nwithout ZIH-login (i.e. external participants):\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=147898&p=2f89586e"]},"fulltext":"Seminar 07.10.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_07.10.2021","namespace":0,"exists":"1","displaytitle":"An overview of Datalog boundedness"},"Answer Set Navigation alongside Quantitative Reasoning":{"printouts":{"Start":[{"timestamp":"1707994800","raw":"1\/2024\/2\/15\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1707998400","raw":"1\/2024\/2\/15\/12\/0\/0\/0"}],"title":["Answer Set Navigation alongside Quantitative Reasoning"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Dominik Rusovac"],"Details":["Abstract: This is a so called status talk of PhD student Dominik Rusovac, supervised by Sarah Alice Gaggl. The main goal of the thesis is to study the concept of answer set navigation. Essentially, aiming at a systematic framework that consists of efficient and from the ground up characterised methods to deal with a large amount of answer sets (solutions) of a logic program (problem).\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Answer Set Navigation alongside Quantitative Reasoning","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Answer_Set_Navigation_alongside_Quantitative_Reasoning","namespace":0,"exists":"1","displaytitle":"Answer Set Navigation alongside Quantitative Reasoning"},"Answering Queries with Negation over Existential Rules":{"printouts":{"Start":[{"timestamp":"1641466800","raw":"1\/2022\/1\/6\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1641470400","raw":"1\/2022\/1\/6\/12\/0\/0\/0"}],"title":["Answering Queries with Negation over Existential Rules"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Stephan Mennicke"],"Details":["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.\n\nThe talk is about an upcoming publication in AAAI 2022 by Stefan Ellmauthaler, Markus Kr\u00f6tzsch, Stephan Mennicke\n\nThe talk is online,\nLink: https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Answering Queries with Negation over Existential Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Answering_Queries_with_Negation_over_Existential_Rules","namespace":0,"exists":"1","displaytitle":"Answering Queries with Negation over Existential Rules"},"Answering Temporal Conjunctive Queries over DL Ontologies":{"printouts":{"Start":[{"timestamp":"1431960600","raw":"1\/2015\/5\/18\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1431964200","raw":"1\/2015\/5\/18\/15\/50\/0\/0"}],"title":["Answering Temporal Conjunctive Queries over DL Ontologies"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Stefan Borgwardt"],"Details":["Temporal Conjunctive Queries (TCQs) have been proposed as a formalism to access data that is collected by sensors at regular intervals. They allow to combine conjunctive queries using the operators of propositional linear-temporal logic (LTL). Recently, the complexity of TCQ entailment has been established in the presence of additional background knowledge formalized by an EL or SHQ ontology. This talk presents the main techniques used to obtain the complexity upper bounds and discusses ongoing work on TCQs over other DLs."]},"fulltext":"Answering Temporal Conjunctive Queries over DL Ontologies","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Answering_Temporal_Conjunctive_Queries_over_DL_Ontologies","namespace":0,"exists":"1","displaytitle":"Answering Temporal Conjunctive Queries over DL Ontologies"},"Approximation Fixpoint Theory \u2013 A Unifying Framework for Non-monotonic Semantics":{"printouts":{"Start":[{"timestamp":"1643886000","raw":"1\/2022\/2\/3\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1643889600","raw":"1\/2022\/2\/3\/12\/0\/0\/0"}],"title":["Approximation Fixpoint Theory \u2013 A Unifying Framework for Non-monotonic Semantics"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Hannes Stra\u00df"],"Details":["Motivated by structural similarities in the semantics of Reiter's\ndefault logic and the stable model semantics of logic programming (among\nothers), Denecker, Marek, and Truszczy\u0144ski set out to isolate these\nsimilarities in a purely algebraic setting. The result is now known as\napproximation fixpoint theory, and allows to study the semantics of the\nmajor non-monotonic knowledge representation formalisms in an abstract,\nuniform framework.\nAfter briefly recalling some lattice theory, we will present the main\nconcepts of approximation fixpoint theory, applying it to the case of\nlogic programming as a running example."]},"fulltext":"Approximation Fixpoint Theory \u2013 A Unifying Framework for Non-monotonic Semantics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Approximation_Fixpoint_Theory_%E2%80%93_A_Unifying_Framework_for_Non-monotonic_Semantics","namespace":0,"exists":"1","displaytitle":"Approximation Fixpoint Theory \u2013 A Unifying Framework for Non-monotonic Semantics"},"Approximation Fixpoint Theory \u2013 A Unifying Framework for Non-monotonic Semantics Part 2":{"printouts":{"Start":[{"timestamp":"1644490800","raw":"1\/2022\/2\/10\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1644494400","raw":"1\/2022\/2\/10\/12\/0\/0\/0"}],"title":["Approximation Fixpoint Theory \u2013 A Unifying Framework for Non-monotonic Semantics Part 2"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Hannes Stra\u00df"],"Details":["Motivated by structural similarities in the semantics of Reiter's\ndefault logic and the stable model semantics of logic programming (among others), Denecker, Marek, and Truszczy\u0144ski set out to isolate these similarities in a purely algebraic setting. The result is now known as approximation fixpoint theory, and allows to study the semantics of the major non-monotonic knowledge representation formalisms in an abstract, uniform framework. After briefly recalling some lattice theory, we will present the main concepts of approximation fixpoint theory, applying it to the case of\n\nlogic programming as a running example.\n\nThis is the second part of the talk,\n\nLink: https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Approximation Fixpoint Theory \u2013 A Unifying Framework for Non-monotonic Semantics Part 2","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Approximation_Fixpoint_Theory_%E2%80%93_A_Unifying_Framework_for_Non-monotonic_Semantics_Part_2","namespace":0,"exists":"1","displaytitle":"Approximation Fixpoint Theory \u2013 A Unifying Framework for Non-monotonic Semantics Part 2"},"Attributed Description Logics: Ontologies for Knowledge Graphs":{"printouts":{"Start":[{"timestamp":"1508404800","raw":"1\/2017\/10\/19\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1508410200","raw":"1\/2017\/10\/19\/10\/50\/0\/0"}],"title":["Attributed Description Logics: Ontologies for Knowledge Graphs"],"Room":[{"fulltext":"APB 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Ana Ozaki"],"Details":["In modelling real-world knowledge, there often arises a need to represent and reason with meta-knowledge. To equip description logics (DLs) for dealing with such ontologies, we enrich DL concepts and roles with finite sets of attribute-value pairs, called annotations, and allow concept inclusions to express constraints on annotations. We show that this may lead to increased complexity or even undecidability, and we identify cases where this increased expressivity can be achieved without incurring increased complexity of reasoning. In particular, we describe a tractable fragment based on the lightweight description logic EL, and we cover SROIQ, the DL underlying OWL 2 DL."]},"fulltext":"Attributed Description Logics: Ontologies for Knowledge Graphs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Attributed_Description_Logics:_Ontologies_for_Knowledge_Graphs","namespace":0,"exists":"1","displaytitle":"Attributed Description Logics: Ontologies for Knowledge Graphs"},"Augmenting human cognition in collaborative knowledge collections":{"printouts":{"Start":[{"timestamp":"1413543900","raw":"1\/2014\/10\/17\/11\/5\/0\/0"}],"Ende":[{"timestamp":"1413548100","raw":"1\/2014\/10\/17\/12\/15\/0\/0"}],"title":["Augmenting human cognition in collaborative knowledge collections"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Claudia M\u00fcller-Birn"],"Details":["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."]},"fulltext":"Augmenting human cognition in collaborative knowledge collections","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Augmenting_human_cognition_in_collaborative_knowledge_collections","namespace":0,"exists":"1","displaytitle":"Augmenting human cognition in collaborative knowledge collections"},"Automata, Logic, Algebra... What do they have in common?":{"printouts":{"Start":[{"timestamp":"1488452400","raw":"1\/2017\/3\/2\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1488456000","raw":"1\/2017\/3\/2\/12\/0\/0\/0"}],"title":["Automata, Logic, Algebra... What do they have in common?"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Tom\u00e1\u0161 Masopust"],"Details":["In this talk, a few language classes will be discussed including their automata, logical, and algebraic characterizations."]},"fulltext":"Automata, Logic, Algebra... What do they have in common?","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Automata,_Logic,_Algebra..._What_do_they_have_in_common%3F","namespace":0,"exists":"1","displaytitle":"Automata, Logic, Algebra... What do they have in common?"},"Automatic Extraction of Compositional Matrix-Space Models of Language":{"printouts":{"Start":[{"timestamp":"1563188400","raw":"1\/2019\/7\/15\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1563193800","raw":"1\/2019\/7\/15\/12\/30\/0\/0"}],"title":["Automatic Extraction of Compositional Matrix-Space Models of Language"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Shima Asaadi"],"Details":["Learning word representations in distributional semantic models to capture the semantics and compositionality of natural language is a central research area of computational linguistics. Compositional Matrix-Space Models (CMSMs) introduce a novel word representation alternative to Vector Space Models (VSMs). This talk presents the results of learning Compositional Matrix-Space Models to capture the semantics and compositionality in natural language processing tasks including sentiment analysis and compositionality detection of short phrases. Then, a new dataset is introduced for examining compositional distributional semantic models and present benchmark experiments on using the developed dataset as a testbed to evaluate semantic composition in distributional semantic models."]},"fulltext":"Automatic Extraction of Compositional Matrix-Space Models of Language","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Automatic_Extraction_of_Compositional_Matrix-Space_Models_of_Language","namespace":0,"exists":"1","displaytitle":"Automatic Extraction of Compositional Matrix-Space Models of Language"},"Automatic translation of clinical trial eligibility criteria into formal queries":{"printouts":{"Start":[{"timestamp":"1568638800","raw":"1\/2019\/9\/16\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1568642400","raw":"1\/2019\/9\/16\/14\/0\/0\/0"}],"title":["Automatic translation of clinical trial eligibility criteria into formal queries"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Chao Xu"],"Details":["Selecting patients for clinical trials is very labor-intensive. Our goal is to develop an automated system that can support doctors in this task. This paper describes a major step towards such a system: the automatic translation of clinical trial eligibility criteria from natural language into formal, logic-based queries. First, we develop a semantic annotation process that can capture many types of clinical trial criteria. Then, we map the annotated criteria to the formal query language. We have built a prototype system based on state-of-the-art NLP tools such as Word2Vec, Stanford NLP tools, and the MetaMap Tagger, and have evaluated the quality of the produced queries on a number of criteria from clinicaltrials.gov."]},"fulltext":"Automatic translation of clinical trial eligibility criteria into formal queries","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Automatic_translation_of_clinical_trial_eligibility_criteria_into_formal_queries","namespace":0,"exists":"1","displaytitle":"Automatic translation of clinical trial eligibility criteria into formal queries"},"Beyond NP Revolution":{"printouts":{"Start":[{"timestamp":"1554816600","raw":"1\/2019\/4\/9\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1554822000","raw":"1\/2019\/4\/9\/15\/0\/0\/0"}],"title":["Beyond NP Revolution"],"Room":[{"fulltext":"APB 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Kuldeep Meel"],"Details":["'''Abstract:''' The paradigmatic NP-complete problem of Boolean satisfiability (SAT) solving is a central problem in Computer Science. While the mention of SAT can be traced to early 19th century, efforts to develop practically successful SAT solvers go back to 1950s. The past 20 years have witnessed a \"NP revolution\" with the development of conflict-driven clause-learning (CDCL) SAT solvers. Such solvers combine a classical backtracking search with a rich set of effective heuristics. While 20 years ago SAT solvers were able to solve instances with at most a few hundred variables, modern SAT solvers solve instances with up to millions of variables in a reasonable time. The \"NP-revolution\" opens up opportunities to design practical algorithms with rigorous guarantees for problems in complexity classes beyond NP by replacing a NP oracle with a SAT Solver. In this talk, we will discuss how we use NP revolution to design practical algorithms for two fundamental problems in artificial intelligence and formal methods: Constrained Counting and Sampling.\n\n\n'''Bio:''' Kuldeep Meel is an Assistant Professor of Computer Science in School of Computing at the National University of Singapore where he holds the Sung Kah Kay Assistant Professorship. He received his Ph.D. (2017) and M.S. (2014) degree in Computer Science from Rice University. He holds B. Tech. (with Honors) degree (2012) in Computer Science and Engineering from Indian Institute of Technology, Bombay. His research interests lie at the intersection of Artificial Intelligence and Formal Methods. Meel has co-presented tutorials at top-tier AI conferences, IJCAI 2018, AAAI 2017, and UAI 2016. His work received the 2018 Ralph Budd Award for Best PhD Thesis in Engineering, 2014 Outstanding Masters Thesis Award from Vienna Center of Logic and Algorithms and Best Student Paper Award at CP 2015. He received the IBM Ph.D. Fellowship and the 2016-17 Lodieska Stockbridge Vaughn Fellowship for his work on constrained sampling and counting."]},"fulltext":"Beyond NP Revolution","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Beyond_NP_Revolution","namespace":0,"exists":"1","displaytitle":"Beyond NP Revolution"},"Big Data Variety: On-Demand Data Integration":{"printouts":{"Start":[{"timestamp":"1543243800","raw":"1\/2018\/11\/26\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1543249200","raw":"1\/2018\/11\/26\/16\/20\/0\/0"}],"title":["Big Data Variety: On-Demand Data Integration"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Oscar Romero"],"Details":["'''Abstract.''' As big data systems get more complex, the data variety challenge has become the driving factor in current big data projects. From a technical perspective, data variety mainly boils down to data integration, which, unfortunately, is far away from being a resolved problem. Current efforts highlight the need to broaden the perspective beyond the data community and use semantic-aware formalisms, such as knowledge graphs, to tackle this problem. In this talk, we will revise the current state-of-the-art of the data variety challenge and present recent solutions to manage the problem.\n\n\n'''Bio.''' I\u2019m currently a tenure-track 2 lecturer at the Departament d\u2019Enginyeria de Serveis i Sistemes d\u2019Informaci\u00f3 (ESSI), which belongs to the Universitat Polit\u00e8cnica de Catalunya (UPC-BarcelonaTech). also coordinate the IT4BI Erasmus Mundus Master at UPC and the Big Data Management and Analytics postgraduate course at UPC School. Although my hometown is Lleida, I have already lived for more than 10 years in Barcelona. On March 2004 I obtained my bachelor\u2019s degree in Informatics Engineering at Facultat d\u2019Inform\u00e0tica de Barcelona (FIB) Later, on February 2010 I obtained my doctoral degree in Computing. My PhD thesis, directed by Dr. Alberto Abell\u00f3 and entitled \u201cAutomating the Multidimensional Design of Data Warehouses\u201d, can be found here. My main topics of interest are business intelligence, Big Data and the semantic web. My PhD thesis focused on data warehousing but since then, I have been working on many other topics such as NOSQL (and any technology beyond relational databases), bridging Big Data management and analytics, open data platforms (mostly at the database level), recommendation systems and semantic-aware systems (based or exploiting semantic formalisms such as ontology languages or RDF). I am also interested in agile methodologies \/ formalisms to incorporate non-technical people in the design, maintenance and evolution of database systems."]},"fulltext":"Big Data Variety: On-Demand Data Integration","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Big_Data_Variety:_On-Demand_Data_Integration","namespace":0,"exists":"1","displaytitle":"Big Data Variety: On-Demand Data Integration"},"Blockmodelling Knowledge Graphs":{"printouts":{"Start":[{"timestamp":"1654167600","raw":"1\/2022\/6\/2\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1654171200","raw":"1\/2022\/6\/2\/12\/0\/0\/0"}],"title":["Blockmodelling Knowledge Graphs"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Marcin Pietrasik"],"Details":["In this talk, I provide an introductory overview of knowledge graphs, stochastic blockmodelling, and the area where these two domains intersect. Furthermore, I will highlight some of the work I have contributed to and am currently working on. The aim of the talk is to provide a gentle introduction to my work that can be a starting point for future discussion and collaboration.\n\nThe talk is Hybird!, with a 20 person maximum capacity in the seminar room APB 3027\nOnline link: https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Blockmodelling Knowledge Graphs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Blockmodelling_Knowledge_Graphs","namespace":0,"exists":"1","displaytitle":"Blockmodelling Knowledge Graphs"},"Body-Mind-Language: Embodied Cognition in Natural Language":{"printouts":{"Start":[{"timestamp":"1511428800","raw":"1\/2017\/11\/23\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1511434200","raw":"1\/2017\/11\/23\/10\/50\/0\/0"}],"title":["Body-Mind-Language: Embodied Cognition in Natural Language"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Dagmar Gromann"],"Details":["Embodied cognition starts from the assumption that conceptual structure in our minds derives from sensorimotor experiences. Cognitive linguistics has provided compelling evidence that semantic structure in natural language reflects that conceptual structure arising from our embodied experience in the world. Thus, natural language provides an excellent source of knowledge to study embodied cognition. To capture this cognitive conceptual structure, a set of spatio-temporal building blocks called image schemas was introduced by George Lakoff and Mark Johnson. Detecting image schemas in natural language can provide further insights into how we encode embodied experiences in our communication and potentially contribute to research on conceptual understanding and symbol grounding in cognitive systems. However, due to their abstract nature and lack of formalization they are difficult to detect in language. \n\nIn this talk, I will first briefly introduce the general idea of image schemas, which has been presented to this group before by my co-author Maria Hedblom, and then proceed to machine learning techniques to extract them from multilingual text. Furthermore, I will provide a short overview on existing approaches and our ongoing work on formalizing image schemas."]},"fulltext":"Body-Mind-Language: Embodied Cognition in Natural Language","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Body-Mind-Language:_Embodied_Cognition_in_Natural_Language","namespace":0,"exists":"1","displaytitle":"Body-Mind-Language: Embodied Cognition in Natural Language"},"Bounded Treewidth and the Infinite Core Chase \u2013 Complications and Workarounds toward Decidable Querying":{"printouts":{"Start":[{"timestamp":"1698922800","raw":"1\/2023\/11\/2\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1698926400","raw":"1\/2023\/11\/2\/12\/0\/0\/0"}],"title":["Bounded Treewidth and the Infinite Core Chase \u2013 Complications and Workarounds toward Decidable Querying"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Sebastian Rudolph"],"Details":["Abstract: The core chase, a popular algorithm for answering conjunctive queries (CQs) over existential rules, is guaranteed to terminate and compute a finite universal model whenever one exists, leading to the equivalence of the universal-model-based and the chase-based definitions of finite expansion sets (fes) \u2013 a class of rulesets featuring decidable CQ entailment. In case of non-termination, however, it is non-trivial to define a \"result\" of the core chase, due to its non-monotonicity. This causes complications when dealing with advanced decidability criteria based on the existence of (universal) models of finite treewidth. For these, sufficient chase-based conditions have only been established for weaker, monotonic chase variants.\nThis paper starts out from the \u2013 desirable and prima facie plausible \u2013 conjecture that the existence of a treewidth-bounded universal model and the existence of a treewidth-bounded core-chase sequence coincide \u2013 which would conveniently entail decidable CQ entailment whenever the latter holds. Perhaps surprisingly, carefully crafted examples show that both directions of this conjectured correspondence fail. On a positive note, we are still able to define an aggregation scheme for the infinite core chase that preserves treewidth bounds and produces a finitely universal model, i.e., one that satisfies exactly the entailed CQs. This allows us to prove that the existence of a treewidth-bounded core-chase sequence *does* warrant decidability of CQ entailment (yet, on other grounds than expected). Hence, for the first time, we are able to define a chase-based notion of bounded treewidth sets of rules that subsumes fes.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Bounded Treewidth and the Infinite Core Chase \u2013 Complications and Workarounds toward Decidable Querying","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Bounded_Treewidth_and_the_Infinite_Core_Chase_%E2%80%93_Complications_and_Workarounds_toward_Decidable_Querying","namespace":0,"exists":"1","displaytitle":"Bounded Treewidth and the Infinite Core Chase \u2013 Complications and Workarounds toward Decidable Querying"},"Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting":{"printouts":{"Start":[{"timestamp":"1731582000","raw":"1\/2024\/11\/14\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1731585600","raw":"1\/2024\/11\/14\/12\/0\/0\/0"}],"title":["Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Alexander Beiser"],"Details":["Answer Set Programming (ASP) is a key paradigm for problems in artificial intelligence and industrial contexts. In ASP, problems are modeled via a set of rules. Over the time this paradigm grew into a rich language, enabling complex rule types like aggregate expressions. Most practical ASP systems follow a ground-and-solve pattern, where rule schemes are grounded and resulting rules are solved. There, the so-called grounding bottleneck may prevent from solving, due to sheer grounding sizes. Recently, body-decoupled grounding (BDG) [1] demonstrated how to reduce grounding sizes by delegating effort to solving. However, BDG provides limited interoperability with traditional grounders and only covers simple rule types. \nHybrid Grounding, which we presented at IJCAI24 [2], enables interoperability by the introduction of a novel splitting theorem that allows the free combination of BDG with traditional grounders. Further, we extended the handled rule types with aggregates.\n\nIn this talk, we will (i) provide an overview of BDG and Hybrid Grounding, along with examples demonstrating the practical benefits of Hybrid Grounding. Further, we (ii) delve into the specifics of BDG, and (iii) finally discuss how Hybrid Grounding achieves interoperability between BDG and state-of-the-art methods.\n\n[1] Viktor Besin, Markus Hecher, and Stefan Woltran. \u201eBody-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck\u201c. In: IJCAI22 (2022). \n[2] Alexander Beiser, Markus Hecher, Kaan Unalan, and Stefan Woltran. \u201eBypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting\u201c. In: IJCAI24 (2024)."]},"fulltext":"Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Bypassing_the_ASP_Bottleneck:_Hybrid_Grounding_by_Splitting_and_Rewriting","namespace":0,"exists":"1","displaytitle":"Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting"},"Can A.I. Provably Explain Itself? A gentle Introduction to Description Logics":{"printouts":{"Start":[{"timestamp":"1573736400","raw":"1\/2019\/11\/14\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1573741800","raw":"1\/2019\/11\/14\/14\/30\/0\/0"}],"title":["Can A.I. Provably Explain Itself? A gentle Introduction to Description Logics"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Alisa Kovtunova"],"Details":["The emergence of intelligent systems in self-driving cars, planes, medical diagnosis, insurance and financial services among others has shown that when decisions are taken or suggested by automated systems it is essential that an explanation can be provided. The disconnect between how we make decisions and how machines make them, and the fact that machines are making more and more decisions for us, has given a new push for transparency in A.I. However, the inner workings of machine learning algorithms remain difficult to understand, and the methods of making these models explainable still require expensive human evaluation.\n\n\nOn the other hand, knowledge representation based on description logics allow for providing description of the environment, specifying constraints for the system states and detecting inconsistencies, as well as operating information from heterogeneous (possibly incomplete) data sources, and reasoning about the knowledge of an application domain. Because of the conceptual difference with machine learning algorithms, the description logics formalism is much more similar to human reasoning and can be adapted to supply the user with necessary explications for a decision made. Additionally, in order to model dynamic systems, description logics have extensions enabling additionally temporal and probabilistic reasoning.\n\nIn this talk I will outline key pillars and basic principles of (onto)logical reasoning as well as its limitations. Finally, I will say a few words about an initiative of TU Dresden and Saarland Informatics Campus developing together the concept of perspicuous computing and laying the scientific foundations for computerised systems that are able to express clearly their functioning."]},"fulltext":"Can A.I. Provably Explain Itself? A gentle Introduction to Description Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Can_A.I._Provably_Explain_Itself%3F_A_gentle_Introduction_to_Description_Logics","namespace":0,"exists":"1","displaytitle":"Can A.I. Provably Explain Itself? A gentle Introduction to Description Logics"},"Can AI explanations skew our causal intuitions about the world? If so, can we correct for that?":{"printouts":{"Start":[{"timestamp":"1683198000","raw":"1\/2023\/5\/4\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1683201600","raw":"1\/2023\/5\/4\/12\/0\/0\/0"}],"title":["Can AI explanations skew our causal intuitions about the world? If so, can we correct for that?"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Marko Tesic"],"Details":["Abstract: Explainable Artificial Intelligence provides methods for bringing in transparency into black-box artificial intelligence (AI) systems. These methods produce explanations of AI systems\u2019 predictions that are aimed at increasing the understanding of the AI systems\u2019 behavior and help us to appropriately calibrate our trust in these systems. In this talk, I will explore some of the potential undesirable effects of providing explanations of AI systems to human users and ways to mitigate such effects. I start from the observation that most AI systems capture correlations and associations in data and not causal relationships. Explanations of the AI systems\u2019 predictions would make the correlations more transparent. They would not, however, make the explained relationships causal. In four experiments, I show how providing counterfactual explanations of AI systems\u2019 predictions unjustifiably changes people\u2019s beliefs about causal relationships in the real world. I also show how we may go about preventing such a change in beliefs and hope to open doors for further exploration into psychological effects of AI explanations on human recipients.\n\nThe talk will take place virtually through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Can AI explanations skew our causal intuitions about the world? If so, can we correct for that?","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Can_AI_explanations_skew_our_causal_intuitions_about_the_world%3F_If_so,_can_we_correct_for_that%3F","namespace":0,"exists":"1","displaytitle":"Can AI explanations skew our causal intuitions about the world? If so, can we correct for that?"},"Capturing Homomorphism-Closed Decidable Queries with Existential Rules":{"printouts":{"Start":[{"timestamp":"1638442800","raw":"1\/2021\/12\/2\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1638446400","raw":"1\/2021\/12\/2\/12\/0\/0\/0"}],"title":["Capturing Homomorphism-Closed Decidable Queries with Existential Rules"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Markus Kr\u00f6tzsch"],"Details":["Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward that existential rule queries exhibiting chase termination are decidable and can only recognize properties that are preserved under homomorphisms. In this paper, we show the converse: every decidable query that is closed under homomorphism can be expressed by an existential rule set for which the standard chase universally terminates. Membership in this fragment is not decidable, but we show via a diagonalization argument that this is unavoidable.\nThis work has been presented in a relatively short presentation at KR 2021. This extended talk will have room for more in-depth explanations and discussions.\n\nThe talk is via BigBlueButton, link:\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Capturing Homomorphism-Closed Decidable Queries with Existential Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Capturing_Homomorphism-Closed_Decidable_Queries_with_Existential_Rules","namespace":0,"exists":"1","displaytitle":"Capturing Homomorphism-Closed Decidable Queries with Existential Rules"},"Causality meets Configurable Systems":{"printouts":{"Start":[{"timestamp":"1651748400","raw":"1\/2022\/5\/5\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1651752000","raw":"1\/2022\/5\/5\/12\/0\/0\/0"}],"title":["Causality meets Configurable Systems"],"Room":[{"fulltext":"Https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Clemens Dubslaff"],"Details":["Detecting and understanding reasons for defects and inadvertent behavior in computing systems is challenging due to increasing complexity of such systems. Configurability adds a further layer of complexity as the number of system variants can be exponential in the number of configuration options. Determining reasons of configuration decisions that yield an effect, e.g., ensuring quality of service, is hence a crucial and difficult task. In this talk, I will present a notion of causality at the level of configuration options and algorithms to compute such causes from (functional and non-functional) analysis results. The presented notion of causality is based on counterfactual reasoning and inspired by the seminal definition of actual causality by Halpern and Pearl. I will present various methods to explicate such reasons for effects, e.g., based on well-established notions of responsibility and blame. By means of an evaluation on a wide range of configurable software systems, including community benchmarks and real-world systems, the feasibility of this approach is demonstrated by identifying root causes, estimate the effects of configuration options, and detect feature interactions."]},"fulltext":"Causality meets Configurable Systems","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Causality_meets_Configurable_Systems","namespace":0,"exists":"1","displaytitle":"Causality meets Configurable Systems"},"Seminar 29.07.2021":{"printouts":{"Start":[{"timestamp":"1627563600","raw":"1\/2021\/7\/29\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1627569000","raw":"1\/2021\/7\/29\/14\/30\/0\/0"}],"title":["Challenges of Using Leapfrog Triejoin for Datalog Programs"],"Room":[],"Type":["Vortrag"],"Speaker":["Philipp Hanisch"],"Details":["Datalog is a well-understood relational query language and there are efficient implementations, based on different concepts and technologies. Nevertheless, the search for faster and more efficient reasoners continues. A promising approach for further improvements is the so-called leapfrog triejoin by Veldhuizen. Leapfrog triejoin is a variable-oriented join algorithm and computes the matches of a Datalog rule as a result tree following a previously defined variable order. Leapfrog triejoin is worst-case optimal w.r.t. the AGM bound, which provides a tight bound on the maximum result size of full conjunctive queries, and empirical evaluations suggest that leapfrog triejoin is relevant in practice, too.\n\nThe focus of the current research concerning leapfrog triejoin lies on the theoretical and practical aspects of computing a single join. Implementing a Datalog reasoner based on leapfrog triejoin, however, requires to compute the consequences of a Datalog program with several rules and, thus, several joins. The main task is to find variable orders for all the joins that are both locally and globally good. We discuss challenges, which arise naturally in this setting, as well as potential approaches.\n\n\nThis talk will take place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login: \n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=136288&p=07d4d73e\n\nwithout ZIH-login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=136288&p=788f2a1a"]},"fulltext":"Seminar 29.07.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_29.07.2021","namespace":0,"exists":"1","displaytitle":"Challenges of Using Leapfrog Triejoin for Datalog Programs"},"Characterization of the Expressivity of Existential Rule Queries":{"printouts":{"Start":[{"timestamp":"1440427800","raw":"1\/2015\/8\/24\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1440431400","raw":"1\/2015\/8\/24\/15\/50\/0\/0"}],"title":["Characterization of the Expressivity of Existential Rule Queries"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Micha\u00ebl Thomazo"],"Details":["Existential rules (also known as Datalog+\/- or tuple-generating dependencies) have been intensively studied in recent years as a prominent formalism in knowledge representation and database systems. We consider them here as a querying formalism, extending classical Datalog, the language of deductive databases. It is well known that the classes of databases recognized by (Boolean) existential rule queries are closed under homomorphisms. Also, due to the existence of a semi-decision procedure (the chase), these database classes are recursively enumerable. We show that, conversely, every homomorphism-closed recursively enumerable query can be expressed as an existential rule query, thus arriving at a precise characterization of existential rules by model-theoretic and computational properties. Although the result is very intuitive, the proof turns out to be non-trivial. This result can be seen as a very expressive counterpart of the prominent Lyndon-Los-Tarski-Theorem characterizing the homomorphism-closed fragment of first-order logic. Notably, our result does not presume the existence of any additional built-in structure on the queried data, such as a linear order on the domain, which is a typical requirement for other characterizations in the spirit of descriptive complexity.\n\n\nThis is joint work with Sebastian Rudolph."]},"fulltext":"Characterization of the Expressivity of Existential Rule Queries","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Characterization_of_the_Expressivity_of_Existential_Rule_Queries","namespace":0,"exists":"1","displaytitle":"Characterization of the Expressivity of Existential Rule Queries"},"Characterizing common argumentation semantics using branch evaluations for justification systems":{"printouts":{"Start":[{"timestamp":"1723719600","raw":"1\/2024\/8\/15\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1723723200","raw":"1\/2024\/8\/15\/12\/0\/0\/0"}],"title":["Characterizing common argumentation semantics using branch evaluations for justification systems"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Simon Birkenheuer"],"Details":["First introduced in 2015 by Denecker, Brewka and Strass, justification theory is formalism providing a new way of characterizing semantics for both logic programs and Dung style argumentation frameworks. Justification theory uses branch evaluation functions operating on a body of rules and an interpretation to define a set of justified facts. Fixpoints of the branch evaluation function on a given body of rules are called justified interpretations. Common semantics for argumentation frameworks can be obtained using these justified interpretations. In this work we characterize these semantics using branch evaluations with the goal of characterizing exactly the desired semantics with no additional conditions imposed on the justified interpretations.\nWe present a grounded branch evaluation yielding grounded semantics for argumentation. This grounded branch evaluation coincides with the branch evaluations providing well founded and Kripke-Kleene semantics for logic programming. Furthermore we show that for admissible, preferred and stable argumentation semantics an exact characterization in the general case is not possible."]},"fulltext":"Characterizing common argumentation semantics using branch evaluations for justification systems","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Characterizing_common_argumentation_semantics_using_branch_evaluations_for_justification_systems","namespace":0,"exists":"1","displaytitle":"Characterizing common argumentation semantics using branch evaluations for justification systems"},"Chase Termination Beyond Polynomial Time":{"printouts":{"Start":[{"timestamp":"1717066800","raw":"1\/2024\/5\/30\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1717070400","raw":"1\/2024\/5\/30\/12\/0\/0\/0"}],"title":["Chase Termination Beyond Polynomial Time"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Philipp Hanisch"],"Details":["The chase is a widely implemented approach to reason with tuple-generating dependencies (tgds, aka. existential rules), used in data exchange, data integration, and ontology-based query answering. However, it is merely a semi-decision procedure, which may fail to terminate. Many decidable conditions have been proposed for tgds to ensure chase termination, typically by forbidding some kind of \u201ccycle\u201d in the chase process. We propose a new criterion that explicitly allows some such cycles, and yet ensures termination of the standard chase under reasonable conditions. This leads to new decidable fragments of tgds that are not only syntactically more general but also strictly more expressive than the fragments defined by prior acyclicity conditions. Indeed, while known terminating fragments are restricted to PTime data complexity, our conditions yield decidable languages for any \ud835\udc58-ExpTime. We further refine our syntactic conditions to obtain fragments of tgds for which an optimised chase procedure decides query entailment in PSpace or \ud835\udc58-ExpSpace, respectively."]},"fulltext":"Chase Termination Beyond Polynomial Time","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Chase_Termination_Beyond_Polynomial_Time","namespace":0,"exists":"1","displaytitle":"Chase Termination Beyond Polynomial Time"},"Seminar 16.09.2021":{"printouts":{"Start":[{"timestamp":"1631797200","raw":"1\/2021\/9\/16\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1631802600","raw":"1\/2021\/9\/16\/14\/30\/0\/0"}],"title":["Chase-Based Computation of Cores for Existential Rules"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Lukas Gerlach"],"Details":["The chase is a well studied sound and complete algorithm for computing universal models of knowledge bases that consist of an existential rule set and a set of facts. Since universal models can be used to solve generally undecidable reasoning tasks like BCQ entailment, it is no surprise that termination of the chase is undecidable as well. While conditions for termination and non-termination of variants like the skolem- or restricted-chase have been studied extensively, similar conditions for the core chase rarely exist. In practice, the core chase does not seem to be feasible. Still, compared to the other chase variants, the core chase not only yields a universal model but even a core, which intuitively is the smallest universal model that exists (up to isomorphism). Thus, the core chase terminates if and only if the given knowledge base has a finite universal model. In recent work, it has been shown that for rule sets that are \u201ccore-stratified\u201d, the restricted chase also yields universal models that are cores if it terminates.\nIn our work, we strengthen the existing result and proof that restricted and core chase termination exactly coincide for core-stratified rule sets. This also implies that we can use sufficient conditions for restricted chase non-termination as sufficient conditions for the non-existence of finite universal models. We also find a new fragment of existential rules for which core chase termination is decidable based on an existing result that shows decidability of restricted chase termination for the same fragment and we conjecture that this even holds for a slightly larger fragment by generalizing the so-called Fairness Theorem, which is a key part of the decidability proof. For non-core-stratified rule sets, we investigate a possible heuristic for core computation and introduce the hybrid chase as a mixture of restricted and core chase as a new chase variant equivalent to the core chase.\n\n\nThis is a diploma thesis defence. It will be given online via BigBlueButton. To access the room, use one of the following links:\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=140092&p=6a50295d\n\nwithout ZIH-login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=140092&p=ea2e02f3"]},"fulltext":"Seminar 16.09.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_16.09.2021","namespace":0,"exists":"1","displaytitle":"Chase-Based Computation of Cores for Existential Rules"},"Chasing Sets: How to Use Existential Rules for Expressive Reasoning":{"printouts":{"Start":[{"timestamp":"1564664400","raw":"1\/2019\/8\/1\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1564668000","raw":"1\/2019\/8\/1\/14\/0\/0\/0"}],"title":["Chasing Sets: How to Use Existential Rules for Expressive Reasoning"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Irina Dragoste"],"Details":["Abstract: We propose that modern existential rule reasoners can enable fully declarative implementations of rule-based inference methods in knowledge representation, in the sense that a particular calculus is captured by a fixed set of rules that can be evaluated on varying inputs (encoded as facts). We introduce Datalog(S) \u2013 Datalog with support for sets \u2013 as a surface language for such translations, and show that it can be captured in a decidable fragment of existential rules. We then implement several known inference methods in Datalog(S), and empirically show that an existing existential rule reasoner can thus be used to solve practical reasoning problems.\n\n\nThis talk is a rehearsal for a presentation (15 minutes including questions) at IJCAI 2019."]},"fulltext":"Chasing Sets: How to Use Existential Rules for Expressive Reasoning","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Chasing_Sets:_How_to_Use_Existential_Rules_for_Expressive_Reasoning","namespace":0,"exists":"1","displaytitle":"Chasing Sets: How to Use Existential Rules for Expressive Reasoning"},"Chasing Sets: How to Use Existential Rules for Expressive Reasoning (Extended Abstract)":{"printouts":{"Start":[{"timestamp":"1560432600","raw":"1\/2019\/6\/13\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1560434400","raw":"1\/2019\/6\/13\/14\/0\/0\/0"}],"title":["Chasing Sets: How to Use Existential Rules for Expressive Reasoning"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Irina Dragoste"],"Details":["'''Abstract:''' We propose that modern existential rule reasoners can enable fully declarative implementations of rule-based inference methods in knowledge representation, in the sense that a particular calculus is captured by a fixed set of rules that can be evaluated on varying inputs (encoded as facts). We introduce Datalog(S) \u2013 Datalog with support for sets \u2013 as a surface language for such translations, and show that it can be captured in a decidable fragment of existential rules. We then implement several known inference methods in Datalog(S), and empirically show that an existing existential rule reasoner can thus be used to solve practical reasoning problems.\n\n\nThis talk is a rehearsal for a SHORT ORAL presentation (17 minutes without questions) at DL 2019."]},"fulltext":"Chasing Sets: How to Use Existential Rules for Expressive Reasoning (Extended Abstract)","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Chasing_Sets:_How_to_Use_Existential_Rules_for_Expressive_Reasoning_(Extended_Abstract)","namespace":0,"exists":"1","displaytitle":"Chasing Sets: How to Use Existential Rules for Expressive Reasoning"},"Checking Chase Termination over Ontologies of Existential Rules with Equality":{"printouts":{"Start":[{"timestamp":"1579784400","raw":"1\/2020\/1\/23\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1579789800","raw":"1\/2020\/1\/23\/14\/30\/0\/0"}],"title":["Checking Chase Termination over Ontologies of Existential Rules with Equality"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["David Carral"],"Details":["The chase is a sound and complete algorithm for conjunctive query answering over ontologies of existential rules with equality. To enable its effective use, we can apply acyclicity notions; that is, sufficient conditions that guarantee chase termination. Unfortunately, most of these notions have only been defined for existential rule sets without equality. A proposed solution to circumvent this issue is to treat equality as an ordinary predicate with an explicit axiomatisation. We empirically show that this solution is not efficient in practice and propose an alternative approach. More precisely, we show that, if the chase terminates for any equality axiomatisation of an ontology, then it terminates for the original ontology (which may contain equality). Therefore, one can apply existing acyclicity notions to check chase termination over an axiomatisation of an ontology and then use the original ontology for reasoning. We show that, in practice, doing so results in a more efficient reasoning procedure. Furthermore, we present equality model-faithful acyclicity, a general acyclicity notion that can be directly applied to ontologies with equality.\n\n\nThis talk is a rehearsal for AAAI 2020. \nJoint work with Jacopo Urbani."]},"fulltext":"Checking Chase Termination over Ontologies of Existential Rules with Equality","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Checking_Chase_Termination_over_Ontologies_of_Existential_Rules_with_Equality","namespace":0,"exists":"1","displaytitle":"Checking Chase Termination over Ontologies of Existential Rules with Equality"},"Chile \u2013 A Trip Report":{"printouts":{"Start":[{"timestamp":"1428936600","raw":"1\/2015\/4\/13\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1428940200","raw":"1\/2015\/4\/13\/15\/50\/0\/0"}],"title":["Chile \u2013 A Trip Report"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Sebastian Rudolph"],"Details":[]},"fulltext":"Chile \u2013 A Trip Report","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Chile_%E2%80%93_A_Trip_Report","namespace":0,"exists":"1","displaytitle":"Chile \u2013 A Trip Report"},"Classification of the finite polymorphism-homogeneous tournaments with loops":{"printouts":{"Start":[{"timestamp":"1535029200","raw":"1\/2018\/8\/23\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1535034600","raw":"1\/2018\/8\/23\/14\/30\/0\/0"}],"title":["Classification of the finite polymorphism-homogeneous tournaments with loops"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Thomas Feller"],"Details":["The classical notion of \"homogeneity\" plays a part in model theory. In this talk we look at a variant of this property, the so called \"polymorphism-homogeneity\", first explicitly examined by Christian and Maja Pech, by classifying the finite tournaments (loops allowed), which are polymorphism-homogeneous. For this we utilize the classification of the finite homomorphism-homogeneous tournaments with loops, done by A. Ili\u0107, D. Ma\u0161ulovi\u0107 and U. Rajkovi\u0107."]},"fulltext":"Classification of the finite polymorphism-homogeneous tournaments with loops","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Classification_of_the_finite_polymorphism-homogeneous_tournaments_with_loops","namespace":0,"exists":"1","displaytitle":"Classification of the finite polymorphism-homogeneous tournaments with loops"},"Closed-World Semantics for Conjunctive Queries with Negation over ELH bottom Ontologies":{"printouts":{"Start":[{"timestamp":"1555592400","raw":"1\/2019\/4\/18\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1555597800","raw":"1\/2019\/4\/18\/14\/30\/0\/0"}],"title":["Closed-World Semantics for Conjunctive Queries with Negation over ELH_bottom Ontologies"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Walter Forkel"],"Details":["'''Abstract:''' Ontology-mediated query answering is a popular paradigm for enriching answers to user queries with background knowledge. For querying the absence of information, however, there exist only few ontology based approaches. Moreover, these proposals conflate the closed-domain and closed-world assumption, and therefore are not suited to deal with the anonymous objects that are common in ontological reasoning. We propose a new closed-world semantics for answering conjunctive queries with negation over ontologies formulated in the description logic ELH-bottom, which is based on the minimal canonical model. We propose a rewriting strategy for dealing with negated query atoms, which shows that query answering is possible in polynomial time in data complexity.\n\n\nThis work was awarded Best Paper at JELIA 2019: https:\/\/jelia2019.mat.unical.it\/awards."]},"fulltext":"Closed-World Semantics for Conjunctive Queries with Negation over ELH bottom Ontologies","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Closed-World_Semantics_for_Conjunctive_Queries_with_Negation_over_ELH_bottom_Ontologies","namespace":0,"exists":"1","displaytitle":"Closed-World Semantics for Conjunctive Queries with Negation over ELH_bottom Ontologies"},"Codifying Logical Fragments in ASP - A General Knowledge Base Approach":{"printouts":{"Start":[{"timestamp":"1612443600","raw":"1\/2021\/2\/4\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1612449000","raw":"1\/2021\/2\/4\/14\/30\/0\/0"}],"title":["Codifying Logical Fragments in ASP - A General Knowledge Base Approach"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Dominic Deckert"],"Details":["The study of logic fragments, their limitations and expressive properties is and has been an important field for topics such as Knowledge Representation, Model Checking and even Human Reasoning. Many different research fields have found properties for different logic fragments and drawn links between these fragments. In this project, we have aimed to build a general framework for representing these different fragments, their properties and for inferring new results from their relative expressivity. Using Answer Set Programming (ASP) for its useful computational properties, we have implemented this knowledge base and provide ways to query it or find explanations for any inferred results.\n\nThis talk will be a project defence and takes place via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-Login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=79924&p=e5e8bd36\n\nwithout ZIH-Login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=79924&p=e66e7dfe"]},"fulltext":"Codifying Logical Fragments in ASP - A General Knowledge Base Approach","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Codifying_Logical_Fragments_in_ASP_-_A_General_Knowledge_Base_Approach","namespace":0,"exists":"1","displaytitle":"Codifying Logical Fragments in ASP - A General Knowledge Base Approach"},"Communication with Automata":{"printouts":{"Start":[{"timestamp":"1652958000","raw":"1\/2022\/5\/19\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1652961600","raw":"1\/2022\/5\/19\/12\/0\/0\/0"}],"title":["Communication with Automata"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Stephan Mennicke"],"Details":["In this talk I will give an overview on the basic notions of Petri nets, in order to derive two results and their proofs. The selection of the particular results is (1) a personal choice (because I like them) and (2) taught in the course \"Models of Concurrent Systems\" (apparently also known as \"Concurrency Theory\") this semester.\n\nThe talk is online, \nLink: https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Communication with Automata","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Communication_with_Automata","namespace":0,"exists":"1","displaytitle":"Communication with Automata"},"Complexity of Projection with Stochastic Actions in a Probabilistic Description Logic":{"printouts":{"Start":[{"timestamp":"1537448400","raw":"1\/2018\/9\/20\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1537453800","raw":"1\/2018\/9\/20\/14\/30\/0\/0"}],"title":["Complexity of Projection with Stochastic Actions in a Probabilistic Description Logic"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Benjamin Zarrie\u00df"],"Details":["Integrating probabilistic notions of uncertainty into languages for reasoning about actions is a popular approach to adequately deal for instance with possibly fallible acting and sensing. In this talk, an action language extended with quantitative notions of uncertainty is considered. In our setting, the initial beliefs of an agent are represented as a probabilistic knowledge base with axioms formulated in the Description Logic ALCO. Action descriptions describe the possibly context-sensitive and nondeterministic effects of actions and provide likelihood distributions over the different possible outcomes. A decidability result for the probabilistic projection problem, which is the basic reasoning task needed for predicting the outcome of action sequences, is presented. Furthermore, I will talk about the problem of how the nondeterminism in the action model affects the complexity of the projection problem."]},"fulltext":"Complexity of Projection with Stochastic Actions in a Probabilistic Description Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Complexity_of_Projection_with_Stochastic_Actions_in_a_Probabilistic_Description_Logic","namespace":0,"exists":"1","displaytitle":"Complexity of Projection with Stochastic Actions in a Probabilistic Description Logic"},"Compositional Matrix-Space Models: Learning Methods and Evaluation":{"printouts":{"Start":[{"timestamp":"1590670800","raw":"1\/2020\/5\/28\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1590676200","raw":"1\/2020\/5\/28\/14\/30\/0\/0"}],"title":["Compositional Matrix-Space Models: Learning Methods and Evaluation"],"Room":[{"fulltext":"Digital","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Digital","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Shima Asaadi"],"Details":["There has been a lot of research on machine-readable representations of words for natural\nlanguage processing (NLP). One mainstream paradigm for the word meaning representation\ncomprises vector-space models obtained from the distributional information of words in\nthe text. Machine learning techniques have been proposed to produce such word representations\nfor computational linguistic tasks. Moreover, the representation of multi-word\nstructures, such as phrases, in vector space can arguably be achieved by composing the distributional\nrepresentation of the constituent words. To this end, mathematical operations have\nbeen introduced as composition methods in vector space. An alternative approach to word\nrepresentation and semantic compositionality in natural language has been compositional\nmatrix-space models. In this thesis, two research directions are considered. In the first,\nconsidering compositional matrix-space models, we explore word meaning representations\nand semantic composition of multi-word structures in matrix space. The main motivation\nfor working on these models is that they have shown superiority over vector-space models\nregarding several properties. The most important property is that the composition operation\nin matrix-space models can be defined as standard matrix multiplication; in contrast to\ncommon vector space composition operations, this is sensitive to word order in language. We\ndesign and develop machine learning techniques that induce continuous and numeric representations\nof natural language in matrix space. The main goal in introducing representation\nmodels is enabling NLP systems to understand natural language to solve multiple related\ntasks. Therefore, first, different supervised machine learning approaches to train word\nmeaning representations and capture the compositionality of multi-word structures using\nthe matrix multiplication of words are proposed. The performance of matrix representation\nmodels learned by machine learning techniques is investigated in solving two NLP tasks,\nnamely, sentiment analysis and compositionality detection. Then, learning techniques for\nlearning matrix-space models are proposed that introduce generic task-agnostic representation\nmodels, also called word matrix embeddings. In these techniques, word matrices are\ntrained using the distributional information of words in a given text corpus. We show the\neffectiveness of these models in the compositional representation of multi-word structures in\nnatural language.\nThe second research direction in this thesis explores effective approaches for evaluating\nthe capability of semantic composition methods in capturing the meaning representation of\ncompositional multi-word structures, such as phrases. A common evaluation approach is\nexamining the ability of the methods in capturing the semantic relatedness between linguistic\nunits. The underlying assumption is that the more accurately a method of semantic composition\ncan determine the representation of a phrase, the more accurately it can determine the\nrelatedness of that phrase with other phrases. To apply the semantic relatedness approach,\ngold standard datasets have been introduced. In this thesis, we identify the limitations of\nthe existing datasets and develop a new gold standard semantic relatedness dataset, which\naddresses the issues of the existing datasets. The proposed dataset allows us to evaluate\nmeaning composition in vector- and matrix-space models.\n\nThe presentation will take 45 minutes without questions. Afterwards there will be Q&A.\nThis talk will be held digitally. If there is any interest in attending, please write an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"Compositional Matrix-Space Models: Learning Methods and Evaluation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Compositional_Matrix-Space_Models:_Learning_Methods_and_Evaluation","namespace":0,"exists":"1","displaytitle":"Compositional Matrix-Space Models: Learning Methods and Evaluation"},"Computability and Complexity of (Iterated) Belief Revision":{"printouts":{"Start":[{"timestamp":"1664978400","raw":"1\/2022\/10\/5\/14\/0\/0\/0"}],"Ende":[{"timestamp":"1664982000","raw":"1\/2022\/10\/5\/15\/0\/0\/0"}],"title":["Computability and Complexity of (Iterated) Belief Revision"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Kai Sauerwald"],"Details":["Belief revision denotes the process of the incorporation of new information while maintaining consistency whenever possible. In this talk, at first, we consider some known complexity results for belief revision. Second, we consider the recent insight that the typical framework for iterated belief revision is computationally universal."]},"fulltext":"Computability and Complexity of (Iterated) Belief Revision","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Computability_and_Complexity_of_(Iterated)_Belief_Revision","namespace":0,"exists":"1","displaytitle":"Computability and Complexity of (Iterated) Belief Revision"},"Computing Generalizations of Temporal EL Concepts with Next and Global":{"printouts":{"Start":[{"timestamp":"1649934000","raw":"1\/2022\/4\/14\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1649937600","raw":"1\/2022\/4\/14\/12\/0\/0\/0"}],"title":["Computing Generalizations of Temporal EL Concepts with Next and Global"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Satyadharma Tirtarasa"],"Details":["In ontology-based applications, the authoring of complex concepts or queries written in a description logic (DL) is a difficult task. An established approach to generate complex expressions from examples provided a user, is the bottom-up approach. This approach employs two inferences: the most specific concept (MSC), which generalizes an ABox individual into a concept and the least common subsumer (LCS), which generalizes a collection of concepts into a single concept. In ontology-based situation recognition the situation to be recognized is formalized by a DL query using temporal operators and that is to answered over a sequence of ABoxes. Now, while the bottom-up approach is well-investigated for the DL EL, there are so far no methods for temporalized DLs. We consider here the temporalized DL that extends the DL EL with the LTL operators next (X) and global (G) and we present an approach that extends the LCS and the MSC to the temporalized setting."]},"fulltext":"Computing Generalizations of Temporal EL Concepts with Next and Global","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Computing_Generalizations_of_Temporal_EL_Concepts_with_Next_and_Global","namespace":0,"exists":"1","displaytitle":"Computing Generalizations of Temporal EL Concepts with Next and Global"},"Conceptual Visualization and Navigation Methods for Polyadic Formal Concept Analysis":{"printouts":{"Start":[{"timestamp":"1466002200","raw":"1\/2016\/6\/15\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1466005800","raw":"1\/2016\/6\/15\/15\/50\/0\/0"}],"title":["Conceptual Visualization and Navigation Methods for Polyadic Formal Concept Analysis"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Diana Troanc\u0103"],"Details":["Formal concept analysis (FCA) is the core of Conceptual Knowledge Processing, being closely related to a deeper understanding of existing facts and relationships, while at the same time trying to find explanations for their existence. Polyadic formal concept analysis is an extension of classical FCA that instead of binary relations uses an n-ary incidence relation to define formal concepts, i.e. data clusters in which all elements are interrelated. In this thesis, we introduce new methods of visualization, navigation and exploration based on polyadic formal concept analysis for n-adic datasets with n = 3. In the first part, we introduce a triadic approach to study the Web usage behavior of an e-learning platform. We analyze temporal aspects of the users' behavior and visualize the results in a circular layout using the Circos tool. In the subsequent chapter, we define methods to reduce the size of a triadic dataset without altering its underlying structure. For this purpose, we extend the notions of clarification and reduction from the dyadic to the triadic setting and show that these processes have an influence solely on the efficiency and not on the results of any further analysis. Next, we introduce a navigation paradigm based on a reachability relation among formal concepts. This relation gives rise to so-called reachability clusters containing mutually reachable concepts. We discuss theoretical aspects about the properties of the formal concepts arising from the defined reachability relation and describe the framework of the proposed navigation paradigm. Subsequently, we consider the problem of satisfiability of membership constraints in order to determine if a formal concept exists whose components include and exclude certain elements. We analyze the computational complexity of this problem for particular cases as well as for the general n-adic problem and present an answer set programming encoding for the membership constraint satisfaction problem. Next, we propose a navigation paradigm based on membership constraints and implement it for the dyadic, triadic and tetradic case using different strategies, one based on the proposed ASP encoding and one using an exhaustive search in the whole concept set, precomputed with an external FCA tool. We evaluate and compare the implementations and discuss the limitations and the possibility of generalizations of each approach. In the final part of the thesis, we describe the achievements of our research as well as possible directions for future work."]},"fulltext":"Conceptual Visualization and Navigation Methods for Polyadic Formal Concept Analysis","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Conceptual_Visualization_and_Navigation_Methods_for_Polyadic_Formal_Concept_Analysis","namespace":0,"exists":"1","displaytitle":"Conceptual Visualization and Navigation Methods for Polyadic Formal Concept Analysis"},"Constraint Propagation and Pebble Games":{"printouts":{"Start":[{"timestamp":"1464959700","raw":"1\/2016\/6\/3\/13\/15\/0\/0"}],"Ende":[{"timestamp":"1464963300","raw":"1\/2016\/6\/3\/14\/15\/0\/0"}],"title":["Constraint Propagation and Pebble Games"],"Room":[{"fulltext":"WIL C115","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/WIL_C115","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Christoph Berkholz"],"Details":["A generic method for solving the constraint satisfaction problem is \"constraint propagation\" where one iteratively derives new constraints in order to shrink the search space or to detect inconsistencies in the instance. A classical and very basic algorithm in this area is the so-called k-consistency test that iteratively derives local constraints involving only k variables. In this talk I will give an introduction to this method and show that the k-consistency test is tightly connected to a simple combinatorial pebble game originally introduced in the context of finite model theory. Afterwards I will present some results on the structure and complexity of the k-consistency test that have been obtained via this pebble game in the last years."]},"fulltext":"Constraint Propagation and Pebble Games","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Constraint_Propagation_and_Pebble_Games","namespace":0,"exists":"1","displaytitle":"Constraint Propagation and Pebble Games"},"Containment of Monadic Datalog":{"printouts":{"Start":[{"timestamp":"1415107800","raw":"1\/2014\/11\/4\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1415111400","raw":"1\/2014\/11\/4\/14\/30\/0\/0"}],"title":["Containment of Monadic Datalog"],"Room":[{"fulltext":"APB 0005","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_0005","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Pierre Bourhis"],"Details":["We reconsider the problem of containment of monadic datalog (MDL) queries in unions of conjunctive queries (UCQs). Prior work has dealt with special cases, but has left the precise complexity characterization open. We begin by establishing a 2EXPTIME lower bound on the MDL\/UCQ containment problem, resolving an open problem from the early 90\u2019s. We then present a general approach for getting tighter bounds on the complexity, based on analysis of the number of mappings of queries into tree-like instances. We use the machinery to present an important case of the MDL\/UCQ containment problem that is in co-NEXPTIME, and a case that is in EXPTIME. We then show that the technique can be used to get a new tight upper bound for containment of tree automata in UCQs. We show that the new MDL\/UCQ upper bounds are tight."]},"fulltext":"Containment of Monadic Datalog","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Containment_of_Monadic_Datalog","namespace":0,"exists":"1","displaytitle":"Containment of Monadic Datalog"},"Context Reasoning for Role-Based Models":{"printouts":{"Start":[{"timestamp":"1509095700","raw":"1\/2017\/10\/27\/9\/15\/0\/0"}],"Ende":[{"timestamp":"1509099300","raw":"1\/2017\/10\/27\/10\/15\/0\/0"}],"title":["Context Reasoning for Role-Based Models"],"Room":[{"fulltext":"APB 1004","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_1004","namespace":0,"exists":"1","displaytitle":"Raum APB 1004"}],"Type":["Vortrag"],"Speaker":["Stephan B\u00f6hme"],"Details":["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."]},"fulltext":"Context Reasoning for Role-Based Models","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Context_Reasoning_for_Role-Based_Models","namespace":0,"exists":"1","displaytitle":"Context Reasoning for Role-Based Models"},"Cyclic Proof Theory":{"printouts":{"Start":[{"timestamp":"1729767600","raw":"1\/2024\/10\/24\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1729771200","raw":"1\/2024\/10\/24\/12\/0\/0\/0"}],"title":["Cyclic Proof Theory"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Bahareh Afshari (University of Gothenburg)"],"Details":["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."]},"fulltext":"Cyclic Proof Theory","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Cyclic_Proof_Theory","namespace":0,"exists":"1","displaytitle":"Cyclic Proof Theory"},"Data Complexity in Expressive Description Logics With Path Expressions":{"printouts":{"Start":[{"timestamp":"1718276400","raw":"1\/2024\/6\/13\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1718280000","raw":"1\/2024\/6\/13\/12\/0\/0\/0"}],"title":["Data Complexity in Expressive Description Logics With Path Expressions"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["In my recent IJCAI paper I established NP-completeness of the satisfiability problem (w.r.t. the data complexity) of the maximal known decidable fragments ZIQ, ZOQ, and ZOI of the very description logic ZOIQ (a.k.a. ALCHb^self_regOIQ).\nThe proof uniformly deals with these three logics, by considering the DL ZOIQ but over forest-like structures dubbed quasi-forests.\nDuring the talk, I will give a high-level overview of the proof, and discuss its main ingredients and challenges.\n\nhttps:\/\/bbb.tu-dresden.de\/rooms\/n5w-ghp-qoq-kts\/join"]},"fulltext":"Data Complexity in Expressive Description Logics With Path Expressions","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Data_Complexity_in_Expressive_Description_Logics_With_Path_Expressions","namespace":0,"exists":"1","displaytitle":"Data Complexity in Expressive Description Logics With Path Expressions"},"Data Science Use Cases for Lifestyle Banking":{"printouts":{"Start":[{"timestamp":"1556197200","raw":"1\/2019\/4\/25\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1556202600","raw":"1\/2019\/4\/25\/14\/30\/0\/0"}],"title":["Data Science Use Cases for Lifestyle Banking"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Boontawee (Meng) Suntisrivaraporn"],"Details":["Abstract:\nTraditional banking concerns itself with risk understanding, credit underwriting, cash need, liquidity, etc. Data science and machine learning have proved useful in banking businesses to mitigate risk while targeting the right customers with cash need. In this talk, we will explore a lifestyle side of banking that goes beyond the traditional realm and delves more into alternative signals to customers needs. We will see example data science use cases that have been successfully implemented in banking business at Siam Commercial Bank."]},"fulltext":"Data Science Use Cases for Lifestyle Banking","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Data_Science_Use_Cases_for_Lifestyle_Banking","namespace":0,"exists":"1","displaytitle":"Data Science Use Cases for Lifestyle Banking"},"Database-Inspired Reasoning Problems in Description Logics With Path Expressions":{"printouts":{"Start":[{"timestamp":"1685617200","raw":"1\/2023\/6\/1\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1685620800","raw":"1\/2023\/6\/1\/12\/0\/0\/0"}],"title":["Database-Inspired Reasoning Problems in Description Logics With Path Expressions"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["This is a status talk (i.e. pre-PHD-defense talk) for the ongoing PHD thesis of Bartosz Bednarczyk, supervised by Sebastian Rudolph (TU Dresden) and Emanuel Kiero\u0144ski (University of Wroc\u0142aw). The main goal of the thesis is to study database-inspired reasoning problems (e.g. satisfiability, query entailment or query containment problems) for the very expressive family Z of description logics.\n\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Database-Inspired Reasoning Problems in Description Logics With Path Expressions","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Database-Inspired_Reasoning_Problems_in_Description_Logics_With_Path_Expressions","namespace":0,"exists":"1","displaytitle":"Database-Inspired Reasoning Problems in Description Logics With Path Expressions"},"Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures":{"printouts":{"Start":[{"timestamp":"1685012400","raw":"1\/2023\/5\/25\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1685016000","raw":"1\/2023\/5\/25\/12\/0\/0\/0"}],"title":["Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Luisa Herrmann"],"Details":["Abstract: We propose \u03c9MSO\u22c8BAPA, an expressive logic for describing countable structures, which subsumes and transcends both Counting Monadic Second-Order Logic (CMSO) and Boolean Algebra with Presburger Arithmetic (BAPA). We show that satisfiability of \u03c9MSO\u22c8BAPA is decidable over the class of labeled infinite binary trees. This result is established by an elaborate multi-step transformation into a particular normal form, followed by the deployment of Parikh-Muller Tree Automata, a novel kind of automaton for infinite labeled binary trees, integrating and generalizing both Muller and Parikh automata while still exhibiting a decidable (in fact PSpace-complete) emptiness problem. By means of MSO-interpretations, we lift the decidability result to all tree-interpretable classes of structures, including the classes of finite\/countable structures of bounded treewidth\/cliquewidth\/partitionwidth. We observe that satisfiability over (finite or infinite) labeled trees becomes undecidable even for a rather mild extension of \u03c9MSO\u22c8BAPA.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Decidable_(Ac)counting_with_Parikh_and_Muller:_Adding_Presburger_Arithmetic_to_Monadic_Second-Order_Logic_over_Tree-Interpretable_Structures","namespace":0,"exists":"1","displaytitle":"Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures"},"Decomposation of regular languages":{"printouts":{"Start":[{"timestamp":"1489662000","raw":"1\/2017\/3\/16\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1489665600","raw":"1\/2017\/3\/16\/12\/0\/0\/0"}],"title":["Decomposition of regular languages"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Tom\u00e1\u0161 Masopust"],"Details":["I will discuss a problem how to decompose a regular language with respect to a set of alphabets and will show how to overcome undecidability by using a small trick, which leads to polynomial complexity."]},"fulltext":"Decomposation of regular languages","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Decomposation_of_regular_languages","namespace":0,"exists":"1","displaytitle":"Decomposition of regular languages"},"Deep Inference Christmas Meeting 2007":{"printouts":{"Start":[{"timestamp":"1198054800","raw":"1\/2007\/12\/19\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1198080000","raw":"1\/2007\/12\/19\/16\/0\/0\/0"}],"title":["Deep Inference Christmas Meeting 2007"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["The idea of this workshop is to provide an informal atmosphere for discussion on deep inference and related topics. This time, the workshop will be held in Dresden, the city where deep inference was born.\n\nPast events were held in Dresden in November 2003, in September 2004, in February 2005, in December 2005, in Lisbon in 2005, in Bath in July 2006, in Paris in December 2006, and in Palaiseau in June 2007.\n\nThis meeting comes with a goody: There will be an introductory mini-course (5 x 90min) on deep inference for the local Master's students held from Dec 17 to Dec 22 by Paola Bruscoli and Lutz Stra\u00dfburger."]},"fulltext":"Deep Inference Christmas Meeting 2007","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Deep_Inference_Christmas_Meeting_2007","namespace":0,"exists":"1","displaytitle":"Deep Inference Christmas Meeting 2007"},"Deontic Explanations via Logical Argumentation.":{"printouts":{"Start":[{"timestamp":"1686826800","raw":"1\/2023\/6\/15\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1686830400","raw":"1\/2023\/6\/15\/12\/0\/0\/0"}],"title":["Deontic Explanations via Logical Argumentation."],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Kees van Berkel"],"Details":["Abstract: In many normative reasoning contexts, one is not merely interested in knowing whether an obligation holds, but also in why it holds despite other norms to the contrary. Answers to such why questions are deontic explanations. They not only lead to a better understanding of normative reasoning, they also motivate compliance and collaboration. The importance of such explanations increases with the development of AI systems that need to comply with normative codes. The study of explanation is growing rapidly but, so far, little to no formal work has been done in the intersection of explanation and normative reasoning. What is more, existing approaches in deontic logic do not make explicit the reasons why certain obligations do and do not hold given a normative system, and are, therefore, not yet suitable for deontic explanations. In collaboration with Christian Strasser, we developed Deontic Argumentation Calculi (DAC): Sequent-style proof systems tailored to the construction of deontic explanations. DAC generate transparent arguments that provide explicit reasons why certain obligations hold and why certain norms are inapplicable. We prove that Formal Argumentation (FA) frameworks instantiated with DAC arguments are sound and complete with respect to the nonmonotonic inference relation of the class of constrained Input\/Output (I\/O) logics, a renowned formalism for defeasible reasoning with norms and their conflicts. We demonstrate how to employ DAC to generate deontic explanations using general tools from the FA literature. In particular, we use these tools to generate deontic explanations as answers to contrastive questions of the form \u201cWhy am I obliged to \u03d5, despite \u03c8?\u201d\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Deontic Explanations via Logical Argumentation.","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Deontic_Explanations_via_Logical_Argumentation.","namespace":0,"exists":"1","displaytitle":"Deontic Explanations via Logical Argumentation."},"Description Logic with Abstraction and Refinement":{"printouts":{"Start":[{"timestamp":"1738839600","raw":"1\/2025\/2\/6\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1738843200","raw":"1\/2025\/2\/6\/12\/0\/0\/0"}],"title":["Description Logic with Abstraction and Refinement"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Lukas Schulze"],"Details":["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."]},"fulltext":"Description Logic with Abstraction and Refinement","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Description_Logic_with_Abstraction_and_Refinement","namespace":0,"exists":"1","displaytitle":"Description Logic with Abstraction and Refinement"},"Seminar 08.04.2021":{"printouts":{"Start":[{"timestamp":"1617886800","raw":"1\/2021\/4\/8\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1617892200","raw":"1\/2021\/4\/8\/14\/30\/0\/0"}],"title":["Detecting Non-Existence of Finite Universal Models for Existential Rules"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Lukas Gerlach"],"Details":["For reasoning over ontologies, (finite) universal models play an important role in tasks like conjunctive query answering, which is undecidable. The (restricted) chase is a sound and complete algorithm for computing (finite) universal models of ontologies featuring existential rules. Termination of the chase is undecidable and various sufficient conditions for termination and non-termination have been studied. If the chase terminates, we obtain a finite universal model. However, if the chase does not terminate, a finite universal model may still exist. In recent work, it has been shown that for certain ontologies for which the chase terminates, there exists a chase sequence that yields a universal model that is a core and therefore is the smallest universal model for the given rule set up to isomorphism. We extend this result to non-terminating chase sequences. By that, we are able to introduce a sufficient condition for the existence of an infinite universal model that is a core which in turn implies that no finite universal model exists.\n\nNote that this talk acts as a colloquium\/examination for the module INF-PM-FPG. It will take place online via BigBlueButton. To access the room, take one of the following links: \n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=86971&p=30896df0\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=86971&p=83001746"]},"fulltext":"Seminar 08.04.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_08.04.2021","namespace":0,"exists":"1","displaytitle":"Detecting Non-Existence of Finite Universal Models for Existential Rules"},"Discovering Fine-Grained Semantics in Knowledge Graph Relations":{"printouts":{"Start":[{"timestamp":"1665054000","raw":"1\/2022\/10\/6\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1665057600","raw":"1\/2022\/10\/6\/12\/0\/0\/0"}],"title":["Discovering Fine-Grained Semantics in Knowledge Graph Relations"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Nitisha Jain"],"Details":["Knowledge graphs (KGs) provide structured representation of data in the\nform of relations between different entities. The semantics of relations\nbetween words and entities are often ambiguous, where it is common to\nfind polysemous relations that represent multiple semantics based on the\ncontext. This ambiguity in relation semantics also proliferates KG\ntriples. While the guidance from custom-designed ontologies addresses\nthis issue to some extent, our analysis shows that the heterogeneity and\ncomplexity of real-world data still results in substantial relation\npolysemy within popular KGs. The correct semantic interpretation of KG\nrelations is necessary for many downstream applications such as entity\nclassification and question answering.\n\nWe present the problem of fine-grained relation discovery and a\ndata-driven method towards this task that leverages the vector\nrepresentations of the knowledge graph entities and relations available\nfrom relational learning models.\n\nWe show that by performing clustering over these vectors, our method is\nable to not only identify the polysemous relations in knowledge graphs,\nbut also discover the different semantics associated with them.\nExtensive empirical evaluation shows that fine-grained relations\ndiscovered by the proposed approach lead to substantial improvement in\nthe semantics in the Yago and NELL datasets, as compared to baselines.\n\nThe talk will take place in a hybrid fashion, physically in the seminar room, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Discovering Fine-Grained Semantics in Knowledge Graph Relations","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Discovering_Fine-Grained_Semantics_in_Knowledge_Graph_Relations","namespace":0,"exists":"1","displaytitle":"Discovering Fine-Grained Semantics in Knowledge Graph Relations"},"Discovering Implicational Knowledge in Wikidata":{"printouts":{"Start":[{"timestamp":"1560430800","raw":"1\/2019\/6\/13\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1560432600","raw":"1\/2019\/6\/13\/13\/30\/0\/0"}],"title":["Discovering Implicational Knowledge in Wikidata"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Maximilian Marx"],"Details":["Knowledge graphs have recently become the state-of-the-art tool for representing the diverse and complex knowledge of the world. Among the freely available knowledge graphs, Wikidata stands out by being collaboratively edited and curated. Amidst the vast numbers of facts, complex knowledge is just waiting to be discovered, but the sheer size of Wikidata makes this infeasible for human editors. We apply Formal Concept Analysis to efficiently identify and succinctly represent comprehensible implications that are implicitly present in the data. As a first step, we describe a systematic process to extract conceptual knowledge from Wikidata's complex data model, thus providing a method for obtaining large real-world data sets for FCA. We conduct experiments that show the principal feasibility of the approach, yet also illuminate some of the limitations, and give examples of interesting knowledge discovered.\n\n\nThis will be a rehearsal talk for ICFCA-2019 (20 minutes including questions)."]},"fulltext":"Discovering Implicational Knowledge in Wikidata","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Discovering_Implicational_Knowledge_in_Wikidata","namespace":0,"exists":"1","displaytitle":"Discovering Implicational Knowledge in Wikidata"},"Discrete Linear Dynamical Systems: The Introduction.":{"printouts":{"Start":[{"timestamp":"1683889200","raw":"1\/2023\/5\/12\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1683892800","raw":"1\/2023\/5\/12\/12\/0\/0\/0"}],"title":["Discrete Linear Dynamical Systems: The Introduction."],"Room":[{"fulltext":"APB room 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Rajab Aghamov"],"Details":["Abstract: Linear Dynamical systems are a fundamental modelling paradigm in many branches of science, and have been the subject of extensive research for many decades and are of profound interest, both from a theoretical and a practical standpoint. For example, reachability problems for linear dynamical systems attract attention due to their frequent occurrence in practice and their deep and wide-ranging connections with other fascinating areas of study, such as problems on Markov chains, quantum automata. In this presentation we are going to motivate the topic, give the basic definitions and will consider some famous problems.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus\n\nPlease take a note that the seminar will be held on Friday."]},"fulltext":"Discrete Linear Dynamical Systems: The Introduction.","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Discrete_Linear_Dynamical_Systems:_The_Introduction.","namespace":0,"exists":"1","displaytitle":"Discrete Linear Dynamical Systems: The Introduction."},"Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination":{"printouts":{"Start":[{"timestamp":"1690455600","raw":"1\/2023\/7\/27\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1690459200","raw":"1\/2023\/7\/27\/12\/0\/0\/0"}],"title":["Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Lukas Gerlach"],"Details":["Abstract: The disjunctive restricted chase is a sound and complete procedure for solving boolean conjunctive query entailment over knowledge bases of disjunctive existential rules. Alas, this procedure does not always terminate and checking if it does is undecidable. However, we can use acyclicity notions (sufficient conditions that imply termination) to effectively apply the chase in many real-world cases. To know if these conditions are as general as possible, we can use cyclicity notions (sufficient conditions that imply non-termination). In this paper, we discuss some issues with previously existing cyclicity notions, propose some novel notions for non-termination by dismantling the original idea, and empirically verify the generality of the new criteria.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Do_Repeat_Yourself:_Understanding_Sufficient_Conditions_for_Restricted_Chase_Non-Termination","namespace":0,"exists":"1","displaytitle":"Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination"},"Termination of the Skolem Chase on Disjunctive Existential Rules":{"printouts":{"Start":[{"timestamp":"1602162000","raw":"1\/2020\/10\/8\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1602167400","raw":"1\/2020\/10\/8\/14\/30\/0\/0"}],"title":["Don\u2019t Repeat Yourself: Termination of the Skolem Chase on Disjunctive Existential Rules"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Lukas Gerlach"],"Details":["Disjunctive Existential Rules are a fragment of first order logic that is already expressive enough to capture many description logics. Conjunctive Query answering is an important reasoning task over such rules. Although this problem is undecidable, different variants of the chase provide sound and complete algorithms that can be used as a reasoning basis. Since it is undecidable if these algorithms terminate for a specific rule set, sufficient conditions for termination, called acyclicity notions, are introduced. We develop Disjunctive Model Faithful Acyclicity (DMFA) as a novel acyclicity notion for the disjunctive skolem chase variant by using ideas from Model Faithful Acyclicity (MFA) for the non-disjunctive skolem chase and Restricted Model Faithful Acyclicity (RMFA) for the restricted chase. Our research shows that our notion captures MFA and is able give a better approximation for termination on disjunctive existential rules. Acyclicity notions for the restricted chase like RMFA still capture DMFA but these notions are not sound for the disjunctive skolem chase. Our results encourage the use of the disjunctive skolem chase in practical applications, which is implementable using well optimized ASP solvers.\n\n\nThis talk is a defence of the speakers \"Gro\u00dfer Beleg\".\nFurthermore it will be held online and take approximately 45 minutes which consist of an uninterrupted talk and a following question and answers part. If there is any interest in attending, please send an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"Termination of the Skolem Chase on Disjunctive Existential Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Termination_of_the_Skolem_Chase_on_Disjunctive_Existential_Rules","namespace":0,"exists":"1","displaytitle":"Don\u2019t Repeat Yourself: Termination of the Skolem Chase on Disjunctive Existential Rules"},"Dynamic Workflow Composition with OSLO-steps: Data Re-use and Simplification of Automated Administration":{"printouts":{"Start":[{"timestamp":"1643281200","raw":"1\/2022\/1\/27\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1643284800","raw":"1\/2022\/1\/27\/12\/0\/0\/0"}],"title":["Dynamic Workflow Composition with OSLO-steps: Data Re-use and Simplification of Automated Administration"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["D\u00f6rthe Arndt"],"Details":["e-Government applications have hard-coded and non-personalized user journeys with high maintenance costs to keep up with, e.g., changing legislation. Automatic administrative workflows are needed. We present the OSLO-steps vocabulary and the workflow composer: combined, they are a means to create cross-organizational interoperable user journeys, adapted to the user's needs. We identify the requirements for automating administrative workflows and present an architecture and its implemented components. By using Linked Data principles to decentrally describe independent steps using states as pre- and postconditions, and composing workflows on-the-fly whilst matching a user's state to those preconditions, we automatically generate next steps to reach the user's goal. The validated solution shows its feasibility, and the upcoming interest around interoperable personal data pods (e.g., via Solid) can further increase its potential.\nThe talk is about this paper: https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460210.3493559?casa_token=fT0Z86qmc-wAAAAA:bp0nt6XO3jXbZmFewjEWK5UlBvmzQv5xch8QAC_PTnz6LVQYGOQ7TSO-jEwxVehYA7eshdZc1wT-\n\nthe talk is online, link: \nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Dynamic Workflow Composition with OSLO-steps: Data Re-use and Simplification of Automated Administration","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Dynamic_Workflow_Composition_with_OSLO-steps:_Data_Re-use_and_Simplification_of_Automated_Administration","namespace":0,"exists":"1","displaytitle":"Dynamic Workflow Composition with OSLO-steps: Data Re-use and Simplification of Automated Administration"},"EMCL Student Workshop 2017":{"printouts":{"Start":[{"timestamp":"1487685600","raw":"1\/2017\/2\/21\/14\/0\/0\/0"}],"Ende":[{"timestamp":"1487851200","raw":"1\/2017\/2\/23\/12\/0\/0\/0"}],"title":["EMCL Student Workshop 2017"],"Room":[{"fulltext":"Lisbon","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Lisbon","namespace":0,"exists":"","displaytitle":""}],"Type":["sonstige Veranstaltung"],"Speaker":[],"Details":["The European Master Program in Computational Logic Student Workshop is an annual event that brings together students, alumni and professors from the four partner Universities. This year, the EMCL Student Workshop is taking place at the University NOVA in Lisbon, Portugal on the 21th and 22th of February 2017.\n\nAll EMCL and MCL students are invited to participate in the workshop. The workshop gives a perfect opportunity for the first year students to get direct information about the ongoing research at the partner universities, which should help them with their decision on where to spend the second year of the studies. As for the students of the second year, it provides a chance to present their current project or thesis work.\n\nFurther details: http:\/\/emclws.ssdi.di.fct.unl.pt\/workshop\/"]},"fulltext":"EMCL Student Workshop 2017","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/EMCL_Student_Workshop_2017","namespace":0,"exists":"1","displaytitle":"EMCL Student Workshop 2017"},"EMCL Student Workshop Summer 2010":{"printouts":{"Start":[{"timestamp":"1284024600","raw":"1\/2010\/9\/9\/9\/30\/0\/0"}],"Ende":[{"timestamp":"1284141600","raw":"1\/2010\/9\/10\/18\/0\/0\/0"}],"title":["EMCL Student Workshop Summer 2010"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["This student workshop will be held in Dresden, Germany on 9\/10 September 2010. It is organized by the International Center of Computational Logic (ICCL).\n\nThe workshop is co-located with the ICCL Summer School 2010 on Cognitive Science, Computational Logic and Connectionism. Those, who'd like to participate in both events, please note that there is no overlap of summer school courses and workshop presentations.\n\nFor questions related to the workshop, please contact Mr Fareed Arif."]},"fulltext":"EMCL Student Workshop Summer 2010","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/EMCL_Student_Workshop_Summer_2010","namespace":0,"exists":"1","displaytitle":"EMCL Student Workshop Summer 2010"},"EPCL PhD Workshop":{"printouts":{"Start":[{"timestamp":"1372672800","raw":"1\/2013\/7\/1\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1372874400","raw":"1\/2013\/7\/3\/18\/0\/0\/0"}],"title":["EPCL PhD Workshop"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["During the PhD workshop, members of each doctoral candidate's advisory board will be present to discuss, refine and, if needed, readjust the PhD projects. Other doctoral candidates, researches from the partner universities as well as staff from the associated partners may attend the PhD workshop.\n\nThe participation in the PhD workshop shall enhance the doctoral candidates' skills to define, implement, and successfully complete a research project. The PhD workshop is organized by the doctoral candidates themselves, thus developing and enhancing their skills to plan, organize, and run scientific events."]},"fulltext":"EPCL PhD Workshop","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/EPCL_PhD_Workshop","namespace":0,"exists":"1","displaytitle":"EPCL PhD Workshop"},"EPCL PhD Workshop 2012":{"printouts":{"Start":[{"timestamp":"1342000800","raw":"1\/2012\/7\/11\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1342202400","raw":"1\/2012\/7\/13\/18\/0\/0\/0"}],"title":["EPCL PhD Workshop 2012"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["During the PhD workshop, members of each doctoral candidate's advisory board will be present to discuss, refine and, if needed, readjust the PhD projects. Other doctoral candidates, researches from the partner universities as well as staff from the associated partners may attend the PhD workshop.\n\nThe participation in the PhD workshop shall enhance the doctoral candidates' skills to define, implement, and successfully complete a research project. The PhD workshop is organized by the doctoral candidates themselves, thus developing and enhancing their skills to plan, organize, and run scientific events."]},"fulltext":"EPCL PhD Workshop 2012","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/EPCL_PhD_Workshop_2012","namespace":0,"exists":"1","displaytitle":"EPCL PhD Workshop 2012"},"EPCL PhD Workshop 2014":{"printouts":{"Start":[{"timestamp":"1397469600","raw":"1\/2014\/4\/14\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1397757600","raw":"1\/2014\/4\/17\/18\/0\/0\/0"}],"title":["EPCL PhD Workshop 2014"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["The European PhD program in Computational Logic (EPCL) workshop is an annual workshop where lecturers from the partner universities (FUB, TUD, TUW, UNL) within EPCL as well as some guest researcher are invited to give research talks. In addition, the EPCL students present the progress in their thesis research."]},"fulltext":"EPCL PhD Workshop 2014","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/EPCL_PhD_Workshop_2014","namespace":0,"exists":"1","displaytitle":"EPCL PhD Workshop 2014"},"Efficient Dependency Analysis for Rule-Based Ontologies":{"printouts":{"Start":[{"timestamp":"1673521200","raw":"1\/2023\/1\/12\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1673524800","raw":"1\/2023\/1\/12\/12\/0\/0\/0"}],"title":["Efficient Dependency Analysis for Rule-Based Ontologies"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Alex Ivliev"],"Details":["Several types of dependencies have been proposed for the static analysis of existential rule ontologies, promising insights about computational properties and possible practical uses of a given set of rules, e.g., in ontology-based query answering. Unfortunately, these dependencies are rarely implemented, so their potential is hardly realised in practice. We focus on two kinds of rule dependencies - positive reliances and restraints - and design and implement optimised algorithms for their efficient computation. Experiments on real-world ontologies of up to more than 100,000 rules show the scalability of our approach, which lets us realise several previously proposed applications as practical case studies. In particular, we can analyse to what extent rule-based bottom-up approaches of reasoning can be guaranteed to yield redundancy-free \"lean\" knowledge graphs (so-called cores) on practical ontologies."]},"fulltext":"Efficient Dependency Analysis for Rule-Based Ontologies","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Efficient_Dependency_Analysis_for_Rule-Based_Ontologies","namespace":0,"exists":"1","displaytitle":"Efficient Dependency Analysis for Rule-Based Ontologies"},"Efficient Emulation of Datalog(S) in the Existential Rules Engine VLog":{"printouts":{"Start":[{"timestamp":"1656586800","raw":"1\/2022\/6\/30\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1656590400","raw":"1\/2022\/6\/30\/12\/0\/0\/0"}],"title":["Efficient Emulation of Datalog(S) in the Existential Rules Engine VLog"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Christian Lewe"],"Details":["We propose a translation of the expressive logic Datalog(S), a subset of Datalog^CV, into optimised existential rules. We look into applications of the language, in particular regarding description logic and graph theory, as well as into expressivity. We explain the translation from earlier work in detail, identify issues and propose solutions to increase performance. We explain the need for singularisation, propose partial congruence as an alternative and define criteria for when this handling is not necessary. Furthermore, we propose an alternative translation for which the standard chase universally terminates. To measure the impact of each optimisation, we conduct an empirical evaluation on real-world data.\n\nThe talk is a defence, with a hybrid attendance.\n\nlink: https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Efficient Emulation of Datalog(S) in the Existential Rules Engine VLog","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Efficient_Emulation_of_Datalog(S)_in_the_Existential_Rules_Engine_VLog","namespace":0,"exists":"1","displaytitle":"Efficient Emulation of Datalog(S) in the Existential Rules Engine VLog"},"Efficient Model Construction for Horn Logic with VLog":{"printouts":{"Start":[{"timestamp":"1527771600","raw":"1\/2018\/5\/31\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1527777000","raw":"1\/2018\/5\/31\/14\/30\/0\/0"}],"title":["Efficient Model Construction for Horn Logic with VLog"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Irina Dragoste"],"Details":["Abstract: \n\t\"We extend the Datalog engine VLog to develop a column-oriented\nimplementation of the skolem and the restricted chase \u2013 two variants of a sound\nand complete algorithm used for model construction over theories of existential\nrules. We conduct an extensive evaluation over several data-intensive theories\nwith millions of facts and thousands of rules, and show that VLog can compete\nwith the state of the art, regarding runtime, scalability, and memory efficiency.\"\n\nThis work was developed is a collaboration with Jacopo Urbani and Ceriel Jacobs from Vrije Universiteit Amsterdam. \nThe paper will be presented and published at IJCAR 2018. It is available at https:\/\/iccl.inf.tu-dresden.de\/web\/Article3046\/en."]},"fulltext":"Efficient Model Construction for Horn Logic with VLog","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Efficient_Model_Construction_for_Horn_Logic_with_VLog","namespace":0,"exists":"1","displaytitle":"Efficient Model Construction for Horn Logic with VLog"},"Efficient Model Construction for Horn Logic with VLog: Extended Abstract":{"printouts":{"Start":[{"timestamp":"1539262800","raw":"1\/2018\/10\/11\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1539268200","raw":"1\/2018\/10\/11\/14\/30\/0\/0"}],"title":["Efficient Model Construction for Horn Logic with VLog: Extended Abstract"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["David Carral"],"Details":["Abstract: \"We extend the Datalog engine VLog to develop a column-oriented implementation of the skolem and the restricted chase \u2013 two variants of a sound and complete algorithm used for model construction over theories of existential rules. We conduct an extensive evaluation over several data-intensive theories with millions of facts and thousands of rules, and show that VLog can compete with the state of the art, regarding runtime, scalability, and memory efficiency.\"\n\n\nThis is a rehearsal talk for the DL Workshop 2018."]},"fulltext":"Efficient Model Construction for Horn Logic with VLog: Extended Abstract","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Efficient_Model_Construction_for_Horn_Logic_with_VLog:_Extended_Abstract","namespace":0,"exists":"1","displaytitle":"Efficient Model Construction for Horn Logic with VLog: Extended Abstract"},"Efficiently Solving Unbounded Integer Programs in the context of SMT Solvers":{"printouts":{"Start":[{"timestamp":"1574416800","raw":"1\/2019\/11\/22\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1574422200","raw":"1\/2019\/11\/22\/11\/30\/0\/0"}],"title":["Efficiently Solving Unbounded Integer Programs in the context of SMT Solvers"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Martin Bromberger"],"Details":["'''Abstract:'''\nSatisfiability modulo theories (SMT) solvers are automated theorem provers for logical formulas that range over combinations of various first-order theories. These theories typically correspond to domains found in programming languages, e.g., the theories of bit vectors, integers, and arrays. This is intentional because SMT solvers were initially developed as back-end reasoning tools for automated software verification. These days, SMT solvers are also used as back-end reasoning tools for various other applications, e.g., verification of hybrid systems, program synthesis, and as brute-force tactics in various interactive theorem provers.\n\nIn this talk, I will present two new techniques for the theory of linear integer arithmetic in the context of SMT solvers:\n\n1) The unit cube test [2,3], a sound (although incomplete) test that finds solutions for integer programs(i.e., systems of linear inequalities) in polynomial time. The test is especially efficient on absolutely unbounded integer programs, which are difficult to handle for many other decision procedures.\n\n2) A bounding transformation [1] that reduces any integer program in polynomial time to an equisatisfiable integer program that is bounded. The transformation is beneficial because it turns branch and bound into a complete and efficient decision procedure for integer programs.\n\n'''References:'''\n\n[1] A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems, Martin Bromberger. IJCAR 2018, volume 10900 of LNCS, pages 329\u2013345. Springer, 2018.\n\n[2] New Techniques for Linear Arithmetic: Cubes and Equalities, Martin Bromberger, and Christoph Weidenbach. In FMSD volume 51(3), pages 433\u2013461. Springer, 2017.\n\n[3] Fast Cube Tests for LIA Constraint Solving, Martin Bromberger, and Christoph Weidenbach. In IJCAR 2016, volume 9706 of LNCS, pages 116\u2013132. Springer, 2016."]},"fulltext":"Efficiently Solving Unbounded Integer Programs in the context of SMT Solvers","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Efficiently_Solving_Unbounded_Integer_Programs_in_the_context_of_SMT_Solvers","namespace":0,"exists":"1","displaytitle":"Efficiently Solving Unbounded Integer Programs in the context of SMT Solvers"},"Embodied Terminology: Language, Knowledge, and Cognition":{"printouts":{"Start":[{"timestamp":"1544101200","raw":"1\/2018\/12\/6\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1544106600","raw":"1\/2018\/12\/6\/14\/30\/0\/0"}],"title":["Embodied Terminology: Language, Knowledge, and Cognition"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Dagmar Gromann"],"Details":["'''Abstract:''' Meaning formation in specialized language is yet an open puzzle to be solved and several methods have been proposed to piece it together. This talk looks to the paradigm of embodied cognition for such a method, which believes that cognitive processes, including language production and understanding, are deeply rooted in physical interactions with the world. More specifically it looks at image schemas that capture recurrent sensorimotor patterns giving coherence and structure to our experiences and shaping our language and knowledge. Potential theoretical contributions of embodied cognition to the meaning formation in specialized languages are discussed alongside automated methods for the identification of image schemas in natural languages. A coherent, robust, and language agnostic theory of and method for embodied terminology holds the promise to boost socio-economically effective, cognitively grounded, and technologically powerful terminology management and translation technologies. \n\n\n'''Title of the lecture:''' Translatorische Terminologiewissenschaft und \u00dcbersetzungstechnologien (German)\n\n'''Lecture description:''' This demonstration lesson will be held in German since this is required for the hearing and will represent the second lesson of the Master-level lecture on translational terminology science and translation technologies. Technologies of specialized communication will be discussed with a particular focus on multilingual, systematic, and onomasiological terminology management.\n\n'''Details:''' Appointment training: this '''research talk''' and the following '''demonstration lesson''' represent a trial run for a hearing within the application procedure for a '''tenure-track professorship''' for terminology science and translation technologies. Please join and ask many challenging questions."]},"fulltext":"Embodied Terminology: Language, Knowledge, and Cognition","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Embodied_Terminology:_Language,_Knowledge,_and_Cognition","namespace":0,"exists":"1","displaytitle":"Embodied Terminology: Language, Knowledge, and Cognition"},"Employing DL-Lite reasoners for fuzzy query answering: Take a FLite!":{"printouts":{"Start":[{"timestamp":"1422631800","raw":"1\/2015\/1\/30\/15\/30\/0\/0"}],"Ende":[{"timestamp":"1422635400","raw":"1\/2015\/1\/30\/16\/30\/0\/0"}],"title":["Employing DL-Lite reasoners for fuzzy query answering: Take a FLite!"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Theofilos Mailis"],"Details":["Fuzzy Description Logics generalize crisp ones by providing membership degree semantics for concepts and roles by fuzzy sets. Recently, answering of conjunctive queries has been investigated and implemented in optimized reasoner systems based on the rewriting approach for crisp DLs. In this talk we investigate how to employ such existing implementations for query answering in DL-Lite_R over fuzzy ontologies. To this end we give an extended rewriting algorithm for the case of fuzzy DL-Lite_R-ABoxes that employs the one for crisp DL-Lite_R and investigate the limitations of this approach. We also tested the performance of our proto-type implementation FLite of this method."]},"fulltext":"Employing DL-Lite reasoners for fuzzy query answering: Take a FLite!","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Employing_DL-Lite_reasoners_for_fuzzy_query_answering:_Take_a_FLite!","namespace":0,"exists":"1","displaytitle":"Employing DL-Lite reasoners for fuzzy query answering: Take a FLite!"},"Enabling Fine-grained RDF Data Completeness Assessment":{"printouts":{"Start":[{"timestamp":"1455802200","raw":"1\/2016\/2\/18\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1455805800","raw":"1\/2016\/2\/18\/14\/30\/0\/0"}],"title":["Enabling Fine-grained RDF Data Completeness Assessment"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Fariz Darari"],"Details":["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]."]},"fulltext":"Enabling Fine-grained RDF Data Completeness Assessment","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Enabling_Fine-grained_RDF_Data_Completeness_Assessment","namespace":0,"exists":"1","displaytitle":"Enabling Fine-grained RDF Data Completeness Assessment"},"Ensuring Soundness for SPARQL with Negation Using Completeness Statements":{"printouts":{"Start":[{"timestamp":"1461768600","raw":"1\/2016\/4\/27\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1461772200","raw":"1\/2016\/4\/27\/15\/50\/0\/0"}],"title":["Ensuring Soundness for SPARQL with Negation Using Completeness Statements"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Fariz Darari"],"Details":["As RDF generally follows the Open-World Assumption, the use of negation in SPARQL queries might lead to unsound answers. Completeness statements have been proposed as metadata specifying that certain kinds of information are entirely recorded in an RDF data set. In this work, we leverage completeness statements to check whether we can guarantee soundness of query answering even when negation is used in SPARQL. We distinguish between the soundness of a specific answer of a graph pattern and the soundness of a graph pattern as a whole. We provide a formalization and characterize the problem of soundness checking via reduction to completeness checking. We also conduct an experimental evaluation to demonstrate the feasibility of our framework."]},"fulltext":"Ensuring Soundness for SPARQL with Negation Using Completeness Statements","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Ensuring_Soundness_for_SPARQL_with_Negation_Using_Completeness_Statements","namespace":0,"exists":"1","displaytitle":"Ensuring Soundness for SPARQL with Negation Using Completeness Statements"},"Enterprise Management in the Presence of Data":{"printouts":{"Start":[{"timestamp":"1622120400","raw":"1\/2021\/5\/27\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1622125800","raw":"1\/2021\/5\/27\/14\/30\/0\/0"}],"title":["Enterprise Management in the Presence of Data"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Evellin Cardoso"],"Details":["This presentation discusses the two research lines of my work, namely Enterprise Modelling and Knowledge Representation, and their synergies. In the first line, my PhD work has been structured around understanding, clarifying and making use of the interconnections between the enterprise motivational and behavioural ontologies in Enterprise Computing. My research questions addressed the investigation of the suitable abstractions for the specification of motivational and behavioural concepts and their interconnections to allow synchronized movements between both structures. With the advent of Big data, I became interested in combining such enterprise ontologies with data. My postdoctoral work uses the Ontology Based Data Access (OBDA) paradigm from Semantic Web to connect elements from the behavioural ontology with timestamped relational data sources. This approach allows business users to gain insights from data, by allowing the reconstruction and querying of the state of behavioural elements using ontology as an intermediate layer in a vocabulary which is close to business users.\n\n\nShort Bio: Evellin Cardoso is currently a Post-Doctoral fellow at the KRDB Research Centre for Knowledge and Data, at Free University of Bolzano working in the field of Process Mining, Artificial Intelligence and Databases. She holds a PhD in Computer Science from University of Trento, where she worked in the field of Information Systems, more specifically Enterprises Architectures.\n\n\nThis talk will take place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=115791&p=68e311bf\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=115791&p=37e2d8b6"]},"fulltext":"Enterprise Management in the Presence of Data","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Enterprise_Management_in_the_Presence_of_Data","namespace":0,"exists":"1","displaytitle":"Enterprise Management in the Presence of Data"},"Epistemic Answer Set Programming":{"printouts":{"Start":[{"timestamp":"1562850000","raw":"1\/2019\/7\/11\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1562855400","raw":"1\/2019\/7\/11\/14\/30\/0\/0"}],"title":["Epistemic Answer Set Programming"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Ezgi Iraz Su"],"Details":["Today it is widely accepted by the logic programming community that answer set programming (ASP) requires a more powerful introspective reasoning with the use of modalities. Although there has been a long-lasting debate among researchers about how to correctly extend ASP with epistemic modal operators, there is still no agreement on a fully satisfactory semantics that is able to offer intuitive results for epistemic logic programs. In this talk, we introduce a recent epistemic extension of ASP called epistemic ASP (EASP), endowed with the epistemic answer set semantics: minimal (with respect to truth) models which are maximal under two different orderings that minimise knowledge. Then we compare EASP with existing successful (to some extent) approaches in the literature, showing the advantages and the novelties of the new semantics: compared to Gelfond's epistemic specifications (ES), EASP defines a sufficiently strong language of a simpler syntactic character. Its semantics through a minimality criterion with respect to truth and knowledge is a natural and conservative generalisation of ASP's original answer set semantics. Moreover, compared to all other semantics proposals for ES, the epistemic answer set semantics provides a comprehensive solution to unintended results for epistemic logic programs including constraints. Finally, we briefly discuss some formal properties of EASP such as epistemic splitting, strong equivalence and foundedness. \n\n\n'''Speaker info:''' Ezgi Iraz Su, IRIT (Lilac), Universit\u00e9 de Toulouse 3 (Universit\u00e9 Paul Sabatier)"]},"fulltext":"Epistemic Answer Set Programming","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Epistemic_Answer_Set_Programming","namespace":0,"exists":"1","displaytitle":"Epistemic Answer Set Programming"},"Seminar 18.03.2021":{"printouts":{"Start":[{"timestamp":"1616072400","raw":"1\/2021\/3\/18\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1616077800","raw":"1\/2021\/3\/18\/14\/30\/0\/0"}],"title":["Evaluating the Generality of Disjunctive Model Faithful Acyclicity on OWL ontologies"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Lukas Gerlach"],"Details":["The chase is a well-studied, sound and complete algorithm that is used in different variants as a basis for reasoning tasks over (disjunctive) existential rules. Since termination of the chase is undecidable, acyclicity notions, i.e. sufficient conditions for termination, like model faithful acyclicity (MFA) for the skolem chase and restricted model faithful acyclicity (RMFA) for the restricted chase are introduced. The recently developed acyclicity notion disjunctive model faithful acyclicity (DMFA) for the disjunctive skolem chase promises improvements for detecting termination over existing notions like MFA in theory. We further know that RMFA captures DFMA while RMFA itself is not sound for the disjunctive skolem chase. We evaluate the generality of DMFA in practice compared to MFA and RMFA on rule sets that we obtain from real-world OWL ontologies in the Oxford ontology repository (OXFD) and the dataset of the OWL reasoner evaluation 2015 (ORE15). Our results show that DMFA achieves practical improvements over MFA that narrow the gap towards RMFA. Our findings motivate further research regarding the disjunctive skolem chase in general and the development of sufficient conditions for non-termination of the disjunctive skolem chase in particular.\n\n\nNote that this talk acts as a colloquium\/examination for the module INF-PM-FPG. It will take place online via BigBlueButton. To access the room, take one of the following links: \n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=86967&p=b14dca92\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=86967&p=00922683"]},"fulltext":"Seminar 18.03.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_18.03.2021","namespace":0,"exists":"1","displaytitle":"Evaluating the Generality of Disjunctive Model Faithful Acyclicity on OWL ontologies"},"Explaining Answer Sets using Argumentation Theory":{"printouts":{"Start":[{"timestamp":"1417186800","raw":"1\/2014\/11\/28\/15\/0\/0\/0"}],"Ende":[{"timestamp":"1417190400","raw":"1\/2014\/11\/28\/16\/0\/0\/0"}],"title":["Explaining Answer Sets using Argumentation Theory"],"Room":[{"fulltext":"APB 0005","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_0005","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Claudia Schulz"],"Details":["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.\n\n\nIn 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."]},"fulltext":"Explaining Answer Sets using Argumentation Theory","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Explaining_Answer_Sets_using_Argumentation_Theory","namespace":0,"exists":"1","displaytitle":"Explaining Answer Sets using Argumentation Theory"},"Explaining neural network reasoning":{"printouts":{"Start":[{"timestamp":"1457011800","raw":"1\/2016\/3\/3\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1457015400","raw":"1\/2016\/3\/3\/14\/30\/0\/0"}],"title":["Explaining neural network reasoning"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Walter Forkel"],"Details":["Neural networks are in heavy use everywhere in artificial intelligence today. They produce state of the art results in many different domains. Still the lack of comprehensibility of neural networks makes them difficult to use in certain domains where human understandable explanations are needed. In this talk we present different approaches on how to automatically generate explanations of the neural networks reasoning."]},"fulltext":"Explaining neural network reasoning","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Explaining_neural_network_reasoning","namespace":0,"exists":"1","displaytitle":"Explaining neural network reasoning"},"Seminar 23.09.2021":{"printouts":{"Start":[{"timestamp":"1632402000","raw":"1\/2021\/9\/23\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1632407400","raw":"1\/2021\/9\/23\/14\/30\/0\/0"}],"title":["Exploiting Treewidth for Counting in Abstract Argumentation"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Piotr Gorczyca"],"Details":["Abstract argumentation and Dung\u2019s framework is popular for modeling and evaluating arguments in artificial intelligence. Recently, counting problems in abstract argumentation became of increasing interest visible by the 2021 ICCMA competition, which asked to solve counting problems despite the high computational complexity. In this paper, we consider various counting problems in abstract argumentation under practical aspects. We revisit previous theoretical algorithms, present formulations in relational algebra, and an implementation employing the DPDB framework for solving problems using dynamic programming on tree decompositions. Thereby, we establish an implementation for counting extensions of abstract argumentation frameworks under admissible, stable, and complete semantics. We provide a thorough empirical evaluation that also incorporates less known approaches to solve counting questions in argumentation. Finally, we show that our approach can be particularly well suited for instances of low treewidth and is quite useful in a portfolio-based solving approach.\n\n\nThis is a project presentation and with an approximate duration of 30 minutes and a 15 minutes Q&A session. It will be given online via BigBlueButton. To access the room, use one of the following links:\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=147897&p=76c02e6b\n\nwithout ZIH-login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=147897&p=05cc674a"]},"fulltext":"Seminar 23.09.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_23.09.2021","namespace":0,"exists":"1","displaytitle":"Exploiting Treewidth for Counting in Abstract Argumentation"},"Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment":{"printouts":{"Start":[{"timestamp":"1620306000","raw":"1\/2021\/5\/6\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1620311400","raw":"1\/2021\/5\/6\/14\/30\/0\/0"}],"title":["Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["We study the complexity of two standard reasoning problems for Forward Guarded Logic (FGF), obtained as a restriction of the Guarded Fragment in which variables appear in atoms in a specific order. We show that FGF enjoys the higher-arity-forest-model property, which results in ExpTime-completeness of its (finite) knowledge-base satisfiability problem. Moreover, we show that FGF is well-suited for knowledge representation. By employing a generalisation of the spoiler technique, we prove that the conjunctive query entailment problem for FGF remains in ExpTime. We believe that our results are quite unusual as FGF is, up to our knowledge, the first decidable fragment of First-Order Logic, extending standard description logics, that offers unboundedly many variables and higher-arity relations while keeping its complexity surprisingly low.\n\n\nThis talk is based on an accepted paper submission to JELIA 2021 and will take approximately 30 minutes. It will take place online via BigBlueButton. To access the room, take one of the following links: \n\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=86974&p=57992a96\n\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=86974&p=f38fa613"]},"fulltext":"Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Exploiting_forwardness:_Satisfiability_and_Query-Entailment_in_Forward_Guarded_Fragment","namespace":0,"exists":"1","displaytitle":"Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment"},"Explorations into Belief State Compression":{"printouts":{"Start":[{"timestamp":"1559050200","raw":"1\/2019\/5\/28\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1559053800","raw":"1\/2019\/5\/28\/14\/30\/0\/0"}],"title":["Explorations into Belief State Compression"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Ali Elhalawaty"],"Details":["A knowledge base is an integral part of a logic-based artificial intelligence system. The size of the knowledge base has a great effect on the derivation time of a logic-based agent. In this thesis, I present a variety of algorithms for a particular variant of knowledge base size reduction referred to as \u201cBelief State Compression\u201d. Each proposed algorithm can be \u201clossy\u201d or \u201clossless\u201d depending on the (in)ability to recover the removed information; and \u201credundant\u201d or \u201cirredundant\u201d with respect to the necessity of the remaining information in order to remain lossless. Belief state compression differs from previous approaches in at least three aspects. First, it takes its objects to be support-structured sets of unconstrained, rather than flat sets of syntactically constrained, logical formulas, which we refer to as belief states. Second, classical notions of minimality and redundancy are replaced by weaker, resource-bounded alternatives based on the support structure. Third, in \u201clossy\u201d variants of compression, the compressed knowledge base logically implies only a practically-relevant subset of the original knowledge base. Six variants of belief state compression, falling into three major classes, are presented. Experimental results show that a combination of five of them results in mostly irredundant, lossless compressions, while maintaining reasonable run times."]},"fulltext":"Explorations into Belief State Compression","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Explorations_into_Belief_State_Compression","namespace":0,"exists":"1","displaytitle":"Explorations into Belief State Compression"},"Expressivity of Planning with Horn Description Logic Ontologies":{"printouts":{"Start":[{"timestamp":"1651143600","raw":"1\/2022\/4\/28\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1651147200","raw":"1\/2022\/4\/28\/12\/0\/0\/0"}],"title":["Expressivity of Planning with Horn Description Logic Ontologies"],"Room":[{"fulltext":"Https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Stefan Borgwardt"],"Details":["State constraints in AI Planning globally restrict the legal environment states. Standard planning languages make closed-domain and closed-world assumptions. Here we address open-world state constraints formalized by planning over a description logic (DL) ontology. Previously, this combination of DL and planning has been investigated for the light-weight DL DL-Lite. Here we propose a novel compilation scheme into standard PDDL with derived predicates, which applies to more expressive DLs and is based on the rewritability of DL queries into Datalog with stratified negation. We also provide a new rewritability result for the DL Horn-ALCHOIQ, which allows us to apply our compilation scheme to quite expressive ontologies. In contrast, we show that in the slight extension Horn-SROIQ no such compilation is possible unless the weak exponential hierarchy collapses. Finally, we show that our approach can outperform previous work on existing benchmarks for planning with DL ontologies, and is feasible on new benchmarks taking advantage of more expressive ontologies.\n\nThis talk is about joint work with J\u00f6rg Hoffmann, Alisa Kovtunova, [[Markus Kr\u00f6tzsch]], Bernhard Nebel, and Marcel Steinmetz. It has been presented at the [https:\/\/aaai.org\/Conferences\/AAAI-22\/ AAAI conference] 2022.\n\nAccess the [https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n BBB Room] for the seminar room on April 28, 11am."]},"fulltext":"Expressivity of Planning with Horn Description Logic Ontologies","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Expressivity_of_Planning_with_Horn_Description_Logic_Ontologies","namespace":0,"exists":"1","displaytitle":"Expressivity of Planning with Horn Description Logic Ontologies"},"Extending Datalog with Sets Using an Encoding in Existential Rules":{"printouts":{"Start":[{"timestamp":"1543237200","raw":"1\/2018\/11\/26\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1543242600","raw":"1\/2018\/11\/26\/14\/30\/0\/0"}],"title":["Extending Datalog with Sets Using an Encoding in Existential Rules"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Christian Lewe"],"Details":["We extend Datalog with sets, in order to facilitate modelling with this logic, and define the resulting, extended logic. To allow practical reasoning over this logic, we show a translation algorithm into first-order logic and prove its correctness. Furthermore, we show that this translation exhibits optimal runtimes during the restricted chase, compared to Datalog, which means that reasoning over the extended logic is practically viable. Lastly, we explore possible applications of this logic in practice.\n\n\nThis presentation and the subsequent question session constitute a defence for acquiring a Bachelor of Science degree in computer science."]},"fulltext":"Extending Datalog with Sets Using an Encoding in Existential Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Extending_Datalog_with_Sets_Using_an_Encoding_in_Existential_Rules","namespace":0,"exists":"1","displaytitle":"Extending Datalog with Sets Using an Encoding in Existential Rules"},"Extending EL++ with Linear Constraints on the Probability of Axioms":{"printouts":{"Start":[{"timestamp":"1563888600","raw":"1\/2019\/7\/23\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1563894000","raw":"1\/2019\/7\/23\/15\/0\/0\/0"}],"title":["Extending EL++ with Linear Constraints on the Probability of Axioms"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Marcelo Finger"],"Details":["'''Abstract:''' One of the main reasons to employ a description logic such as EL++ is the fact that it has efficient, polynomial-time algorithmic properties such as deciding consistency and inferring subsumption. However, simply by adding negation of concepts to it, we obtain the expressivity of description logics whose decision procedure is ExpTime-complete. Similar complexity explosion occurs if we add probability assignments on concepts. To lower the resulting complexity, we instead concentrate on assigning probabilities to Axioms\/GCIs. We show that the consistency detection problem for such a probabilistic description logic is NP-complete, and present a linear algebraic deterministic algorithm to solve it, using the column generation technique. We also examine algorithms for the probabilistic extension problem, which consists of inferring the minimum and maximum probabilities for a new axiom, given a consistent probabilistic knowledge base. \n\n\nFuture work aims at finding fragments of probabilistic EL++ which are tractable."]},"fulltext":"Extending EL++ with Linear Constraints on the Probability of Axioms","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Extending_EL%2B%2B_with_Linear_Constraints_on_the_Probability_of_Axioms","namespace":0,"exists":"1","displaytitle":"Extending EL++ with Linear Constraints on the Probability of Axioms"},"Extending Matching in Description Logics":{"printouts":{"Start":[{"timestamp":"1538053200","raw":"1\/2018\/9\/27\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1538058600","raw":"1\/2018\/9\/27\/14\/30\/0\/0"}],"title":["Extending Matching in Description Logics"],"Room":[{"fulltext":"APB 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Pavlos Marantidis"],"Details":["Matching concept descriptions against concept patterns was introduced as a non-standard inference task in Description Logics motivated by applications in knowledge bases. It was first investigated for the DL FL0, for which a polynomial-time algorithm was obtained. In this talk, we will present recent results that extend matching in FL0 in two aspects. Initially, we investigate approximate matching, that increases the recall of the method by checking whether the input description and pattern can \u201calmost\u201d match, rather than become equivalent. The meaning of almost is formalised using distance measures between concepts. Afterwards, we examine matching in the presence of TBoxes, i.e., background knowledge of concept inclusions. It is well-known that subsumption reasoning in FL0 rises from P to ExpTime when TBoxes are considered, and we prove that the same is true for matching. Finally, we present some preliminary ideas on approximate matching in the presence of TBoxes."]},"fulltext":"Extending Matching in Description Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Extending_Matching_in_Description_Logics","namespace":0,"exists":"1","displaytitle":"Extending Matching in Description Logics"},"Faceted Answer-Set Navigation":{"printouts":{"Start":[{"timestamp":"1536238800","raw":"1\/2018\/9\/6\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1536244200","raw":"1\/2018\/9\/6\/14\/30\/0\/0"}],"title":["Faceted Answer-Set Navigation"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Christian Al-Rabbaa"],"Details":["Abstract: Even for small logic programs, the number of resulting answer-sets can be tremendous. In such cases, users might be incapable of comprehending the space of answer-sets as a whole nor being able to identify a specific answer-set according to their needs. To overcome this difficulty, we propose a general formal framework that takes an arbitrary logic program as input, and allows for navigating the space of answer-sets in a systematic interactive way analogous to faceted browsing. The navigation is carried out stepwise, where each step narrows down the remaining solutions, eventually arriving at a single one. We formulate two navigation modes, one stringent conflict avoiding, and a \u201cfree\u201d mode, where conflicting selections of facets might occur. For the latter mode, we provide efficient algorithms for resolving the conflicts. We provide an implementation of our approach and demonstrate that our framework is able to handle logic programs for which it is currently infeasible to retrieve all answer sets.\n\n\nThis is joint work with Sebastian Rudolph and Lukas Schweizer, to appear in the Proceedings of the 2nd International Joint Conference on Rules and Reasoning, 2018."]},"fulltext":"Faceted Answer-Set Navigation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Faceted_Answer-Set_Navigation","namespace":0,"exists":"1","displaytitle":"Faceted Answer-Set Navigation"},"Ighting my Proof Anxiety with Lean - The Restricted Chase Indeed Yields Universal Models":{"printouts":{"Start":[{"timestamp":"1713438000","raw":"1\/2024\/4\/18\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1713441600","raw":"1\/2024\/4\/18\/12\/0\/0\/0"}],"title":["Fighting my Proof Anxiety with Lean - The Restricted Chase Indeed Yields Universal Models"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Lukas Gerlach"],"Details":["The restricted chase is a fundamental reasoning algorithm in database theory that can be used for (conjunctive) query answering. For a given pair of a set of existential rules and a database, the restricted chase yields a so-called universal model. Such a model can be embedded into every (other) model and therefore be used for query answering.\nWe present a formalization of the restricted chase in the interactive theorem proving language \"Lean\" including a (well-known) proof that the chase indeed yields a universal model. We shine a light on key parts of the formalization and discuss lessons learned in the process."]},"fulltext":"Ighting my Proof Anxiety with Lean - The Restricted Chase Indeed Yields Universal Models","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Ighting_my_Proof_Anxiety_with_Lean_-_The_Restricted_Chase_Indeed_Yields_Universal_Models","namespace":0,"exists":"1","displaytitle":"Fighting my Proof Anxiety with Lean - The Restricted Chase Indeed Yields Universal Models"},"Finding p-indecomposable Functions":{"printouts":{"Start":[{"timestamp":"1433170200","raw":"1\/2015\/6\/1\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1433173800","raw":"1\/2015\/6\/1\/15\/50\/0\/0"}],"title":["Finding p-indecomposable Functions"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Artem Revenko"],"Details":["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."]},"fulltext":"Finding p-indecomposable Functions","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Finding_p-indecomposable_Functions","namespace":0,"exists":"1","displaytitle":"Finding p-indecomposable Functions"},"Finite Base Contraction and Expansion via Models - The ALC case":{"printouts":{"Start":[{"timestamp":"1662634800","raw":"1\/2022\/9\/8\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1662638400","raw":"1\/2022\/9\/8\/12\/0\/0\/0"}],"title":["Finite Base Contraction and Expansion via Models - The ALC case"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Ana Ozaki"],"Details":["We propose a new paradigm for Belief Change in which the new information is represented as sets of models, while the agent\u2019s body of knowledge is represented as a finite set of formulae, that is, a finite base. The focus on finiteness is crucial\nwhen we consider limited agents and reasoning algorithms. Moreover, having the input as arbitrary set of models is more general than the usual treatment of formulae as input. In this setting, we define new Belief Change operations akin to traditional expansion and contraction, and we identify the rationality postulates that emerge due to the finite representability requirement. We also analyse different logics concerning compatibility with our framework. In this talk, I will focus on the ALC description logic.\n\nThe talk will take place in a hybrid fashion, physically in the seminar room, and online through the link:\n\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Finite Base Contraction and Expansion via Models - The ALC case","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Finite_Base_Contraction_and_Expansion_via_Models_-_The_ALC_case","namespace":0,"exists":"1","displaytitle":"Finite Base Contraction and Expansion via Models - The ALC case"},"Finite Groundings for ASP with Functions: A Journey through Consistency":{"printouts":{"Start":[{"timestamp":"1720695600","raw":"1\/2024\/7\/11\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1720699200","raw":"1\/2024\/7\/11\/12\/0\/0\/0"}],"title":["Finite Groundings for ASP with Functions: A Journey through Consistency"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Lukas Gerlach"],"Details":["Answer set programming (ASP) is a logic programming formalism used in various areas of artificial intelligence like combinatorial problem solving and knowledge representation and reasoning. It is known that enhancing ASP with function symbols makes basic reasoning problems highly undecidable. However, even in simple cases, state of the art reasoners, specifically those relying on a ground-and-solve approach, fail to produce a result. Therefore, we reconsider consistency as a basic reasoning problem for ASP. We show reductions that give an intuition for the high level of undecidability. These insights allow for a more fine-grained analysis where we characterize ASP programs as \"frugal\" and \"non-proliferous\". For such programs, we are not only able to semi-decide consistency but we also propose a grounding procedure that yields finite groundings on more ASP programs with the concept of \"forbidden\" facts."]},"fulltext":"Finite Groundings for ASP with Functions: A Journey through Consistency","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Finite_Groundings_for_ASP_with_Functions:_A_Journey_through_Consistency","namespace":0,"exists":"1","displaytitle":"Finite Groundings for ASP with Functions: A Journey through Consistency"},"Seminar 17.06.2021":{"printouts":{"Start":[{"timestamp":"1623934800","raw":"1\/2021\/6\/17\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1623938400","raw":"1\/2021\/6\/17\/14\/0\/0\/0"}],"title":["Finite Model Theory of the Triguarded Fragment and Related Logics"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Sebastian Rudolph"],"Details":["The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a tight doubly exponential bound on the model size) and hence finite satisfiability coincides with satisfiability known to be N2ExpTime-complete. Using similar constructions, we also establish 2ExpTime-completeness for finite satisfiability of the constant-free (tri)guarded fragment with transitive guards.\n\n\nThis talk will take place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login: \n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=128248&p=fac3a576\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=128248&p=9f228a78"]},"fulltext":"Seminar 17.06.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_17.06.2021","namespace":0,"exists":"1","displaytitle":"Finite Model Theory of the Triguarded Fragment and Related Logics"},"Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying":{"printouts":{"Start":[{"timestamp":"1667473200","raw":"1\/2022\/11\/3\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1664798400","raw":"1\/2022\/10\/3\/12\/0\/0\/0"}],"title":["Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Thomas Feller"],"Details":["In our pursuit of generic criteria for decidable ontology-based querying, we introduce 'finite-cliquewidth sets' (FCS) of existential rules, a model-theoretically defined class of rule sets, inspired by the cliquewidth measure from graph theory. By a generic argument, we show that FCS ensures decidability of entailment for a sizable class of queries (dubbed 'DaMSOQs') subsuming conjunctive queries (CQs). The FCS class properly generalizes the class of finite-expansion sets (FES), and for signatures of arity at most 2, the class of bounded-treewidth sets (BTS). For higher arities, BTS is only indirectly subsumed by FCS by means of reification. Despite the generality of FCS, we provide a rule set with decidable CQ entailment (by virtue of first-order-rewritability) that falls outside FCS, thus demonstrating the incomparability of FCS and the class of finite-unification sets (FUS). In spite of this, we show that if we restrict ourselves to single-headed rule sets over signatures of arity at most 2, then FCS subsumes FUS."]},"fulltext":"Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Finite-Cliquewidth_Sets_of_Existential_Rules:_Toward_a_General_Criterion_for_Decidable_yet_Highly_Expressive_Querying","namespace":0,"exists":"1","displaytitle":"Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying"},"Fixed Domain Reasoning for Description Logics":{"printouts":{"Start":[{"timestamp":"1461163800","raw":"1\/2016\/4\/20\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1461166200","raw":"1\/2016\/4\/20\/15\/30\/0\/0"}],"title":["Fixed-Domain Reasoning for Description Logics"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Lukas Schweizer"],"Details":["Description logics (DLs) are currently a de facto standard in logic-based knowledge representation thanks to the last two decades of research and their use as the underpinning of standardized and widely adopted web ontology language (OWL), which also comes with the ad- vantage of existing user-friendly modeling tools. It has, however, been observed that OWL and description logics (DLs) are utilized by logically less skilled practitioners as constraint languages adopting a closed-world assumption, contrary to the open world semantics imposed by the clas- sical definitions and the standards. Therefore, we came up with an al- ternative formal semantics reflecting this \u201coff-label use\u201d of these widely adopted formalisms. To that end, we introduce the fixed domain seman- tics and discuss that this semantics gives rise to the interesting new inferencing task of model enumeration. We describe how the new seman- tics can be axiomatized in very expressive DLs. We thoroughly investi- gate the complexities for standard reasoning as well as query answering for a wide range of DLs. We present an implementation of a fixed do- main DL reasoner based on the translation into answer set programming (ASP) and provide first results that this tool is superior to alternative approaches when used on constraint-satisfaction-type problems."]},"fulltext":"Fixed Domain Reasoning for Description Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Fixed_Domain_Reasoning_for_Description_Logics","namespace":0,"exists":"1","displaytitle":"Fixed-Domain Reasoning for Description Logics"},"Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation":{"printouts":{"Start":[{"timestamp":"1637233200","raw":"1\/2021\/11\/18\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1637236800","raw":"1\/2021\/11\/18\/12\/0\/0\/0"}],"title":["Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Martin Diller"],"Details":["Assumption-based argumentation (ABA) is one of the main general frameworks for structured argumentation. Dispute derivations for ABA allow for evaluating claims in a dialectical manner: i.e. on the basis of an exchange of arguments and counter-arguments for a claim between a proponent and an opponent of the claim. Current versions of dispute derivations are geared towards determining (credulous) acceptance of claims w.r.t. the admissibility-based semantics that ABA inherits from abstract argumentation. Relatedly, they make use of backwards or top down reasoning for constructing arguments. In this work we define flexible dispute derivations with forward as well as backward reasoning allowing us, in particular, to also have dispute derivations for finding admissible, complete, and stable assumption sets rather than only determine acceptability of claims. We give an argumentation-based definition of such dispute derivations and a more implementation friendly alternative representation in which disputes involve exchange of claims and rules rather than arguments. These can be seen as elaborations on, in particular, existing graph-based dispute derivations on two fronts: first, in also allowing for forward reasoning; second, in that all arguments put forward in the dispute are represented by a graph and not only the proponents.\nor check:\nhttps:\/\/link.springer.com\/chapter\/10.1007\/978-3-030-89391-0_9\n\nThe talk is online, the room link for the talk:\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Flexible_Dispute_Derivations_with_Forward_and_Backward_Arguments_for_Assumption-Based_Argumentation","namespace":0,"exists":"1","displaytitle":"Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation"},"Seminar 08.07.2021":{"printouts":{"Start":[{"timestamp":"1625749200","raw":"1\/2021\/7\/8\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1625754600","raw":"1\/2021\/7\/8\/14\/30\/0\/0"}],"title":["Fluted Logic with Counting"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Ian Pratt-Hartmann"],"Details":["The fluted fragment is a fragment of first-order logic in which the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. It is known that the fluted fragment possesses the finite model property. In this talk, we extend the fluted fragment by the addition of counting quantifiers. We show that the resulting logic retains the finite model property, and that the satisfiability problem for its (m+1)-variable sub-fragment is in m-NExpTime for all positive m. We also consider the satisfiability and finite satisfiability problems for the extension of any of these fragments in which the fluting requirement applies only to sub-formulas having at least three free variables.\n\nThis talk is based on the speakers paper [https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/14210\/pdf\/LIPIcs-ICALP-2021-141.pdf Fluted Logic with Counting] accepted at ICALP 2021.\n\n\n'''Short bio:''' Ian Pratt-Hartmann studied mathematics and philosophy at [http:\/\/www.bnc.ox.ac.uk Brasenose College, Oxford], and philosophy at [http:\/\/www.princeton.edu\/main\/ Princeton] and [http:\/\/www.stanford.edu\/ Stanford] Universities, gaining his PhD. from Princeton. He is currently Senior Lecturer in the Department of Computer Science at the [http:\/\/www.manchester.ac.uk\/ University of Manchester]. Since February, 2014, Dr. Pratt-Hartmann has held a joint appointment in the [http:\/\/informatyka.wmfi.uni.opole.pl\/ Institute of Computer Science] at the [http:\/\/www.uni.opole.pl\/ University of Opole]. His academic interests range widely over computational logic, natural language semantics and artificial intelligence.\n\n\nThis talk will take place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=128251&p=5a1cd43c\n\nwithout ZIH-login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=128251&p=14fd82b8"]},"fulltext":"Seminar 08.07.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_08.07.2021","namespace":0,"exists":"1","displaytitle":"Fluted Logic with Counting"},"TBA5":{"printouts":{"Start":[{"timestamp":"1603797300","raw":"1\/2020\/10\/27\/11\/15\/0\/0"}],"Ende":[{"timestamp":"1603802700","raw":"1\/2020\/10\/27\/12\/45\/0\/0"}],"title":["Forgetting Atoms and Arguments"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Matti Berthold"],"Details":["Whereas the operation of forgetting has recently seen a considerable amount of attention in the context of Answer Set Programming (ASP), most of it has focused on theoretical aspects, leaving the practical issues largely untouched. Recent studies include results about what sets of properties operators should satisfy, as well as the abstract characterization of several operators and their theoretical limits. However, no concrete operators have been investigated.\nWe address this issue by presenting the first concrete operator that satisfies strong persistence (SP) - a property that seems to best capture the essence of forgetting in the context of ASP - whenever this is possible, and many other important properties. The operator is syntactic, limiting the computation of the forgetting result to manipulating the rules in which the atoms to be forgotten occur, naturally yielding a forgetting result that is close to the original program. \nWhenever (SP) cannot be satisfied, it is inevitable to break some relations between the atoms not to be forgotten.\nTherefore, an alternative to satisfying (SP) only when possible is to enhance the logical language so that all such relations can be maintained after the forgetting operation.\nWe borrow from the recently introduced notion of fork \u2013 a conservative extension of Equilibrium Logic and its monotonic basis, the logic of Here-and-There \u2013 which has been shown to be sufficient to overcome the problems related to satisfying (SP). We map this notion into the language of logic programs, enhancing it with so-called anonymous cycles, and we introduce a concrete syntactical forgetting operator over this enhanced language that we show to always obey strong persistence.\nResearch of forgetting in the context of Dung-style argumentation frameworks (AFs) is much less developed. For example, properties that forgetting operators over AFs should satisfy have only been compiled this year. We provide a summery of relevant results and preliminary thoughts on how to proceed in the field.\n\n\nShort-Bio:\nMatti Berthold received his B.Sc. in Computer Science at the University of Leipzig, before studying Computational Logic at TU Dresden and FCT NOVA Lisbon. During his studies he had the chance to assist and conduct teaching and publish and present the results of both his theses.\n\n\nThe talk will take place online. If there is any interest in attending, please send an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"TBA5","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/TBA5","namespace":0,"exists":"1","displaytitle":"Forgetting Atoms and Arguments"},"Formalizing \"Formale Systeme\"":{"printouts":{"Start":[{"timestamp":"1693479600","raw":"1\/2023\/8\/31\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1693483200","raw":"1\/2023\/8\/31\/12\/0\/0\/0"}],"title":["Formalizing \"Formale Systeme\""],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Matthias Mei\u00dfner"],"Details":["Abstract: In undergraduate theoretical computer science courses, students\nencounter many new concepts along with techniques to prove theorems\nabout those with mathematical rigour. Most of those definitions and\nproofs are both constructive in nature and fairly self contained, since\nthey depend on only very few mathematical facts. This makes formalising\nthem in an automated theorem prover feasible and educational. The\nobjective of this project was to formalize a subset of the two lectures\n\"Formale Systeme\" and \"Theoretische Informatik und Logik\", serving both\nas a reference for students and as a starting point for future\nformalisations.\n\nThe LEAN theorem prover and programming language is a project under\nactive development with a large, community maintained library of\nmathematical definitions and theorems called \"mathlib\". This makes it a\ngood fit for formalising the undergraduate computer science lectures.\nLEAN also incorporates interesting and convenient features, notably a\nHaskell inspired type class resolution, a first-class support for\nquotients and the ability to very easily extend the language with new\nnotations or tactics.\n\nWhile there has already been some effort to formalizing \"Formale\nSysteme\", most has been reimplemented to make the definitions easier to\nwork with, taking special care to end up with small and reusable proofs.\nOverall the focus has been on regular languages, where the equivalence\nof DFAs, NFAs and regular grammars among each other is the major\nimplemented result.\n\nIn this talk I will give a short introduction to LEAN and outline the\ndefinitions and theorems that have been formalized as a part of this\nproject.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Formalizing \"Formale Systeme\"","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Formalizing_%22Formale_Systeme%22","namespace":0,"exists":"1","displaytitle":"Formalizing \"Formale Systeme\""},"Formalizing Possibly Infinite Trees of Bounded Degree":{"printouts":{"Start":[{"timestamp":"1741258800","raw":"1\/2025\/3\/6\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1741262400","raw":"1\/2025\/3\/6\/12\/0\/0\/0"}],"title":["Formalizing Possibly Infinite Trees of Bounded Degree"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Lukas Gerlach"],"Details":["As Lean does not support coinductive types directly, formalizing infinite lists and infinite trees requires some \"creativity\". As a byproduct of one of our ongoing works, we formalized possibly infinite trees of bounded degree in Lean. In this workshop, we will reproduce this idea and present the definition from scratch (even without mathlib). We will work towards showing a special case of K\u00f6nig\u2019s Lemma: if each branch in such a tree is finite, then there are only finitely many branches.\n\nThis is going to be an interactive talk so feel free to bring your machine with Lean installed!"]},"fulltext":"Formalizing Possibly Infinite Trees of Bounded Degree","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Formalizing_Possibly_Infinite_Trees_of_Bounded_Degree","namespace":0,"exists":"1","displaytitle":"Formalizing Possibly Infinite Trees of Bounded Degree"},"Framework for the Specification and Execution of parallel Clustering Algorithms":{"printouts":{"Start":[{"timestamp":"1436799000","raw":"1\/2015\/7\/13\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1436802600","raw":"1\/2015\/7\/13\/15\/50\/0\/0"}],"title":["Framework for the Specification and Execution of parallel Clustering Algorithms"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Alexander Krause"],"Details":["Based on the increasing data, which originates from growing sensor networks, logging or other sources, we need to analyze more and more data. For this purpose, the process of data mining is being used, especially the cluster analysis. With the cluster analysis, we want to identify elements in a data crowd, whose properties are similar to or even matching those of other elements of the same data crowd. To preserve a maximum of flexibility for the analysis process itself, several execution environments are necessary. Unfortunately, every implementation of an algorithm is mostly depending on a specific execution environment. This work evaluates an approach, which uses the MapReduce model for specifying platform independent clustering algorithms and which exploits the underlying hardware\u2019s parallelism. Therefore, a specification language will be presented, which can be used for platform independent specification and how it can be transformed into platform dependent code for a targeted execution environment. The functionality of this approach will be demonstrated by concrete examples based on MapReduce and OpenCL implementations."]},"fulltext":"Framework for the Specification and Execution of parallel Clustering Algorithms","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Framework_for_the_Specification_and_Execution_of_parallel_Clustering_Algorithms","namespace":0,"exists":"1","displaytitle":"Framework for the Specification and Execution of parallel Clustering Algorithms"},"From Classical to Consistent Query Answering under Existential Rules":{"printouts":{"Start":[{"timestamp":"1434379800","raw":"1\/2015\/6\/15\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1434383400","raw":"1\/2015\/6\/15\/15\/50\/0\/0"}],"title":["From Classical to Consistent Query Answering under Existential Rules"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Andreas Pieris"],"Details":["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.\n\n\nThis is join work with Thomas Lukasiewicz, Maria Vanina Martinez, and Gerardo I. Simari"]},"fulltext":"From Classical to Consistent Query Answering under Existential Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/From_Classical_to_Consistent_Query_Answering_under_Existential_Rules","namespace":0,"exists":"1","displaytitle":"From Classical to Consistent Query Answering under Existential Rules"},"Seminar 29.04.2021":{"printouts":{"Start":[{"timestamp":"1619706600","raw":"1\/2021\/4\/29\/14\/30\/0\/0"}],"Ende":[{"timestamp":"1619712000","raw":"1\/2021\/4\/29\/16\/0\/0\/0"}],"title":["From Data to Knowledge: Extending Database Techniques for Knowledge Graphs"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Maribel Acosta"],"Details":["Modern applications like recommender systems and question answering systems can leverage models beyond traditional data representations. These novel applications build upon knowledge, which cannot be easily captured with relational data models used in databases. Instead, Knowledge Graphs (KGs) allow for modeling, in a semi-structured way, inter-connected facts or statements annotated with semantics. In KGs, concepts and entities correspond to nodes while their connections are modeled as directed and labeled edges, creating a graph.\nWhile the models for representing relational data and KGs differ considerably, the architecture for querying databases have served as a foundation for querying KGs. However, not all the advancements in databases can be directly applied to KGs. This lecture will present some necessary extensions as well as successful applications of database techniques to efficiently execute queries over KGs. First, I will introduce the problem of query optimization and present extensions to traditional optimizers to cope with the semi- structured nature of KGs. Then, I will present the application of adaptive execution techniques to handle unexpected conditions when querying decentralized KGs. I will conclude with an outlook on future research directions, which include preliminary results on applying Deep Learning to the problem of query optimization for KGs.\n\n\nMaribel Acosta studied Computer Science at the Universidad Simon Bolivar in Venezuela, where she started working on Heterogeneous Databases and the Semantic Web. In 2017, she finished her PhD in the Knowledge Management group at the Karlsruhe Institute of Technology (KIT) on the topic \"Query Processing over Graph-structured Data on the Web\". After that, she was a postdoc and a lecturer (Akademische R\u00e4tin) at the Web Science group also at KIT. She has participated as a Track Chair of several international Semantic Web conferences and also as a reviewer in international conferences on the Web (WWW) and Artificial Intelligence (AAAI, NEURIPS). Since October 2020, Maribel is an Assistant Professor at the Ruhr University Bochum, where she will hold lectures about Databases, Information Systems, and Knowledge Graphs. \n\n\nThis talk will take place online via BigBlueButton. To access the room, take one of the following links: \n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=94316&p=76ddab55\n\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=94316&p=7b2c73ef"]},"fulltext":"Seminar 29.04.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_29.04.2021","namespace":0,"exists":"1","displaytitle":"From Data to Knowledge: Extending Database Techniques for Knowledge Graphs"},"From Horn-SRIQ to Datalog: A Data-Independent Transformation that Preserves Assertion Entailment":{"printouts":{"Start":[{"timestamp":"1541682000","raw":"1\/2018\/11\/8\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1541687400","raw":"1\/2018\/11\/8\/14\/30\/0\/0"}],"title":["From Horn-SRIQ to Datalog: A Data-Independent Transformation that Preserves Assertion Entailment"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["David Carral"],"Details":["'''Abstract:''' Ontology-based access to large data-sets has recently gained a lot of attention. To access data efficiently, one approach is to rewrite the ontology into Datalog, and then use powerful Datalog engines to compute implicit entailments. Existing rewriting techniques support Description Logics (DLs) from ELH to Horn-SHIQ. We go one step further and present one such data-independent rewriting technique for Horn-SRIQ, the extension of Horn-SHIQ that supports non-transitive, complex roles---an expressive feature prominently used in many real-world ontologies. We evaluated our rewriting technique on a large known corpus of ontologies. Our experiments show that the resulting rewritings are of moderate size and that the our approach is more efficient than state-of-the-art DL reasoners when reasoning with data-intensive ontologies. \n\n\nThis is joint work with Larry Gonz\u00e1lez and Patrick Koopman. It has been accepted at AAAI 2019."]},"fulltext":"From Horn-SRIQ to Datalog: A Data-Independent Transformation that Preserves Assertion Entailment","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/From_Horn-SRIQ_to_Datalog:_A_Data-Independent_Transformation_that_Preserves_Assertion_Entailment","namespace":0,"exists":"1","displaytitle":"From Horn-SRIQ to Datalog: A Data-Independent Transformation that Preserves Assertion Entailment"},"From Provenance Polynomials to Provenance Patterns: More Mileage for Mere Mortals":{"printouts":{"Start":[{"timestamp":"1678359600","raw":"1\/2023\/3\/9\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1678363200","raw":"1\/2023\/3\/9\/12\/0\/0\/0"}],"title":["From Provenance Polynomials to Provenance Patterns: More Mileage for Mere Mortals"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Bertram Lud\u00e4scher"],"Details":["Abstract: \nIt is well known that the commutative semiring of integer polynomials N[X] provides an elegant unifying framework (a.k.a. how-provenance) for a number of earlier provenance approaches in databases. A provenance-annotated answer A\u2019 to a query Q reveals how outputs depend on inputs from the annotated database D\u2032 and thus it can be used to answer strictly more questions than the original answer A = Q(D) without provenance. We propose to use provenance patterns, a related notion implicit in earlier work, to support answering additional questions, not answerable by A\u2032 alone. We show that the pattern-enhanced answer A* can be easily obtained as a by-product of computing A or A\u2019. Using a detailed running example, we illustrate questions that can and cannot be answered using A, A\u2032, and A*, respectively. Time allowing, I\u2019d also like to touch upon related research in answering why-not provenance questions. \n\nAbout the speaker:\nBertram Lud\u00e4scher is a professor at the School of Information Sciences at the University of Illinois, Urbana-Champaign, where he is also a faculty affiliate with the National Center for Supercomputing Applications (NCSA) and the CS department. Prior to joining UIUC, he was a professor at the CS department and the UC Davis Genome Center at the University of California, Davis. His research interests range from practical questions in scientific data management and workflow automation, to database theory, and knowledge representation & reasoning. Before his faculty appointments, he was a research scientist at the San Diego Supercomputer Center (SDSC) and an adjunct faculty at the CSE department at UCSD. He holds a M.S. (Dipl.-Inform.) in CS from the University of Karlsruhe (K.I.T.) and a PhD (Dr. rer. nat.) from the University of Freiburg.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"From Provenance Polynomials to Provenance Patterns: More Mileage for Mere Mortals","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/From_Provenance_Polynomials_to_Provenance_Patterns:_More_Mileage_for_Mere_Mortals","namespace":0,"exists":"1","displaytitle":"From Provenance Polynomials to Provenance Patterns: More Mileage for Mere Mortals"},"Functional models and Data Complexity for FL0":{"printouts":{"Start":[{"timestamp":"1521105600","raw":"1\/2018\/3\/15\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1521111000","raw":"1\/2018\/3\/15\/10\/50\/0\/0"}],"title":["Functional models and Data Complexity for FL0"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Pavlos Marantidis"],"Details":["In the early days of Description Logic research, the inexpressive DL FL0 was considered to be the smallest possible DL. When it was later shown that subsumption reasoning wrt general TBoxes is as hard as for the more expressive ALC, the community lost interest in this DL. However, the recent approach of reasoning with so-called functional models has rekindled the interest, since, on the one hand it has the potential to outperform ALC reasoners (even though it stays ExpTime-hard in the worst case), and on the other hand, it has already helped in answering open problems about non-standard inferences for FL0, like existence and computation of least common subsumer and most specific concept, and the exact data complexity of query answering.\nIn this talk, we will describe the approach of functional models, and demonstrate how it has been used to show that answering instance queries for FL0 is tractable regarding data complexity."]},"fulltext":"Functional models and Data Complexity for FL0","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Functional_models_and_Data_Complexity_for_FL0","namespace":0,"exists":"1","displaytitle":"Functional models and Data Complexity for FL0"},"GPTKB: Comprehensively Materializing Factual LLM Knowledge":{"printouts":{"Start":[{"timestamp":"1737025200","raw":"1\/2025\/1\/16\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1737028800","raw":"1\/2025\/1\/16\/12\/0\/0\/0"}],"title":["GPTKB: Comprehensively Materializing Factual LLM Knowledge"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Simon Razniewski"],"Details":["LLMs have majorly advanced NLP and AI, and next to their ability to perform a wide range of procedural tasks, a major success factor is their internalized factual knowledge. Since (Petroni et al., 2019), analyzing this knowledge has gained attention. However, most approaches investigate one question at a time via modest-sized pre-defined samples, introducing an availability bias (Tversky and Kahnemann, 1973) that prevents the discovery of knowledge (or beliefs) of LLMs beyond the experimenter's predisposition.\n\nTo address this challenge, we propose a novel methodology to comprehensively materialize an LLM's factual knowledge through recursive querying and result consolidation.\n\nAs a prototype, we employ GPT-4o-mini to construct GPTKB, a large-scale knowledge base (KB) comprising 105 million triples for over 2.9 million entities - achieved at 1% of the cost of previous KB projects. This work potentially marks a milestone in two areas: (1) For LLM research, for the first time, it provides constructive insights into the scope and structure of LLMs' knowledge (or beliefs). For KB construction, it pioneers new pathways for the long-standing challenge of general-domain KB construction. GPTKB is accessible at https:\/\/gptkb.org."]},"fulltext":"GPTKB: Comprehensively Materializing Factual LLM Knowledge","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/GPTKB:_Comprehensively_Materializing_Factual_LLM_Knowledge","namespace":0,"exists":"1","displaytitle":"GPTKB: Comprehensively Materializing Factual LLM Knowledge"},"General Acyclicity and Cyclicity Notions for the Disjunctive Skolem Chase":{"printouts":{"Start":[{"timestamp":"1668078000","raw":"1\/2022\/11\/10\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1668081600","raw":"1\/2022\/11\/10\/12\/0\/0\/0"}],"title":["General Acyclicity and Cyclicity Notions for the Disjunctive Skolem Chase"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Lukas Gerlach"],"Details":["The disjunctive skolem chase is a sound, complete, and potentially non-terminating procedure for solving boolean conjunctive query entailment over knowledge bases of disjunctive existential rules. We develop novel acyclicity and cyclicity notions for this procedure; that is, we develop sufficient conditions to determine chase termination and non-termination. Our empirical evaluation shows that our novel notions are significantly more general than existing criteria."]},"fulltext":"General Acyclicity and Cyclicity Notions for the Disjunctive Skolem Chase","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/General_Acyclicity_and_Cyclicity_Notions_for_the_Disjunctive_Skolem_Chase","namespace":0,"exists":"1","displaytitle":"General Acyclicity and Cyclicity Notions for the Disjunctive Skolem Chase"},"Generalized Consistent Query Answering under Existential Rules":{"printouts":{"Start":[{"timestamp":"1512033600","raw":"1\/2017\/11\/30\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1512039000","raw":"1\/2017\/11\/30\/10\/50\/0\/0"}],"title":["Generalized Consistent Query Answering under Existential Rules"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Thomas Lukasiewicz"],"Details":["In the talk, I give an overview of recent results on generalised consistent query answering under existential rules. Previous work has proposed consistent query answering as a way to resolve inconsistencies in ontologies. In these approaches to consistent query answering, however, only inconsistencies due to errors in the underlying database are considered. In recent works, we additionally assume that ontological axioms may be erroneous, and that some database atoms and ontological axioms may not be removed to resolve inconsistencies. This problem is especially well suited in debugging mappings between distributed ontologies. We define two different semantics, one where ontological axioms as a whole are ignored to resolve an inconsistency, and one where only some of their instances are ignored. We then give a precise picture of the complexity of consistent query answering under these two semantics when ontological axioms are encoded as different classes of existential rules."]},"fulltext":"Generalized Consistent Query Answering under Existential Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Generalized_Consistent_Query_Answering_under_Existential_Rules","namespace":0,"exists":"1","displaytitle":"Generalized Consistent Query Answering under Existential Rules"},"Generating molecule graphs from mass spectrometry results using Answer-Set-Programming":{"printouts":{"Start":[{"timestamp":"1711623600","raw":"1\/2024\/3\/28\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1711627200","raw":"1\/2024\/3\/28\/12\/0\/0\/0"}],"title":["Generating molecule graphs from mass spectrometry results using Answer-Set-Programming"],"Room":[{"fulltext":"APB room 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Nils K\u00fcchenmeister"],"Details":["Abstract: Mass spectrometry is a procedure to determine the exact composition of chemicals analytically. However, chemical properties heavily depend on the structure of the molecules. Therefore it is of interest, to find possible structure formulas matching a given sum formula. In contrast to prior works on this subject, we approach this problem with Answer-Set-Programming, instead of giving a complex imperative implementation. To this end, various problem encodings for the ASP-solver Clingo will be discussed. Avoiding the emission of isomorphic models, methods of introducing symmetry-breaking constraints will be compared. Their evaluation focuses on weighting the reduction in undetected isomorphic copies against runtime overhead. Different hand-crafted constraints - adjusted specially for this problem - will be compared against automated methods.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 2026, and online through the link: \nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Generating molecule graphs from mass spectrometry results using Answer-Set-Programming","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Generating_molecule_graphs_from_mass_spectrometry_results_using_Answer-Set-Programming","namespace":0,"exists":"1","displaytitle":"Generating molecule graphs from mass spectrometry results using Answer-Set-Programming"},"Seminar talk, title: \"Practical Linked Data Access via SPARQL: The Case of Wikidata\"":{"printouts":{"Start":[{"timestamp":"1524217800","raw":"1\/2018\/4\/20\/9\/50\/0\/0"}],"Ende":[{"timestamp":"1524222000","raw":"1\/2018\/4\/20\/11\/0\/0\/0"}],"title":["Getting the most out of Wikidata: Semantic Technology Usage in Wikipedia\u2019s Knowledge Graph"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Markus Kr\u00f6tzsch"],"Details":["Abstract:\n\"Wikidata, the knowledge base of Wikimedia, has been extremely successful in building and sustaining new communities of editors and users. Since its inception in 2012, it has developed from an experimental \u201cdata wiki\u201d into a well-organised reference knowledge base with an amazing array of applications. You can now come across Wikidata content in your mobile phone, in newspaper articles, and even in aeroplanes. A key towards this success has been the development of a whole ecosystem of tools and APIs for accessing, querying, and analysing Wikidata content. The most prominent such feature is Wikidata's powerful query service, which is based on the Semantic Web data exchange standard RDF and its related query language SPARQL. The talk will give an overview over these developments and focus specifically on the possibilities and current usage of SPARQL on Wikidata.\"\n\nThis is joined work with Adrian Bielefeldt and Julius Gonsior. The paper is at https:\/\/iccl.inf.tu-dresden.de\/web\/Inproceedings3196. This talk is a preparation for the presentation at WWW."]},"fulltext":"Seminar talk, title: \"Practical Linked Data Access via SPARQL: The Case of Wikidata\"","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_talk,_title:_%22Practical_Linked_Data_Access_via_SPARQL:_The_Case_of_Wikidata%22","namespace":0,"exists":"1","displaytitle":"Getting the most out of Wikidata: Semantic Technology Usage in Wikipedia\u2019s Knowledge Graph"},"Graph Structure and Monadic Second-Order Logic":{"printouts":{"Start":[{"timestamp":"1421679000","raw":"1\/2015\/1\/19\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1421682600","raw":"1\/2015\/1\/19\/15\/50\/0\/0"}],"title":["Graph Structure and Monadic Second-Order Logic"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Micha\u00ebl Thomazo"],"Details":["In this talk, I will introduce the book from Courcelle and Engelfriet (Graph Structure and Monadic Second-Order Logic -- A Language-Theoretic Approach). In particular, we will see families of graphs (of bounded treewidth\/cliquewidth), their links with monadic second order-logic, and fixed-parameter tractability. The talk aims at brushing an overview of the book, and should be as largely accessible as possible."]},"fulltext":"Graph Structure and Monadic Second-Order Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Graph_Structure_and_Monadic_Second-Order_Logic","namespace":0,"exists":"1","displaytitle":"Graph Structure and Monadic Second-Order Logic"},"Grounded Circumscription in Description Logics2":{"printouts":{"Start":[{"timestamp":"1429110000","raw":"1\/2015\/4\/15\/15\/0\/0\/0"}],"Ende":[{"timestamp":"1429113600","raw":"1\/2015\/4\/15\/16\/0\/0\/0"}],"title":["Grounded Circumscription in Description Logics"],"Room":[{"fulltext":"APB 2101","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2101","namespace":0,"exists":"","displaytitle":""}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Stathis Delivorias"],"Details":["Circumscription is a paradigm of non-monotonic logic meant to formalize the common sense understanding that among competing theories that represent phenomena equally well, the one with the fewest assumptions should be selected. Description Logics are knowledge representation formalisms designed to describe and reason about qualitative properties and aspects of a system. In this essay we aim to fuse Description Logics, which traditionally are monotonic, with a restricted version of Circumscription, called Grounded Circumscription. The work is based on a 2011 publication by K. Sengupta, A.A. Krisnadhi and P. Hitzler, which throughout this study we will refer to as \"the original paper\". The paper introduces the main idea of grounded circumscription along with algorithms for certain decision problems. We have optimized and modified these ideas. The optimization was our initial aim, in particular we wanted (and largely achieved) to transfer a big part of the reasoning to standard Description Logics, for which tools and results already exist. But in the process we uncovered some insufficiencies in the original paper, hence we have modified the main definition to one that is more effective and seems more intuitive."]},"fulltext":"Grounded Circumscription in Description Logics2","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Grounded_Circumscription_in_Description_Logics2","namespace":0,"exists":"1","displaytitle":"Grounded Circumscription in Description Logics"},"HUGS \u2013 A Lightweight Graph Partitioning Approach":{"printouts":{"Start":[{"timestamp":"1465397400","raw":"1\/2016\/6\/8\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1465401000","raw":"1\/2016\/6\/8\/15\/50\/0\/0"}],"title":["HUGS \u2013 A Lightweight Graph Partitioning Approach"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Alexander Krause"],"Details":["The growing interest in graph data lead to increasingly more research in the field of graph data management and graph analytics. Nowadays, even large graphs of up to a size of billions of vertices and edges fit into main memory of big modern multisocket machines, making them a first-grade platform for graph management and graph analytics. High performance data management solutions have to be aware of the NUMA properties of such big machines. A data-oriented architecture (DORA) is a particular solution to that. However, it requires partitioning the data in a way such that inter-partition communication can be avoided.\n\n\nGraph partitioning is a long studied problem and state-of-the-art solutions, such as multilevel k-way partitioning and recursive bisection achieve good results in feasible time. Integrating such solution is a rather difficult task, though. In this paper, we present a more lightweight approach called HUGS. The key idea of HUGS is to reuse the BFS routine present in a graph data management system anyway, since it is the foundation of many analytical graph algorithms. HUGS is not meant to produce a good general-purpose graph partitioning but good runtimes of BFS graph traversals such as reachability queries on DORA systems. In our experiments HUGS showed capable of finding good graph partitionings faster than state-of-the-art approaches. The partitioning found by HUGS also showed shorter runtimes for reachability queries."]},"fulltext":"HUGS \u2013 A Lightweight Graph Partitioning Approach","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/HUGS_%E2%80%93_A_Lightweight_Graph_Partitioning_Approach","namespace":0,"exists":"1","displaytitle":"HUGS \u2013 A Lightweight Graph Partitioning Approach"},"How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions.":{"printouts":{"Start":[{"timestamp":"1689246000","raw":"1\/2023\/7\/13\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1689249600","raw":"1\/2023\/7\/13\/12\/0\/0\/0"}],"title":["How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions."],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["Abstract: We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics. Our primary object of interest is ALCvpl, an extension of ALC with path expressions using visibly-pushdown languages, which was shown to be decidable by L\u00f6ding et al. in 2007. We prove that decidability of ALCvpl is preserved when enriching the logic with functionality, but decidability is lost upon adding the seemingly innocent Self operator. We also consider the simplest non-regular (visibly-pushdown) language r#s# := {r^n s^n : n \u2208 N}. We establish undecidability of the satisfiability problem for ALC extended with nominals and r#s#, as well as the query entailment problem, where such non-regular atoms are present in queries.\nThis work is based on the paper accepted to JELIA 2023, which is going to be submitted to Logical Methods in Computer Science next week.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions.","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/How_I_made_my_research_more_VISIBLE%3F_Undecidability_Results_for_ALC_Extended_with_Visibly_Pushdown_Path_Expressions.","namespace":0,"exists":"1","displaytitle":"How I made my research more VISIBLE? Undecidability Results for ALC Extended with Visibly Pushdown Path Expressions."},"How to Agree to Disagree: Managing Ontological Perspectives using Standpoint Logic":{"printouts":{"Start":[{"timestamp":"1666263600","raw":"1\/2022\/10\/20\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1666267200","raw":"1\/2022\/10\/20\/12\/0\/0\/0"}],"title":["How to Agree to Disagree: Managing Ontological Perspectives using Standpoint Logic"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Luc\u00eda G\u00f3mez \u00c1lvarez"],"Details":["The importance of taking individual, potentially conflicting perspectives into account when dealing with knowledge has been widely recognised. Many existing ontology management approaches fully merge knowledge perspectives, which may require weakening in order to maintain consistency; others represent the distinct views in an entirely detached way. As an alternative, we propose Standpoint Logic, a simple, yet versatile multi-modal logic ``add-on'' for existing KR languages intended for the integrated representation of domain knowledge relative to diverse, possibly conflicting \\emph{standpoints}, which can be hierarchically organised, combined, and put in relation with each other.\nStarting from the generic framework of First-Order Standpoint Logic (FOSL), we subsequently focus our attention on the fragment of sentential formulas, for which we provide a polytime translation into the standpoint-free version. This result yields decidability and favourable complexities for a variety of highly expressive decidable fragments of first-order logic. Using some encoding tricks, we then establish a similar translation for the very expressive description logic SROIQb_s underlying the OWL 2 DL ontology language. By virtue of this result, existing highly optimised OWL reasoners can be used to provide practical reasoning support for ontology languages extended by standpoint modelling."]},"fulltext":"How to Agree to Disagree: Managing Ontological Perspectives using Standpoint Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/How_to_Agree_to_Disagree:_Managing_Ontological_Perspectives_using_Standpoint_Logic","namespace":0,"exists":"1","displaytitle":"How to Agree to Disagree: Managing Ontological Perspectives using Standpoint Logic"},"IASCAR: Incremental Answer Set Counting by Anytime Refinement":{"printouts":{"Start":[{"timestamp":"1669287600","raw":"1\/2022\/11\/24\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1669291200","raw":"1\/2022\/11\/24\/12\/0\/0\/0"}],"title":["IASCAR: Incremental Answer Set Counting by Anytime Refinement"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Dominik Rusovac"],"Details":["Answer set programming (ASP) is a popular declarative programming paradigm with various applications. Programs can easily have so many answer sets that they cannot be enumerated in practice, but counting still allows to quantify solution spaces. If one counts under assumptions on literals, one obtains a tool to comprehend parts of the solution space, so called answer set navigation. But navigating through parts of the solution space requires counting many times, which is expensive in theory. There, knowledge compilation compiles instances into representations on which counting works in polynomial time. However, these techniques exist only for CNF formulas and compiling ASP programs into CNF formulas can introduce an exponential overhead. In this paper, we introduce a technique to iteratively count answer sets under assumptions on knowledge compilations of CNFs that encode supported models. Our anytime technique uses the principle of inclusion-exclusion to systematically improve bounds by over- and undercounting. In a preliminary empirical analysis we demonstrate promising results. After compiling the input (offline phase) our approach quickly (re)counts."]},"fulltext":"IASCAR: Incremental Answer Set Counting by Anytime Refinement","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/IASCAR:_Incremental_Answer_Set_Counting_by_Anytime_Refinement","namespace":0,"exists":"1","displaytitle":"IASCAR: Incremental Answer Set Counting by Anytime Refinement"},"ICCL Summer School 'Bridging the Gap between Human and Automated Reasoning', September 18-29, 2017, Dresden":{"printouts":{"Start":[{"timestamp":"1505725200","raw":"1\/2017\/9\/18\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1506704400","raw":"1\/2017\/9\/29\/17\/0\/0\/0"}],"title":["ICCL Summer School 'Bridging the Gap between Human and Automated Reasoning', September 18-29, 2017, Dresden"],"Room":[],"Type":["Sommerschule"],"Speaker":[],"Details":["In September 2017 we organize a summer school at TU Dresden, Germany.\n\nThe topic of this year's summer school is ''Bridging the Gap between Human and Automated Reasoning''.\n\nAs in the past summer schools at TU Dresden in 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2010, 2013 and 2015 people from distinct, but communicating communities will gather in an informal and friendly atmosphere. This two-week event is aimed at graduate students, researchers and practitioners."]},"fulltext":"ICCL Summer School 'Bridging the Gap between Human and Automated Reasoning', September 18-29, 2017, Dresden","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ICCL_Summer_School_%27Bridging_the_Gap_between_Human_and_Automated_Reasoning%27,_September_18-29,_2017,_Dresden","namespace":0,"exists":"1","displaytitle":"ICCL Summer School 'Bridging the Gap between Human and Automated Reasoning', September 18-29, 2017, Dresden"},"ICCL Summer School 2005":{"printouts":{"Start":[{"timestamp":"1120262400","raw":"1\/2005\/7\/2\/0\/0\/0\/0"}],"Ende":[{"timestamp":"1121644799","raw":"1\/2005\/7\/17\/23\/59\/59\/0"}],"title":["ICCL Summer School 2005"],"Room":[],"Type":["Sommerschule"],"Speaker":[],"Details":["Logic-based Knowledge Representation (ICCL-SS-2005)\nTU Dresden, July 2 - 17, 2005"]},"fulltext":"ICCL Summer School 2005","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ICCL_Summer_School_2005","namespace":0,"exists":"1","displaytitle":"ICCL Summer School 2005"},"ICCL Summer School 2006":{"printouts":{"Start":[{"timestamp":"1151107200","raw":"1\/2006\/6\/24\/0\/0\/0\/0"}],"Ende":[{"timestamp":"1152403199","raw":"1\/2006\/7\/8\/23\/59\/59\/0"}],"title":["ICCL Summer School 2006"],"Room":[],"Type":["Sommerschule"],"Speaker":[],"Details":["ICCL Summer School 2006: Knowledge Structures (ICCL-SS-2006)\nTU Dresden, June 24 - July 8, 2006"]},"fulltext":"ICCL Summer School 2006","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ICCL_Summer_School_2006","namespace":0,"exists":"1","displaytitle":"ICCL Summer School 2006"},"ICCL Summer School 2008":{"printouts":{"Start":[{"timestamp":"1219536000","raw":"1\/2008\/8\/24\/0\/0\/0\/0"}],"Ende":[{"timestamp":"1220745599","raw":"1\/2008\/9\/6\/23\/59\/59\/0"}],"title":["ICCL Summer School 2008"],"Room":[],"Type":["Sommerschule"],"Speaker":[],"Details":["ICCL Summer School 2008: Computational Logic and Cognitive Science (ICCL-SS-2008)\nTU Dresden, August 24 - September 6, 2008"]},"fulltext":"ICCL Summer School 2008","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ICCL_Summer_School_2008","namespace":0,"exists":"1","displaytitle":"ICCL Summer School 2008"},"ICCL Summer School 2010":{"printouts":{"Start":[{"timestamp":"1283040000","raw":"1\/2010\/8\/29\/0\/0\/0\/0"}],"Ende":[{"timestamp":"1284163199","raw":"1\/2010\/9\/10\/23\/59\/59\/0"}],"title":["ICCL Summer School 2010"],"Room":[],"Type":["Sommerschule"],"Speaker":[],"Details":["ICCL Summer School 2010: Cognitive Science, Computational Logic and Connectionism (ICCL-SS-2010)\nTU Dresden, August 29 - September 10, 2010"]},"fulltext":"ICCL Summer School 2010","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ICCL_Summer_School_2010","namespace":0,"exists":"1","displaytitle":"ICCL Summer School 2010"},"ICCL Summer School 2013":{"printouts":{"Start":[{"timestamp":"1376784000","raw":"1\/2013\/8\/18\/0\/0\/0\/0"}],"Ende":[{"timestamp":"1377907200","raw":"1\/2013\/8\/31\/0\/0\/0\/0"}],"title":["ICCL Summer School 2013"],"Room":[],"Type":["Sommerschule"],"Speaker":[],"Details":["ICCL Summer School on Sementic Web - Ontology Languages and Their Use (August 18 - 31, 2013)"]},"fulltext":"ICCL Summer School 2013","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ICCL_Summer_School_2013","namespace":0,"exists":"1","displaytitle":"ICCL Summer School 2013"},"ICCL Summer School 2015":{"printouts":{"Start":[{"timestamp":"1442134800","raw":"1\/2015\/9\/13\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1443290400","raw":"1\/2015\/9\/26\/18\/0\/0\/0"}],"title":["ICCL Summer School 2015"],"Room":[],"Type":["Sommerschule"],"Speaker":[],"Details":["In September 2015 we organize a summer school, which will be held before the [http:\/\/www.tu-dresden.de\/inf\/ki2015 German AI conference].\nThe conference and the summer school will be coupled. \nA participation in the summer school includes the free participation in the AI conference. \n\nAs in the past summer schools at TU Dresden in \n[http:\/\/www.computational-logic.org\/iccl\/events\/WPT-2002 2002],\n[http:\/\/www.computational-logic.org\/iccl\/events\/WPT-2003 2003], \n[http:\/\/www.computational-logic.org\/iccl\/events\/SA-2004 2004], \n[http:\/\/www.computational-logic.org\/content\/events\/iccl-ss-2005 2005], \n[http:\/\/www.computational-logic.org\/content\/events\/iccl-ss-2006 2006],\n[http:\/\/reasoningweb.org\/2007\/ 2007],\n[http:\/\/www.computational-logic.org\/content\/events\/iccl-ss-2008 2008]\n[http:\/\/www.computational-logic.org\/content\/events\/iccl-ss-2010 2010] and\n[http:\/\/www.computational-logic.org\/content\/events\/iccl-ss-2013 2013]\npeople from distinct, but communicating communities will gather in an informal and friendly atmosphere. \nThis two-week event is aimed at graduate students, researchers and practitioners.\n\n''' Topic '''\n\nThe topic of this year's summer school is '''Reasoning'''"]},"fulltext":"ICCL Summer School 2015","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ICCL_Summer_School_2015","namespace":0,"exists":"1","displaytitle":"ICCL Summer School 2015"},"Image schemas in computational concept invention":{"printouts":{"Start":[{"timestamp":"1483614000","raw":"1\/2017\/1\/5\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1483617600","raw":"1\/2017\/1\/5\/12\/0\/0\/0"}],"title":["Image schemas in computational concept invention"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Maria Hedblom"],"Details":["The theory of embodied cognition opened up a new possibilities to bridge the gap between human conceptualisation and artificial intelligence. Within this theoretical framework that cognition arise from embodied experience, linguists started looking at a series of repeated abstract patterns learned from sensors-motor processes they termed 'image schemas'. Often defined as spatial relationship such as 'containment' and 'support' these patterns constitute the conceptual construction that is used to mentally conceptualise concepts, events and often constitute the skeleton of metaphors and analogical reasoning. \n\nIn this talk I will introduce the theory of image schemas. I will present some of our research on how image schemas relate to conceptualisation of everyday objects and simple events as well present a theoretical framework for how they can be used in computational concept invention through the cognitive framework conceptual blending."]},"fulltext":"Image schemas in computational concept invention","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Image_schemas_in_computational_concept_invention","namespace":0,"exists":"1","displaytitle":"Image schemas in computational concept invention"},"Imprecise Probabilities in Decision-making":{"printouts":{"Start":[{"timestamp":"1594299600","raw":"1\/2020\/7\/9\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1594305000","raw":"1\/2020\/7\/9\/14\/30\/0\/0"}],"title":["Imprecise Probabilities in Decision-making"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Jonas Karge"],"Details":["An agent\u2019s beliefs come in different strengths. We understand her degree of belief in a\nproposition as a measure of the strength of her belief in that proposition. According to the\northodox Bayesian picture, an agent's degree of belief is best represented by a single probability\nfunction. In particular, the Bayesian claims that agents must assign numerically precise\nprobabilities to every proposition that they can entertain. On an alternative account, an agent\u2019s\nbeliefs ought to be modeled based on imprecise probabilities. With that, imprecise degrees of\nbelief can be represented by a set of probability functions.\nRecently, however, imprecise probabilities have come under attack. Adam Elga (2010) claims\nthat there is no adequate account of the way they can be manifested in decision-making. In\nresponse to Elga, more elaborate accounts of the imprecise framework have been developed. One\nof them is based on Supervaluationism, originally, a semantic approach to vague predicates. Still,\nSeamus Bradley (2019) shows that those accounts that solve Elga\u2019s problem, have a more severe\ndefect: they undermine a central motivation to introduce imprecise probabilities in the first place.\nThe aim of my presentation is to modify the supervaluationist approach in such a way that it\naccounts for both Elga\u2019s and Bradley\u2019s challenges to the imprecise framework.\n\n\nThis talk will be held digitally. If there is any interest in attending, please write an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"Imprecise Probabilities in Decision-making","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Imprecise_Probabilities_in_Decision-making","namespace":0,"exists":"1","displaytitle":"Imprecise Probabilities in Decision-making"},"Improved Answer-Set Programming Encodings for Abstract Argumentation":{"printouts":{"Start":[{"timestamp":"1444661400","raw":"1\/2015\/10\/12\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1444665000","raw":"1\/2015\/10\/12\/15\/50\/0\/0"}],"title":["Improved Answer-Set Programming Encodings for Abstract Argumentation"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Sarah Alice Gaggl"],"Details":["The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by the ASP-system clingo. Our new encodings are not only more succinct than previous versions, but also outperform them on standard benchmarks."]},"fulltext":"Improved Answer-Set Programming Encodings for Abstract Argumentation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Improved_Answer-Set_Programming_Encodings_for_Abstract_Argumentation","namespace":0,"exists":"1","displaytitle":"Improved Answer-Set Programming Encodings for Abstract Argumentation"},"Seminar 12.08.2021":{"printouts":{"Start":[{"timestamp":"1628773200","raw":"1\/2021\/8\/12\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1628778600","raw":"1\/2021\/8\/12\/14\/30\/0\/0"}],"title":["In the Hand of the Beholder: Comparing Interactive Proof Visualizations"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Alisa Kovtunova"],"Details":["Although logical inferences are interpretable, actually explaining them to a user is still a challenging task. While sometimes it may be enough to point out the axioms from the ontology that lead to the consequence of interest, more complex inferences require proofs with intermediate steps that the user can follow. Our main hypothesis is that different users need different representations of proofs for optimal understanding. To this end, we undertook some user experiments related to logical proofs. In particular, we compared tree-shaped representations with linear, text-based ones, and for each we offered an interactive and a static version. The results of the experiment and the lessons learned will be reported in the talk.\n\n\nThis talk will take place online via BigBlueButton. To access the room, use one of the following links:\n\nwith ZIH-login: \n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=142879&p=5d643238\n\nwithout ZIH-login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=142879&p=911ffc8d"]},"fulltext":"Seminar 12.08.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_12.08.2021","namespace":0,"exists":"1","displaytitle":"In the Hand of the Beholder: Comparing Interactive Proof Visualizations"},"Knowledge-aware Artificial Intelligence or How to Rock Your CS@TUD Studies with chatGPT":{"printouts":{"Start":[{"timestamp":"1729615200","raw":"1\/2024\/10\/22\/16\/40\/0\/0"}],"Ende":[{"timestamp":"1729618800","raw":"1\/2024\/10\/22\/17\/40\/0\/0"}],"title":["Inaugural Lecture: Knowledge-aware Artificial Intelligence or How to Rock Your CS@TUD Studies with chatGPT"],"Room":[{"fulltext":"APB E023","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_E023","namespace":0,"exists":"1","displaytitle":"Raum APB E023"}],"Type":["Vortrag"],"Speaker":["Simon Razniewski"],"Details":["In the first part of this inaugural lecture, I will provide an overview of the field of knowledge-aware artificial intelligence, with a focus on two pillars of AI knowledge, knowledge graphs (KGs) and large language models (LLMs). The second part will highlight key areas of my research, including knowledge estimation, knowledge extraction, and commonsense knowledge.\nI will also provide a recipe for successfully completing CS studies at TUD with chatGPT"]},"fulltext":"Knowledge-aware Artificial Intelligence or How to Rock Your CS@TUD Studies with chatGPT","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Knowledge-aware_Artificial_Intelligence_or_How_to_Rock_Your_CS@TUD_Studies_with_chatGPT","namespace":0,"exists":"1","displaytitle":"Inaugural Lecture: Knowledge-aware Artificial Intelligence or How to Rock Your CS@TUD Studies with chatGPT"},"Inconsistency Handling in Ontology-Mediated Query Answering":{"printouts":{"Start":[{"timestamp":"1463059800","raw":"1\/2016\/5\/12\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1463063400","raw":"1\/2016\/5\/12\/14\/30\/0\/0"}],"title":["Inconsistency Handling in Ontology-Mediated Query Answering"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Camille Bourgaux"],"Details":["The problem of querying description logic knowledge bases using conjunctive queries has been a major focus of recent description logic research. An important issue that arises in this context is how to handle the case in which the data is inconsistent with the ontology. Inconsistency-tolerant semantics can be used to obtain meaningful answers. The semantics AR, IAR, and brave are three well-known semantics, that rely on the notion of a repair, that is an inclusion-maximal subset of the data consistent with the ontology. I will present work on dealing with inconsistent DL-Lite knowledge bases, using these semantics. Beyond efficient query answering, we address the problems of explaining the query results, and of query-driven repairing of the data. We also consider variants of these semantics based on preferred repairs."]},"fulltext":"Inconsistency Handling in Ontology-Mediated Query Answering","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Inconsistency_Handling_in_Ontology-Mediated_Query_Answering","namespace":0,"exists":"1","displaytitle":"Inconsistency Handling in Ontology-Mediated Query Answering"},"Inconsistency Values for Logic Programs under Answer Set Semantics":{"printouts":{"Start":[{"timestamp":"1603371600","raw":"1\/2020\/10\/22\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1603377000","raw":"1\/2020\/10\/22\/14\/30\/0\/0"}],"title":["Inconsistency Values for Logic Programs under Answer Set Semantics"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Dominik Rusovac"],"Details":["The proposition that conflicting pieces of information cannot exist together appears to be too simplistic for developing intelligent systems. Knowledge representation tools such as ASP (Answer Set Programming) rely on non-monotonic reasoning, i.e., programs may contain inconsistent information without collapsing. While measuring inconsistency in monotonic formalisms has been investigated for some time now, my master thesis addresses the issue of measuring inconsistency in ASP in order to provide an approach for analysing and resolving inconsistency in logic-based knowledge representation. Taking nonmonotonicity into account demands for a generalisation of the notion of inconsistency, namely Strong Inconsistency [2]. Aiming to generalise A. Hunter's and S. Konieczny's\napproach [1] to non-monotonic formalisms, the key idea is to characterise and use Minimal Strong Inconsistency Values for inducing a game in coalitional form on a knowledge base, and to then use the Shapley Value in\norder to obtain a solution to this sort of blame game, which reflects the impact of each element on the overall inconsistency in the base. Based on the latter I characterise the Minimal Strong Inconsistency Shapley Strong\nInconsistency (MSISSI) value and the MSISSI measure, which provide an approach to describing inconsistency in ASP and allow for repairing inconsistent knowledge bases.\n\n[1] Anthony Hunter and S\u00e9bastien Konieczny. \"On the measure of conflicts: Shapley inconsistency values\". In: Artifcial Intelligence 174.14 (2010), pp. 1007-1026.\n\n[2] Markus Ulbricht, Matthias Thimm, and Gerhard Brewka. \"Measuring Strong Inconsistency.\" In: AAAI. 2018, pp. 1989-1996.\n\n\nDominik Rusovac was born in Vienna and studied Philosophy at the University of Vienna. Then he studied Logic at the University of Leipzig, focussing on knowledge representation and formal systems. After graduating in 2019 he has been working since January 2020 as a software developer.\n\n\nThe talk will take around 45 minutes after which there will be the opportunity to ask questions and it will take place online. If there is any interest in attending, please send an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"Inconsistency Values for Logic Programs under Answer Set Semantics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Inconsistency_Values_for_Logic_Programs_under_Answer_Set_Semantics","namespace":0,"exists":"1","displaytitle":"Inconsistency Values for Logic Programs under Answer Set Semantics"},"Indexing for Datalog Materialisation with Leapfrog Triejoin":{"printouts":{"Start":[{"timestamp":"1635418800","raw":"1\/2021\/10\/28\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1635422400","raw":"1\/2021\/10\/28\/12\/0\/0\/0"}],"title":["Indexing for Datalog Materialisation with Leapfrog Triejoin"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Philipp Hanisch"],"Details":["Datalog is a well-understood relational query language and there are efficient reasoners based on different concepts and technologies. Nevertheless, the search for faster and more efficient reasoners continues. A promising approach for further performance improvements is the so-called leapfrog triejoin by Veldhuizen. Leapfrog triejoin is a variable-oriented join algorithm, similar to an ordered merge join, and it computes the matches of a Datalog rule as a result trie following a previously defined variable order. The literature about leapfrog triejoin focuses on its application to a single join or, respectively, Datalog rule. Unfortunately, applying leapfrog triejoin to whole Datalog programs during materialization yields new challenges. We concentrate on these challenges as well as on potential solutions.\n\nAs leapfrog triejoin requires suitable data structures for each rule, it is prone to be inefficient when considering the rules of a program in isolation, as this might introduce avoidable redundancy. Moreover, the choice of \u2018good\u2019 variable orders is crucial for the performance of leapfrog triejoin. Hence, we propose criteria for the quality of variable orders. For finding good variable orders, we propose an optimal approach based on Answer Set Programming as well as a heuristic approach. Furthermore, we show the trade-off between the optimality of the ASP approach and the required time in an evaluation.\n\nMoreover, we generalize leapfrog triejoin to use partial variable orders. We discuss the resulting generalization of the data structures, i.e., f-representations instead of tries, and we show how to efficiently prepare them for leapfrog triejoin. To realize the potential of considering independent variables separately and the more succinct representation of relations, we adapt leapfrog triejoin for partial variable orders. We show that, on a set of benchmarks, partial variable orders are of higher quality than total ones w.r.t. our optimization criteria.\n\nThis is a Diploma project defense and will be given online via BigBlueButton. To access the room, use one of the following links:\n\nWith ZIH-Login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=154204&p=b7e638fd\n\nWithout ZIH-Login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=154204&p=19a754b0"]},"fulltext":"Indexing for Datalog Materialisation with Leapfrog Triejoin","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Indexing_for_Datalog_Materialisation_with_Leapfrog_Triejoin","namespace":0,"exists":"1","displaytitle":"Indexing for Datalog Materialisation with Leapfrog Triejoin"},"Integrating Semantic Web in the Real World: A journey between two cities":{"printouts":{"Start":[{"timestamp":"1524214800","raw":"1\/2018\/4\/20\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1524217800","raw":"1\/2018\/4\/20\/9\/50\/0\/0"}],"title":["Integrating Semantic Web in the Real World: A journey between two cities"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Juan Sequeda"],"Details":["Abstract: \n\"An early vision in Computer Science has been to create intelligent systems capable of reasoning on large amounts of data. Today, this vision can be delivered by integrating Relational Databases with the Semantic Web using the W3C standards: a graph data model (RDF), ontology language (OWL), mapping language (R2RML) and query language (SPARQL). The research community has successfully been showing how intelligent systems can be created with Semantic Web technologies, dubbed now as Knowledge Graphs. However, where is the mainstream industry adoption? What are the barriers to adoption? Are these engineering and social barriers or are they open scientific problems that need to be addressed? This talk will chronicle our journey of deploying Semantic Web technologies with real world users to address Business Intelligence and Data Integration needs, describe technical and social obstacles that are present in large organizations, and scientific and engineering challenges that require attention.\"\n\n\nSpeaker's Biography:\nJuan F. Sequeda is the co-founder of Capsenta, a spin-off from his research, and the Senior Director of Capsenta Labs. He holds a PhD in Computer Science from the University of Texas at Austin. His research interests are on the intersection of Logic and Data and in particular between the Semantic Web and Relational Databases for data integration, ontology based data access and semantic\/graph data management. Juan is the recipient of the NSF Graduate Research Fellowship, received 2nd Place in the 2013 Semantic Web Challenge for his work on ConstituteProject.org, Best Student Research Paper at the 2014 International Semantic Web Conference and the 2015 Best Transfer and Innovation Project awarded by Institute for Applied Informatics. Juan is the General Chair of 2018 Alberto Mendelzon Workshop on Foundations of Databases (AMW2018), was the PC chair of the ISWC 2017 In-Use track, is on the Editorial Board of the Journal of Web Semantics and member of multiple program committees (ISWC, ESWC, WWW, AAAI, IJCAI). Juan is a member of the Linked Data Benchmark Council (LDBC) Graph Query Languages task force and has also been an invited expert and standards editor at the World Wide Web Consortium (W3C)."]},"fulltext":"Integrating Semantic Web in the Real World: A journey between two cities","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Integrating_Semantic_Web_in_the_Real_World:_A_journey_between_two_cities","namespace":0,"exists":"1","displaytitle":"Integrating Semantic Web in the Real World: A journey between two cities"},"Integration and Evaluation of an ASP-Solver as an Alternative Reasoning Backend in the Rulewerk Toolkit":{"printouts":{"Start":[{"timestamp":"1608210000","raw":"1\/2020\/12\/17\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1608215400","raw":"1\/2020\/12\/17\/14\/30\/0\/0"}],"title":["Integration and Evaluation of an ASP-Solver as an Alternative Reasoning Backend in the Rulewerk Toolkit"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Steffen Breuer"],"Details":["This talk will be a BA thesis defence.\n\nRulewerk is a Java API, that is build to abstract the access to data sources for the rule-based reasoner VLog. Since the VLog reasoner is actively developed, there is always a need to evaluate potential improvements and to compare VLogs performance to other systems. A good way to make it way easier to compare multiple reasoners is to provide them easy access to the same and also diverse data sources.\nA potential first alternative reasoning backend is the ASP system Clingo. In this thesis I present a translation form the datalog-based input language of Rulewerk into the ASP-based input language of Clingo. I also show a direct comparison of the performance of both backends.\n\n\nThis talk will take place via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-Login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=56216&p=bb0e03e2\n\n\nwithout ZIH-Login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=56216&p=6efb2684"]},"fulltext":"Integration and Evaluation of an ASP-Solver as an Alternative Reasoning Backend in the Rulewerk Toolkit","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Integration_and_Evaluation_of_an_ASP-Solver_as_an_Alternative_Reasoning_Backend_in_the_Rulewerk_Toolkit","namespace":0,"exists":"1","displaytitle":"Integration and Evaluation of an ASP-Solver as an Alternative Reasoning Backend in the Rulewerk Toolkit"},"Interface between Logical Analysis of Data and Formal Concept Analysis":{"printouts":{"Start":[{"timestamp":"1571922000","raw":"1\/2019\/10\/24\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1571927400","raw":"1\/2019\/10\/24\/14\/30\/0\/0"}],"title":["Interface between Logical Analysis of Data and Formal Concept Analysis"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Radek Jano\u0161t\u00edk"],"Details":["Logical Analysis of Data and Formal Concept Analysis are separately developed methodologies based on different mathematical foundations. We show that the two methodologies utilize the same basic building blocks. That enables us to develop an interface between the two methodologies. We provide some preliminary benefits of the interface; most notably efficient algorithms for computing spanned patterns in Logical Analysis of Data using algorithms of Formal Concept Analysis."]},"fulltext":"Interface between Logical Analysis of Data and Formal Concept Analysis","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Interface_between_Logical_Analysis_of_Data_and_Formal_Concept_Analysis","namespace":0,"exists":"1","displaytitle":"Interface between Logical Analysis of Data and Formal Concept Analysis"},"Intertranslatability of Labeling-based Argumentation Semantics":{"printouts":{"Start":[{"timestamp":"1447939800","raw":"1\/2015\/11\/19\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1447943400","raw":"1\/2015\/11\/19\/14\/30\/0\/0"}],"title":["Intertranslatability of Labeling-based Argumentation Semantics"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Umer Mushtaq"],"Details":["Argumentation Frameworks (AFs) are a simle formalism for modelling the reasoning and argumentation process. Various AF semantics have been suggested with a view of arriving at coherent outcomes of the argumentation process. Two categories of semantics are well-known, extension-based semantics and labeling-based semantics. Translations between these semantics are an important area of interest. Dvorak and Woltran (2011) investigated the application of translations to extension-based semantics. In this work, we undertake investigations of the intertranslatability of labeling-based semantics including the unique status semantics and the correspondence between translation properties in extension and labeling-based semantics."]},"fulltext":"Intertranslatability of Labeling-based Argumentation Semantics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Intertranslatability_of_Labeling-based_Argumentation_Semantics","namespace":0,"exists":"1","displaytitle":"Intertranslatability of Labeling-based Argumentation Semantics"},"Introducing Existential Rules and Module Extraction":{"printouts":{"Start":[{"timestamp":"1450359000","raw":"1\/2015\/12\/17\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1450362600","raw":"1\/2015\/12\/17\/14\/30\/0\/0"}],"title":["Introducing Existential Rules and Module Extraction"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Stathis Delivorias"],"Details":["In this talk the general framework of Datalog with Existential Rules will be introduced, stressing out novel elements in comparison with Description Logics. An overview of the ongoing research in classification of the several languages will be given, as well as an outline of the problem of module extraction in Existential Rules, laying out the main aims of this PhD thesis."]},"fulltext":"Introducing Existential Rules and Module Extraction","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Introducing_Existential_Rules_and_Module_Extraction","namespace":0,"exists":"1","displaytitle":"Introducing Existential Rules and Module Extraction"},"Introducing a Semantic Web Portal for Everyone":{"printouts":{"Start":[{"timestamp":"1414421400","raw":"1\/2014\/10\/27\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1414425000","raw":"1\/2014\/10\/27\/15\/50\/0\/0"}],"title":["Introducing a Semantic Web Portal for Everyone (in Logic) (at TU Dresden)"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Markus Kr\u00f6tzsch"],"Details":["This talk introduces the new Web portal of the International Center for Computational Logic – an umbrella for several logic-related research groups at TU Dresden. The site is a modern, \"mobile first\" Web portal that presents information about research and teaching. Highlights include personal pages, publications, research projects, a thesis topic browser, and many more. All of this is heavily interlinked and thus easy to find for people as well as for Web search engines. In addition, the site presents all of its contents in both English and German.\n\n\nRegistered users can easily edit the site through their Web browsers. Most content types can be edited through self-explaining forms, but it is also possible to add free-form pages. The underlying system is extremely flexible and can be adapted and extended online without any server-side programming. The talk will give an overview on how this works and help those with accounts to edit the site.\n\nYou may want to bring your wifi-connected laptop to try it yourself."]},"fulltext":"Introducing a Semantic Web Portal for Everyone","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Introducing_a_Semantic_Web_Portal_for_Everyone","namespace":0,"exists":"1","displaytitle":"Introducing a Semantic Web Portal for Everyone (in Logic) (at TU Dresden)"},"Introducing the Gitlab installation on https:\/\/iccl-share.inf.tu-dresden.de":{"printouts":{"Start":[{"timestamp":"1423493400","raw":"1\/2015\/2\/9\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1423498800","raw":"1\/2015\/2\/9\/16\/20\/0\/0"}],"title":["Introducing the Gitlab installation on https:\/\/iccl-share.inf.tu-dresden.de"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Lukas Schweizer"],"Details":["I would like to introduce you to the Gitlab installation on https:\/\/iccl-share.inf.tu-dresden.de\/\n\nIt is supposed to be the collaboration platform to work on papers \/ theses \/ code in our groups as well as with external researchers.\n\nTherefore, if you like, bring your notebook and get your hands on. It is meant to be an open discussion, ideally we can identify whether this portal fits to our needs,\nor if there are some requirements which are not satisfiable yet."]},"fulltext":"Introducing the Gitlab installation on https:\/\/iccl-share.inf.tu-dresden.de","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Introducing_the_Gitlab_installation_on_https:\/\/iccl-share.inf.tu-dresden.de","namespace":0,"exists":"1","displaytitle":"Introducing the Gitlab installation on https:\/\/iccl-share.inf.tu-dresden.de"},"Introduction to p-adic numbers and analysis":{"printouts":{"Start":[{"timestamp":"1562765400","raw":"1\/2019\/7\/10\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1562770800","raw":"1\/2019\/7\/10\/15\/0\/0\/0"}],"title":["Introduction to p-adic numbers and analysis"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Anton Clau\u00dfnitzer"],"Details":["The p-adic numbers (where p is a prime number) can be seen as one possible link between number theory and analysis. They therefore play an important role in various mathematical areas. The so-called strong triangle inequality of the p-adic absolute value (|a+b|\u2264max(|a|,|b|) for p-adic numbers a and b) has many strange and surprising consequences.\nIn our talk, we give the definition of p-adic numbers, several elementary results on p-adic functional analysis and a short overwiev on possible applications."]},"fulltext":"Introduction to p-adic numbers and analysis","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Introduction_to_p-adic_numbers_and_analysis","namespace":0,"exists":"1","displaytitle":"Introduction to p-adic numbers and analysis"},"Navigating ASP Solution Spaces":{"printouts":{"Start":[{"timestamp":"1688641200","raw":"1\/2023\/7\/6\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1688644800","raw":"1\/2023\/7\/6\/12\/0\/0\/0"}],"title":["Investigating the finite-cliquewidth-model property of C\u00b2."],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Vincent Peth"],"Details":["Abstract: I will try to explain to you the results of my internship on 2-variable logics (with counters) and how it interfaces with the cliquewidth notion. \n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Navigating ASP Solution Spaces","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Navigating_ASP_Solution_Spaces","namespace":0,"exists":"1","displaytitle":"Investigating the finite-cliquewidth-model property of C\u00b2."},"Justifying All Differences Using Pseudo-Boolean Reasoning":{"printouts":{"Start":[{"timestamp":"1576594800","raw":"1\/2019\/12\/17\/15\/0\/0\/0"}],"Ende":[{"timestamp":"1576598400","raw":"1\/2019\/12\/17\/16\/0\/0\/0"}],"title":["Justifying All Differences Using Pseudo-Boolean Reasoning"],"Room":[{"fulltext":"APB 2028","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2028","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Stephan Gocht"],"Details":["Constraint programming solvers support rich global constraints and propagators, which make them both powerful and hard to debug. In the Boolean satisfiability community, prooflogging is the standard solution for generating trustworthy outputs, and this has become key to the social acceptability of computer-generated proofs. However, reusing this technology for constraint programming requires either much weaker propagation, or an impractical blowup in proof length.\nThis paper demonstrates that simple, clean, and efficient proof logging is still possible for the all-different constraint, through pseudo-Boolean reasoning. We explain how such proofs can be expressed and verified mechanistically, describe an implementation, and discuss the broader implications for proof logging in constraint programming."]},"fulltext":"Justifying All Differences Using Pseudo-Boolean Reasoning","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Justifying_All_Differences_Using_Pseudo-Boolean_Reasoning","namespace":0,"exists":"1","displaytitle":"Justifying All Differences Using Pseudo-Boolean Reasoning"},"KLM-Style Defeasible Reasoning":{"printouts":{"Start":[{"timestamp":"1658401200","raw":"1\/2022\/7\/21\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1658404800","raw":"1\/2022\/7\/21\/12\/0\/0\/0"}],"title":["KLM-Style Defeasible Reasoning"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Tommie Meyer"],"Details":["This talk will give an overview of KLM-style defeasible reasoning, a form of non-monotonic reasoning initially introduced by Kraus, Lehmann, and Magidor. The overview will start with the propositional roots of defeasible reasoning and its links with the theory of Belief Revision. I will then discuss its application to description logics and other fragments of first-order logic, and the challenges inherent in lifting the intuition underlying propositional versions of defeasible reasoning to more expressive logics.\n\nThe talk will take place in a hybrid fashion, physically in our seminar room, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"KLM-Style Defeasible Reasoning","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/KLM-Style_Defeasible_Reasoning","namespace":0,"exists":"1","displaytitle":"KLM-Style Defeasible Reasoning"},"Knowledge Dynamics in Social Environments":{"printouts":{"Start":[{"timestamp":"1569502800","raw":"1\/2019\/9\/26\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1569508200","raw":"1\/2019\/9\/26\/14\/30\/0\/0"}],"title":["Knowledge Dynamics in Social Environments"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Maria Vanina Martinez"],"Details":["'''Abstract:'''\nSocial media platforms, taken in conjunction, can be seen as complex networks; in this context, understanding how agents react to sentiments expressed by their connections is of great interest. Here, we show how Network Knowledge Bases help represent the integration of multiple social networks, and explore how information flow can be handled via belief revision operators for local (agent-specific) knowledge bases. We report on preliminary experiments on Twitter data showing that different agent types react differently to the same information \u2014 this is a first step toward developing tools to predict how agents behave as information flows in their social environment.\n\n'''Bio:'''\nMaria Vanina Martinez, University of Buenos Aires, Argentina."]},"fulltext":"Knowledge Dynamics in Social Environments","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Knowledge_Dynamics_in_Social_Environments","namespace":0,"exists":"1","displaytitle":"Knowledge Dynamics in Social Environments"},"Knowledge Graph Curation and Reasoning using the Example of the Scholarly Domain":{"printouts":{"Start":[{"timestamp":"1580389200","raw":"1\/2020\/1\/30\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1580394600","raw":"1\/2020\/1\/30\/14\/30\/0\/0"}],"title":["Knowledge Graph Curation and Reasoning using the Example of the Scholarly Domain"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Sahar Vahdati"],"Details":["Knowledge graphs allow organisations and enterprises to integrate their internal and external heterogeneous sources of information into a unified form and enable analytics and discovery of unknown knowledge. To exploit the information encoded in knowledge graphs, analysis of the graph structure as well as the semantics of the represented relations, is required. I will show this using the scholarly domain as an example. The heterogeneity of scholarly artifacts and their metadata spread over different Web data sources serve as a great use case platform for data analytics and reasoning methods. In this talk, I will first have a look into major challenges of this domain using KG creation and curation leveraging semantic Web technologies. I will further showcase the application of Knowledge Graph Embedding models for link prediction scenarios of this domain."]},"fulltext":"Knowledge Graph Curation and Reasoning using the Example of the Scholarly Domain","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Knowledge_Graph_Curation_and_Reasoning_using_the_Example_of_the_Scholarly_Domain","namespace":0,"exists":"1","displaytitle":"Knowledge Graph Curation and Reasoning using the Example of the Scholarly Domain"},"TBA2":{"printouts":{"Start":[{"timestamp":"1549544400","raw":"1\/2019\/2\/7\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1549549800","raw":"1\/2019\/2\/7\/14\/30\/0\/0"}],"title":["Knowledge Graph Embedding"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Michael Cochez"],"Details":["'''Abstract''': Recently graph embeddings have been taken up by the community as a tool to solve various tasks in machine learning and the general AI community. In this talk I will give a gentle introduction to the topic and also give some pointers to currently ongoing research. We start from looking at why graph embeddings are needed in the first place and how they could be used. We will then focus on graphs containing a large variety of information, typically called knowledge graphs, often represented in RDF. These graphs are hard to embed compared to e.g., uniform simple networks) because they contain multiple edge and vertex types, relation directionality, literals, etc. What we will cover are a few basic techniques on how these embeddings can be computed. We plan to look into at least one example of translational based methods, one from matrix decomposition, and methods based on co-occurrence and statistical information. Finally we will discuss about a couple of open problems and some of the topics currently worked on.\n\n\n'''Short biography''': Michael Cochez is a postdoctoral researcher at the Fraunhofer Institute for Applied Information Technology FIT in Germany. In this position Michael is working on transferring research results from the academic world to the industry. Besides the industry exposure, he conducts research in areas related to data analysis and knowledge representation, like knowledge graph embedding, scalable clustering, frequent itemset mining, stream sampling, prototype-based ontologies, ontology matching, and knowledge evolution. This research is currently mainly conducted at the RWTH Aachen university, Germany. Before joining Fraunhofer, he obtained his Ph.D. degree from the University of Jyv\u00e4sky\u00e4, Finland under the supervision of Vagan Terziyan and Ferrante Neri (De Montfort University - Leicester). He obtained his master degree from the same university and his bachelor degree from the University of Antwerp, Belgium. Michael Cochez is currently on a partial leave from a postdoc at the University of Jyv\u00e4skyl\u00e4 and is also a scientific advisor for WE-OPT-IT Oy (former MyOpt Oy) in Finland."]},"fulltext":"TBA2","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/TBA2","namespace":0,"exists":"1","displaytitle":"Knowledge Graph Embedding"},"Knowledge Graphs for AI: Wikidata and Beyond":{"printouts":{"Start":[{"timestamp":"1613048400","raw":"1\/2021\/2\/11\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1613053800","raw":"1\/2021\/2\/11\/14\/30\/0\/0"}],"title":["Knowledge Graphs for AI: Wikidata and Beyond"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Markus Kr\u00f6tzsch"],"Details":["Abstract:\n\"Wikidata, the knowledge graph of Wikimedia, has successfully grown from an experimental \u201cdata wiki\u201d to a well-organized reference knowledge base with a large and active editor community as well as many academic and industrial uses. It is also a key ingredient of popular AI applications, most prominently of intelligent agents such as Apple's Siri or Amazon's Alexa. Of course, human knowledge is fully expected to be in high demand in this time of rapidly advancing AI. And yet, the fact that modern AI relies on the manual labor of thousands of human knowledge modelers is in stark contrast to the common narrative of AI in popular media, which tells us that methods of pattern recognition and statistical function approximation can produce intelligent behavior from unstructured data without much human intervention. However, Wikidata is not a singular exception to the trend but rather a specific solution to a general need of AI: the need for knowledge that is understandable to humans and accessible to computers. Almost every major AI application incorporates such knowledge, and organizations long have realized the need to acquire and develop knowledge resources as part of their AI strategy. The next frontier in AI is the ability of systems to explain and justify their behavior. There, too, we can see the need for knowledge-based technologies as a bridge between human understanding and computational mechanisms, but the task goes far beyond the realms of knowledge representation or machine learning, and will require the effort of all of AI and maybe all of computer science.\n\nIn my talk, I will give an overview of Wikidata and other knowledge-based technologies in AI, and outline some ongoing research efforts that combine knowledge representation with other methods towards the creation of (more) understandable and accountable AI.\"\n\n\n\nThis talk will have a duration of approximately 45 minutes and takes place via BigBlueButton. To access the room, use one of the following links: \n\nwith ZIH-Login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=82158&p=3d86e9c8\n\nwithout ZIH-Login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=82158&p=506714c8"]},"fulltext":"Knowledge Graphs for AI: Wikidata and Beyond","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Knowledge_Graphs_for_AI:_Wikidata_and_Beyond","namespace":0,"exists":"1","displaytitle":"Knowledge Graphs for AI: Wikidata and Beyond"},"Knowledge graphs: description, validation and subsetting":{"printouts":{"Start":[{"timestamp":"1696503600","raw":"1\/2023\/10\/5\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1696507200","raw":"1\/2023\/10\/5\/12\/0\/0\/0"}],"title":["Knowledge graphs: description, validation and subsetting"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Jose Emilio Labra Gayo"],"Details":["Abstract: Knowledge graphs like Wikidata have reached great success in the representation and integration of vast amounts of information from different domains. The use of flexible data models, without predefined schemas facilitates the aggregation of data from heterogeneous sources. However, the lack of schemas also undermines the quality of the data available in knowledge graphs. Many times, data curators have an implicit schema that can describe the data and be used to check the conformance of the data. The Shape Expressions (ShEx) language was created with the goal to describe and validate RDF and was adopted by Wikidata in the Entity Schemas namespace. In this talk, we will briefly present the ShEx language and show some applications. More specifically, we will show how ShEx can be used to describe and generate Wikidata subsets, which can help the use of Wikidata as a research source.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Knowledge graphs: description, validation and subsetting","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Knowledge_graphs:_description,_validation_and_subsetting","namespace":0,"exists":"1","displaytitle":"Knowledge graphs: description, validation and subsetting"},"Learning Description Logic Ontologies via Queries":{"printouts":{"Start":[{"timestamp":"1472655000","raw":"1\/2016\/8\/31\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1472658600","raw":"1\/2016\/8\/31\/15\/50\/0\/0"}],"title":["Learning Description Logic Ontologies via Queries"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Ana Ozaki"],"Details":["We study the problem of learning Description Logic (DL) ontologies in Angluin et al.\u2019s framework of exact learning via membership and equivalence queries posed to an oracle. Our quest is on investigating whether DL ontologies can be exactly learned in polynomial time or, at least, with polynomially many polynomial size queries to an oracle. We consider two instances of the problem:\n\n* in the first instance we admit entailment queries \u201cis a given subsumption entailed by the unknown target DL ontology?\u201d and equivalence queries \u201cis a given DL ontology equivalent to the target DL ontology?\u201d. Assuming that the vocabulary and DL L of the target ontology are known, we study polynomial learnability of ontologies in L;\n\n* in the second instance we admit membership queries of the form \u201cis a tuple a of individuals a certain answer to a data retrieval query q in a given data set and the unknown target DL ontology?\u201d and equivalence queries of the form \u201cis a given DL ontology equivalent to the target DL ontology?\u201d. Given the DL L, the data retrieval query language Q and the vocabulary of the target ontology, we study polynomial learnability of ontologies in L using data retrieval queries in Q.\n\nIn both instances of the problem, we provide an almost complete classification for DLs that are fragments of ELH and of DL-Lite. Some results are proved by non-trivial reductions to the first instance of the problem, described above."]},"fulltext":"Learning Description Logic Ontologies via Queries","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Learning_Description_Logic_Ontologies_via_Queries","namespace":0,"exists":"1","displaytitle":"Learning Description Logic Ontologies via Queries"},"Learning Ontologies with Epistemic Reasoning: The EL Case":{"printouts":{"Start":[{"timestamp":"1548235800","raw":"1\/2019\/1\/23\/9\/30\/0\/0"}],"Ende":[{"timestamp":"1548241200","raw":"1\/2019\/1\/23\/11\/0\/0\/0"}],"title":["Learning Ontologies with Epistemic Reasoning: The EL Case"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Ana Ozaki"],"Details":["'''Abstract''': We investigate the problem of learning description logic ontologies from entailments via queries, using epistemic reasoning. We introduce a new learning model consisting of epistemic membership and example queries and show that polynomial learnability in this model coincides with polynomial learnability in Angluin\u2019s exact learning model with membership and equivalence queries. We then instantiate our learning framework to EL and show some complexity results for an epistemic extension of EL where epistemic operators can be applied over the axioms. Finally, we transfer known results for EL ontologies and its fragments to our learning model based on epistemic reasoning."]},"fulltext":"Learning Ontologies with Epistemic Reasoning: The EL Case","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Learning_Ontologies_with_Epistemic_Reasoning:_The_EL_Case","namespace":0,"exists":"1","displaytitle":"Learning Ontologies with Epistemic Reasoning: The EL Case"},"Learning Word Representation in Compositional Matrix-Space Models":{"printouts":{"Start":[{"timestamp":"1523538000","raw":"1\/2018\/4\/12\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1523543400","raw":"1\/2018\/4\/12\/14\/30\/0\/0"}],"title":["Learning Word Representation in Compositional Matrix-Space Models"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Shima Asaadi"],"Details":["Learning word representations to capture the semantics and compositionality of language has received much research interest in natural language processing. Beyond the popular vector space models for word representations and compositionality, Compositional Matrix-Space Models (CMSMs) have been proposed. In this talk, I introduce the principle idea of CMSM and its application in NLP tasks. Then, I address the problem of learning matrix representation of words in CMSMs for the task of fine-grained sentiment analysis. I show that our approach, which learns the word matrices gradually in two steps, outperforms other approaches in CMSMs in terms of quality and computational cost."]},"fulltext":"Learning Word Representation in Compositional Matrix-Space Models","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Learning_Word_Representation_in_Compositional_Matrix-Space_Models","namespace":0,"exists":"1","displaytitle":"Learning Word Representation in Compositional Matrix-Space Models"},"Learning in Fuzzy Description Logics":{"printouts":{"Start":[{"timestamp":"1431511200","raw":"1\/2015\/5\/13\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1431516600","raw":"1\/2015\/5\/13\/11\/30\/0\/0"}],"title":["Learning in Fuzzy Description Logics"],"Room":[{"fulltext":"APB 0005","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_0005","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Francesca Alessandra Lisi"],"Details":["Incompleteness and vagueness are inherent properties of knowledge in several real-world domains and are particularly pervading in those domains where entities could be better described in natural language. The issues raised by incomplete and vague knowledge have been traditionally addressed in the field of Knowledge Representation within the stream of research devoted to fuzzy Description Logics (DLs). However, the problem of automatically managing the evolution of fuzzy DL ontologies still remains relatively unaddressed. In this talk, I present a method for inducing fuzzy GCI axioms from any crisp DL knowledge base. The method has been implemented and applied on real-world data in the tourism domain."]},"fulltext":"Learning in Fuzzy Description Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Learning_in_Fuzzy_Description_Logics","namespace":0,"exists":"1","displaytitle":"Learning in Fuzzy Description Logics"},"Logic for Database Systems Implementation (or Life beyond Lite Logics and CQ\/UCQ)":{"printouts":{"Start":[{"timestamp":"1415026200","raw":"1\/2014\/11\/3\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1415029800","raw":"1\/2014\/11\/3\/15\/50\/0\/0"}],"title":["Logic for Database Systems Implementation"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["David Toman"],"Details":["'''Logic for Database Systems Implementation (or Life beyond Lite Logics and CQ\/UCQ)'''\n\n\nAn important part of database technology is the requirement that only a logical appreciation of data is necessary on the part of application developers. This allows the formulating queries (and update requests) without information relating to concrete data sources and their low-level interfaces.\n\nA fundamental problem---called query compilation--must therefore be addressed by such systems, the problem of translating user requests over purely conceptual and domain specific ways of understanding of data, commonly called logical designs, to efficient executable programs, called query plans, responsible for evaluating the requests by accessing various concrete data sources through their low-level often iterator-based interfaces. An appreciation of the concrete data sources, their interfaces, and how such capabilities relate to logical design is in turn called a physical design.\n\nIn the talk we explore how standard KR approaches, such as ODBA-style querying, relate to the above problem and how KR (and Logic at large) techniques can serve as a cornerstone to a comprehensive solution to the query compilation problem. We (briefly) discuss range of topics from adaptations of theorem-proving techniques to low-level query optimizations, commonly considered beyond the reach of logical approaches to query compilation, and conclude with a list of interesting research topics."]},"fulltext":"Logic for Database Systems Implementation (or Life beyond Lite Logics and CQ\/UCQ)","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Logic_for_Database_Systems_Implementation_(or_Life_beyond_Lite_Logics_and_CQ\/UCQ)","namespace":0,"exists":"1","displaytitle":"Logic for Database Systems Implementation"},"Logic on MARS: Ontologies for Generalised Property Graphs":{"printouts":{"Start":[{"timestamp":"1493902800","raw":"1\/2017\/5\/4\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1493906400","raw":"1\/2017\/5\/4\/14\/0\/0\/0"}],"title":["Logic on MARS: Ontologies for Generalised Property Graphs"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Maximilian Marx"],"Details":["Graph-structured data is used to represent large information collections, called knowledge graphs, in many applications. Their exact format may vary, but they often share the concept that edges can be annotated with additional information, such as validity time or provenance information. Property Graph is a popular graph database format that also provides this feature. We give a formalization of a\ngeneralised notion of Property Graphs, called multi-attributed relational structures (MARS), and introduce a matching knowledge representation formalism, multi-attributed predicate logic (MAPL). We analyze the expressive power of MAPL and suggest a simpler, rule-based fragment of MAPL that can be used for ontological reasoning on Property Graphs. To the best of our knowledge, this is the first approach to making Property Graphs and related data structures accessible to symbolic AI."]},"fulltext":"Logic on MARS: Ontologies for Generalised Property Graphs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Logic_on_MARS:_Ontologies_for_Generalised_Property_Graphs","namespace":0,"exists":"1","displaytitle":"Logic on MARS: Ontologies for Generalised Property Graphs"},"Logical Foundations of Linked Data Anonymisation":{"printouts":{"Start":[{"timestamp":"1502719200","raw":"1\/2017\/8\/14\/14\/0\/0\/0"}],"Ende":[{"timestamp":"1502722800","raw":"1\/2017\/8\/14\/15\/0\/0\/0"}],"title":["Logical Foundations of Linked Data Anonymisation"],"Room":[{"fulltext":"APB 1004","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_1004","namespace":0,"exists":"1","displaytitle":"Raum APB 1004"}],"Type":["Vortrag"],"Speaker":["Bernardo Cuenca Grau"],"Details":["The widespread adoption of the Linked Data paradigm has been driven by the increasing demand for information exchange between organisations, as well as by regulations in domains such as health care and governance that require certain data to be published. In this setting, sensitive information is at high risk of disclosure since published data can be often seamlessly linked with arbitrary external data sources.\n\n\nIn this talk I will discuss the logical foundations of privacy-preserving data publishing (PPDP) in the context of Linked Data. Specifically, we consider anonymisations of RDF graphs (and, more generally, relational datasets with labelled nulls) and define notions of safe and optimal anonymisations. Safety ensures that an anonymised dataset can be published with provable protection guarantees against linking attacks, whereas optimality ensures that the published data preserves as much information from the original data as possible, while still satisfying the safety requirement. I will establish the computational complexity of the underpinning decision problems both under the open-world semantics inherent to RDF and a closed-world semantics, where we assume that an attacker has complete knowledge over some part of the original data."]},"fulltext":"Logical Foundations of Linked Data Anonymisation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Logical_Foundations_of_Linked_Data_Anonymisation","namespace":0,"exists":"1","displaytitle":"Logical Foundations of Linked Data Anonymisation"},"Logik geht durch den Magen -- modeling interesting phenomena in (not only) food computing":{"printouts":{"Start":[{"timestamp":"1702551600","raw":"1\/2023\/12\/14\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1702555200","raw":"1\/2023\/12\/14\/12\/0\/0\/0"}],"title":["Logik geht durch den Magen -- modeling interesting phenomena in (not only) food computing"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Weronika T. Adrian"],"Details":["Abstract: The emerging field of food computing tackles, among others, problems of knowledge acquisition, modeling, and processing within the culinary domain. Food-related knowledge is often implicit, contextual, or culture-dependent. Making at least part of it explicit, with some formalization, opens up possibilities to develop intelligent knowledge-based solutions to assist humans in preparing and optimizing food. An interesting and relevant problem is searching for substitutions in food recipes, a task motivated by different constraints and goals of a person, and leveraging the knowledge of dieticians and\/or food technologists.\nAddressing this challenge, the following questions emerge: What is relevant knowledge when it comes to food recommendations and AI-based decision support for ingredient substitution? Is there space for knowledge-based systems in the age of large language models? How to formally represent and reason about diets, allergies, and other restrictions? What food-related knowledge graphs and ontologies are there and are they useful for practical applications?\nIn this seminar, I will share my experience from the TAISTI project (\u201cDevelopment of a Technology based on Artificial Intelligence for inferring SubsTitutable recipe Ingredients\u201d, https:\/\/www.taisti.eu\/), in particular ontology and knowledge graph engineering, and logical reasoning over integrated knowledge. Apart from practical challenges, I will also discuss interesting questions about the similarity of entities -- a problem that goes beyond the domain of food. I will present the entity set expansion problem and discuss recent proposals for formally describing the similarity of instances in knowledge bases and retrieving more entities ``of the same kind''.\n\nSpeaker bio: Weronika T. Adrian, Ph.D. (wta@agh.edu.pl, http:\/\/wtadrian.eu, http:\/\/kraken.edu.pl) is an Assistant Professor and the Deputy Head of the Department of Applied Computer Science, Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering, AGH University of Krak\u00f3w, Poland. Her research interests cover the theory and practice of semantic technologies, knowledge graphs, and logic programming. She (co-)authored nearly 70 publications in the field of AI. Obtained her Ph.D. in Mathematics and Computer Science from the University of Calabria (Italy), followed by a 2-year post-doctoral contract in the group of Prof. Nicola Leone. Dr. Adrian has been involved in multiple national and international R&D projects and EU programs. She is a laureate of the \u201cTop 500 Innovators\u201d scholarship at Stanford University (USA). Founder of Creativity and Innovation Lab Foundation, a founder member of the Polish Artificial Intelligence Society, and a former member of IEEE.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Logik geht durch den Magen -- modeling interesting phenomena in (not only) food computing","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Logik_geht_durch_den_Magen_--_modeling_interesting_phenomena_in_(not_only)_food_computing","namespace":0,"exists":"1","displaytitle":"Logik geht durch den Magen -- modeling interesting phenomena in (not only) food computing"},"Lyndon words and density of runs":{"printouts":{"Start":[{"timestamp":"1481799600","raw":"1\/2016\/12\/15\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1481803200","raw":"1\/2016\/12\/15\/12\/0\/0\/0"}],"title":["Lyndon words and density of runs"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["\u0160t\u011bp\u00e1n Holub"],"Details":["The concept of Lyndon words is very useful in combinatorics on words. We shall illustrate that namely on the question asking how many maximal repetitions (called also \"runs\") a (binary) word can contain."]},"fulltext":"Lyndon words and density of runs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Lyndon_words_and_density_of_runs","namespace":0,"exists":"1","displaytitle":"Lyndon words and density of runs"},"Making Repairs in Description Logics More Gentle":{"printouts":{"Start":[{"timestamp":"1539869400","raw":"1\/2018\/10\/18\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1539873000","raw":"1\/2018\/10\/18\/14\/30\/0\/0"}],"title":["Making Repairs in Description Logics More Gentle"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Adrian Nuradiansyah"],"Details":["Abstract:\n\"The classical approach for repairing a Description Logic ontology O in the sense of removing an unwanted consequence \u03b1 is to delete a minimal number of axioms from O such that the resulting ontology O\u2032 does not have the consequence \u03b1. However, the complete deletion of axioms may be too rough, in the sense that it may also remove consequences that are actually wanted. To alleviate this problem, we propose a more gentle notion of repair in which axioms are not deleted but only weakened. On the one hand, we investigate the general properties of this gentle repair method. On the other hand, we propose and analyze concrete approaches for weakening axioms expressed in the Description Logic EL.\"\n\nThis is a rehearsal talk for KR 2018."]},"fulltext":"Making Repairs in Description Logics More Gentle","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Making_Repairs_in_Description_Logics_More_Gentle","namespace":0,"exists":"1","displaytitle":"Making Repairs in Description Logics More Gentle"},"Making sense of conflicting defeasible rules in the controlled natural language ACE: design of a system with support for existential quantification using skolemization":{"printouts":{"Start":[{"timestamp":"1554382800","raw":"1\/2019\/4\/4\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1554386400","raw":"1\/2019\/4\/4\/14\/0\/0\/0"}],"title":["Making sense of conflicting defeasible rules in the controlled natural language ACE: design of a system with support for existential quantification using skolemization"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Martin Diller"],"Details":["'''Abstract:''' We motivate and present the design of a system implementing what we (joint work with Hannes Strass previously at the University of Leipzig as well as Adam Z. Wyner at Swansea University) have dubbed the \"EMIL\" (acronym for \"extracting meaning out of inconsistent language\") pipeline. The pipeline in question takes potentially conflicting rules expressed in a fragment of a prominent controlled natural language, ACE, yet extended with means of expressing defeasible rules in the form of normality assumptions. It makes sense of such rules using a recently formulated argumentation-inspired semantics, verbalising possible points of view that can plausibly be held based on the rules in ACE. The approach we describe is ultimately based on reductions to answer-set-programming (ASP); simulating existential quantification by using skolemization in a manner resembling a translation for ASP formalized in the context of \u2203-ASP. We discuss the advantages of this approach to building on the existing ACE interface to rule-systems, ACERules.\n\n\n'''Bio:''' Martin Diller is finishing his PhD at TU Wien (Austria). The focus of his PhD has mainly been on implementing problems in (abstract and structured) argumentation via complexity-sensitive translations to logical formalisms (quantified boolean formulas and answer-set-programming). He holds a joint MSc degree in computational logic from TU Dresden, FU Bozen-Bolzano, and TU Wien. Before that he studied Philosophy & Computer Science at Universidad Nacional de C\u00f3rdoba, Argentina and was also briefly part of research groups in Epistemology & Computer Science there. He has also been at several other institutes and universities for internships and research stays working on applied argumentation & automated reasoning: UCL in London (England), University of Aberdeen (Scotland), and NICTA-Canberra (Australia)."]},"fulltext":"Making sense of conflicting defeasible rules in the controlled natural language ACE: design of a system with support for existential quantification using skolemization","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Making_sense_of_conflicting_defeasible_rules_in_the_controlled_natural_language_ACE:_design_of_a_system_with_support_for_existential_quantification_using_skolemization","namespace":0,"exists":"1","displaytitle":"Making sense of conflicting defeasible rules in the controlled natural language ACE: design of a system with support for existential quantification using skolemization"},"Managing and Consuming Completeness Information for RDF Data Sources":{"printouts":{"Start":[{"timestamp":"1479912600","raw":"1\/2016\/11\/23\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1479916200","raw":"1\/2016\/11\/23\/15\/50\/0\/0"}],"title":["Managing and Consuming Completeness Information for RDF Data Sources"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Fariz Darari"],"Details":["With more and more Semantic Web data being created every day gives rise to the question: How complete is the data? Though generally data on the Semantic Web is incomplete, many parts of data are indeed complete, such as the children of Barack Obama and the crew of Apollo 11. Such meta-information, is therefore, needed to be managed so that it may benefit the consumption of Semantic Web data. In this talk, we focus on the completeness aspect of Semantic Web data: how to manage and consume completeness information about Semantic Web data. In particular, we first discuss how completeness information can be used to guarantee the completeness of query answering. Next, we propose optimization techniques of completeness reasoning and conduct experimental evaluations to show the feasibility of our optimizations. We also provide a technique, to check whether queries with negation return sound answers, by using completeness information. We further enrich completeness information with timestamps, enabling query answers to be checked up to when they can be guaranteed to be complete. Finally, we develop practical tools to foster the adoption of our completeness framework in the Semantic Web community."]},"fulltext":"Managing and Consuming Completeness Information for RDF Data Sources","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Managing_and_Consuming_Completeness_Information_for_RDF_Data_Sources","namespace":0,"exists":"1","displaytitle":"Managing and Consuming Completeness Information for RDF Data Sources"},"Membership Constraints in Formal Concept Analysis":{"printouts":{"Start":[{"timestamp":"1439823000","raw":"1\/2015\/8\/17\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1439826600","raw":"1\/2015\/8\/17\/15\/50\/0\/0"}],"title":["Membership Constraints in Formal Concept Analysis"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Sebastian Rudolph"],"Details":["Formal Concept Analysis (FCA) is a prominent field of applied mathematics using object-attribute relationships to define formal concepts \u2014 groups of objects with common attributes \u2014 which can be ordered into conceptual hierarchies, so-called concept lattices. We consider the problem of satisfiability of membership constraints, i.e., to determine if a formal concept exists whose object and attribute set include certain elements and exclude others. We analyze the computational complexity of this problem in general and for restricted forms of membership constraints. We perform the same analysis for generalizations of FCA to incidence structures of arity three (objects, attributes and conditions) and higher. We present a generic answer set programming (ASP) encoding of the membership constraint satisfaction problem, which allows for deploying available highly optimized ASP tools for its solution. Finally, we discuss the importance of membership constraints in the context of navigational approaches to data analysis.\n\n\nThis talk is based on joint work with Diana Troanc\u0103."]},"fulltext":"Membership Constraints in Formal Concept Analysis","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Membership_Constraints_in_Formal_Concept_Analysis","namespace":0,"exists":"1","displaytitle":"Membership Constraints in Formal Concept Analysis"},"Metric Temporal Description Logics with Interval-Rigid Names":{"printouts":{"Start":[{"timestamp":"1499346000","raw":"1\/2017\/7\/6\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1499347800","raw":"1\/2017\/7\/6\/13\/30\/0\/0"}],"title":["Metric Temporal Description Logics with Interval-Rigid Names"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Ana Ozaki"],"Details":["In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow to formulate constraints on how long it may take until the property is satisfied. While most of the work on combining Description Logics (DLs) with temporal logics has concentrated on qualitative temporal logics, there has recently been a growing interest in extending this work to the quantitative case. In this paper, we complement existing results on the combination of DLs with metric temporal logics over the natural numbers by introducing interval-rigid names. This allows to state that elements in the extension of certain names stay in this extension for at least some specified amount of time."]},"fulltext":"Metric Temporal Description Logics with Interval-Rigid Names","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Metric_Temporal_Description_Logics_with_Interval-Rigid_Names","namespace":0,"exists":"1","displaytitle":"Metric Temporal Description Logics with Interval-Rigid Names"},"Minesweeper goes Kaboom (in ASP) - and what makes it difficult":{"printouts":{"Start":[{"timestamp":"1715857200","raw":"1\/2024\/5\/16\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1715860800","raw":"1\/2024\/5\/16\/12\/0\/0\/0"}],"title":["Minesweeper goes Kaboom (in ASP) - and what makes it difficult"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Antonio Hentschke"],"Details":["Kaboom is a fair Minesweeper game. The original Kaboom is implemented with a SAT solver, and we present an implementation in ASP (Answer Set Programming). We will derive a recommender heuristic and demonstrate the game. At the end we will discuss what makes Minesweeper and Kaboom difficult and how they differ in that regard."]},"fulltext":"Minesweeper goes Kaboom (in ASP) - and what makes it difficult","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Minesweeper_goes_Kaboom_(in_ASP)_-_and_what_makes_it_difficult","namespace":0,"exists":"1","displaytitle":"Minesweeper goes Kaboom (in ASP) - and what makes it difficult"},"Mining DL ontologies":{"printouts":{"Start":[{"timestamp":"1465984800","raw":"1\/2016\/6\/15\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1465988400","raw":"1\/2016\/6\/15\/11\/0\/0\/0"}],"title":["Mining DL ontologies"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Ulrike Sattler"],"Details":["In a variety of domains and for a variety of purposes, people are using Description Logics (DL) ontologies: depending on how we count, there are hundreds or thousands of them. Quite often, these ontologies have a rather lightweight class hierarchy, and come with data in the form of an ABox or are used together in applications with external data. In the presence of this data, a naturally arising question is whether we can\u2019t use this data to mine or learn general concept inclusion axioms, i.e., TBox axioms? And if yes, how can we do this, and how complex can these axioms be? In my talk, I will discuss these questions and describe our approach, which has been implemented in DL Miner. We aim at identifying hypotheses that capture interesting correlations in the data in the ontology. Our approach can be said to be logically and statistically sound: it works with DL\u2019s open world assumption, and identifies suitable hypotheses by regarding this as a multi-dimensional optimisation problem (e.g., we are after hypotheses that are maximally supported and minimally brave). I will explain the setting for this problem, our approach, and our experiences with DL Miner. I will assume that the audience has a basic understanding of DLs, but this talk should also be of interest to anybody with some understanding of First Order Logic. This is joint work with Slava (Viachaslau) Sazonau."]},"fulltext":"Mining DL ontologies","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Mining_DL_ontologies","namespace":0,"exists":"1","displaytitle":"Mining DL ontologies"},"Mixing Description Logics in Privacy-Preserving Ontology Publishing":{"printouts":{"Start":[{"timestamp":"1567688400","raw":"1\/2019\/9\/5\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1567692000","raw":"1\/2019\/9\/5\/14\/0\/0\/0"}],"title":["Mixing Description Logics in Privacy-Preserving Ontology Publishing"],"Room":[{"fulltext":"APB 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Adrian Nuradiansyah"],"Details":["In previous work, we have investigated privacy-preserving publishing of Description Logic (DL) ontologies in a setting where the knowledge about individuals to be published is an instance store, and both the privacy policy and the possible background knowledge of an attacker are represented by concepts of the DL . We have introduced the notions of compliance of a concept with a policy and of safety of a concept for a policy, and have shown how, in the context mentioned above, optimal compliant (safe) generalizations of a given concept can be computed. In the present paper, we consider a modified setting where we assume that the background knowledge of the attacker is given by a DL different from the one in which the knowledge to be published and the safety policies are formulated. In particular, we investigate the situations where the attacker\u2019s knowledge is given by an or an concept. In both cases, we show how optimal safe generalizations can be computed. Whereas the complexity of this computation is the same (ExpTime) as in our previous results for the case of , it turns out to be actually lower (polynomial) for the more expressive DL .\n\n\nJoint work with Franz Baader. This is also a test-talk for a presentation at KI 2019."]},"fulltext":"Mixing Description Logics in Privacy-Preserving Ontology Publishing","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Mixing_Description_Logics_in_Privacy-Preserving_Ontology_Publishing","namespace":0,"exists":"1","displaytitle":"Mixing Description Logics in Privacy-Preserving Ontology Publishing"},"Modal Separation Logic: an ongoing quest for elementary complexity":{"printouts":{"Start":[{"timestamp":"1533733200","raw":"1\/2018\/8\/8\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1533736800","raw":"1\/2018\/8\/8\/14\/0\/0\/0"}],"title":["Modal Separation Logic: an ongoing quest for elementary complexity"],"Room":[{"fulltext":"TBA","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/TBA","namespace":0,"exists":"1","displaytitle":"Standard and Non-Standard Inferences in the Description Logic FL0 Using Tree Automata"}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["The talk will be dedicated to my recent work on Quantified Computation Tree Logic (QCTL) with Stephane Demri (LSV at ENS P-S, France) and my ongoing work \nwith Stephane and Raul Fervari (Universidad Nacional de C\u00f3rdoba, Argentina) \non Modal Separation Logic (MSL).\n\n'''Abstract:''' Modal separation logic MSL is a logic introduced recently by Demri and Fervari \nin [DF-aiml18], whose models are memory states as in separation logic and \nthe logical connectives include modal operators as well as separating \nconjunction and magic wand. With these operators, some fragments of MSL can be \nseen as genuine modal logics whereas some others capture standard separation \nlogics, leading to an original language to speak about memory states. \nThe decidability status and the computational complexity of several fragments \nof MSL were established in [DF-aiml18], leading to surprising hardness or \neasiness results, obtained by designing proof methods that take into \naccount the modal and separation features of MSL.\n\nWe will focus on a fragment of MSL, where only <>^{-1} (predecessor) \nand * (separating conjunction) operators are allowed. It is not hard to see that\nsuch a fragment is decidable by employing a theorem about decidability of MSO \nwith one functional symbol. However the exact complexity of the logic remains \nunknown. During the talk I will present an approach to solve this problem by \ntranslating MSL into QCTL_EX, an extension of well-known CTL (where only EX \noperator is allowed) with propositional quantification. We will see how this \napproach failed, but as a sub-product we obtain several nice complexity and \nexpressivity results for QCTL_EX. We will also see what makes QCTL_EX hard \nand why there is still a chance that the mentioned fragment of MSL could \nhave an elementary complexity.\n\n[DF-aiml18] S. Demri and R. Fervari. On the complexity of modal separation logics. In AiML'18. College Publications, August 2018. To appear.\n\n'''Bio:''' Bartosz Bednarczyk - University of Wroc\u0142aw & LSV ENS Paris-Saclay & University of Oxford"]},"fulltext":"Modal Separation Logic: an ongoing quest for elementary complexity","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Modal_Separation_Logic:_an_ongoing_quest_for_elementary_complexity","namespace":0,"exists":"1","displaytitle":"Modal Separation Logic: an ongoing quest for elementary complexity"},"Modeling Computational Properties of Description Logics in ASP":{"printouts":{"Start":[{"timestamp":"1580288400","raw":"1\/2020\/1\/29\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1580293800","raw":"1\/2020\/1\/29\/10\/30\/0\/0"}],"title":["Modeling Computational Properties of Description Logics in ASP"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Mohamed Ibrahim"],"Details":["Tracking the increasing volume of research about Description logics is getting harder. Besides, those results interact together and can deduce new results. That is why we need a knowledge base to encode those results in a smart way and infer more results based on what we currently know. This talk presents an approach of how we can encode such information with the help of Answer Set Programming (ASP). In addition, we show how such a system can be integrated into a website that visualizes the current research results and the inferences made based on them. We end by analyzing this approach and suggesting some future work."]},"fulltext":"Modeling Computational Properties of Description Logics in ASP","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Modeling_Computational_Properties_of_Description_Logics_in_ASP","namespace":0,"exists":"1","displaytitle":"Modeling Computational Properties of Description Logics in ASP"},"Modeling Concept Learning Problems with Second-Order Description Logics":{"printouts":{"Start":[{"timestamp":"1431355800","raw":"1\/2015\/5\/11\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1431359400","raw":"1\/2015\/5\/11\/15\/50\/0\/0"}],"title":["Modeling Concept Learning Problems with Second-Order Description Logics"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Francesca Alessandra Lisi"],"Details":["Among the inferences studied in Description Logics (DLs), induction has been paid increasing attention over the last decade. Indeed, useful non-standard reasoning tasks can be based on the inductive inference. Among them, Concept Learning is about the automated induction of a description for a given concept starting from classified instances of the concept. In this talk I present a formal characterization of Concept Learning in DLs which relies on recent results in Knowledge Representation and Machine Learning. Based on second-order DLs, it allows for modeling Concept Learning problems as constructive DL reasoning tasks where the construction of the solution to the problem may be subject to optimality criteria."]},"fulltext":"Modeling Concept Learning Problems with Second-Order Description Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Modeling_Concept_Learning_Problems_with_Second-Order_Description_Logics","namespace":0,"exists":"1","displaytitle":"Modeling Concept Learning Problems with Second-Order Description Logics"},"Modelling Dynamics in Semantic Web Knowledge Graphs with Formal Concept Analysis":{"printouts":{"Start":[{"timestamp":"1522933200","raw":"1\/2018\/4\/5\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1522938600","raw":"1\/2018\/4\/5\/14\/30\/0\/0"}],"title":["Modelling Dynamics in Semantic Web Knowledge Graphs with Formal Concept Analysis"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Larry Gonzalez"],"Details":["In this paper, we propose a novel data-driven schema for large-scale heterogeneous knowledge graphs inspired by Formal Concept Analysis (FCA). We first extract the sets of properties associated with individual entities; these property sets (aka. characteristic sets) are annotated with cardinalities and used to induce a lattice based on set-containment relations, forming a natural hierarchical structure describing the knowledge graph. We then propose an algebra over such schema lattices, which allows to compute diffs between lattices (for example, to summarise the changes from one version of a knowledge graph to another), to add lattices (for example, to project future changes), and so forth. While we argue that this lattice structure (and associated algebra) may have various applications, we currently focus on the use-case of modelling and predicting the dynamic behaviour of knowledge graphs. We instantiate and evaluate our methods for analysing how versions of the Wikidata knowledge graph have changed over a period of 11 weeks. We propose algorithms for constructing the lattice-based schema from Wikidata, and evaluate their efficiency and scalability. We then evaluate use of the resulting schema(ta) for predicting how the knowledge graph will evolve in future versions.\n\n\nAuthors: Larry Gonzalez and Aidan Hogan"]},"fulltext":"Modelling Dynamics in Semantic Web Knowledge Graphs with Formal Concept Analysis","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Modelling_Dynamics_in_Semantic_Web_Knowledge_Graphs_with_Formal_Concept_Analysis","namespace":0,"exists":"1","displaytitle":"Modelling Dynamics in Semantic Web Knowledge Graphs with Formal Concept Analysis"},"Monotone Monadic SNP 1: Classical Results and Applications":{"printouts":{"Start":[{"timestamp":"1504271700","raw":"1\/2017\/9\/1\/13\/15\/0\/0"}],"Ende":[{"timestamp":"1504273500","raw":"1\/2017\/9\/1\/13\/45\/0\/0"}],"title":["Monotone Monadic SNP 1: Classical Results and Applications"],"Room":[{"fulltext":"WIL C115","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/WIL_C115","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Manuel Bodirsky"],"Details":["The logic MMSNP is a restricted fragment of existential second-order logic which allows to express many interesting queries in graph theory, database theory, and finite model theory. The logic was introduced by Feder and Vardi who showed that every MMSNP sentence is polynomially equivalent to a finite-domain constraint satisfaction problem (CSP); the clever probabilistic reduction was derandomized by Kun using explicit constructions of expander structures. Several authors have recently announced proofs that every finite-domain CSP is either in P or NP-complete; hence, the same is true for MMSNP.\n\n\nWe present a new proof of the complexity dichotomy for MMSNP. Our new proof has the advantage that it confirms a tractability conjecture by Pinsker and myself that we have made for a much larger class of computational problems. Another advantage is that it does not rely on the intricate expander constructions of Kun (but we do use the finite \ndomain CSP dichotomy). Our approach is based on the fact that every MMSNP sentence can be effectively rewritten into a finite union of CSPs for countably infinite omega-categorical structures; moreover, by a recent result of Hubi\u010dka and Ne\u0161et\u0159il, these structures can be expanded to homogeneous structures with finite relational signature and the Ramsey property. This allows us to use the universal-algebraic approach to study the computational complexity of MMSNP.\n\nIn this first part of the talk we will give an introduction to MMSNP with many examples and the classical results, including the Feder-Vardi reduction to finite-domain CSPs, but also usages of MMSNP to classify the complexity of problems that arose in the context of descriptions logics (by Bienvenu, ten Cate, Lutz, Wolter). In the second part, Antoine presents our new analysis of MMSNP sentences using the universal-algebraic approach and Ramsey theory."]},"fulltext":"Monotone Monadic SNP 1: Classical Results and Applications","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Monotone_Monadic_SNP_1:_Classical_Results_and_Applications","namespace":0,"exists":"1","displaytitle":"Monotone Monadic SNP 1: Classical Results and Applications"},"Monotone Monadic SNP 2: Proof of the Universal-algebraic Dichotomy Conjecture":{"printouts":{"Start":[{"timestamp":"1504273500","raw":"1\/2017\/9\/1\/13\/45\/0\/0"}],"Ende":[{"timestamp":"1504275300","raw":"1\/2017\/9\/1\/14\/15\/0\/0"}],"title":["Monotone Monadic SNP 2: Proof of the Universal-algebraic Dichotomy Conjecture"],"Room":[{"fulltext":"WIL C115","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/WIL_C115","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Antoine Mottet"],"Details":["The forbidden patterns problem of the set of vertex-coloured graphs {H1,\u2026,Hk} is the decision problem of the form: given a finite graph G as input, is it possible to colour the vertices of G in a way that none of H1, \u2026, Hk homomorphically maps to the resulting coloured graph. The logic MMSNP can be seen as a complexity class whose problems are forbidden patterns problems of finite sets of coloured relational structures. It was conjectured by Feder and Vardi that this complexity class exhibits a complexity dichotomy (i.e., that every forbidden patterns problem is in P or NP-complete). Feder and Vardi showed that every problem in MMSNP reduces in probabilistic polynomial-time to the CSP of a structure with finite domain, and Kun later derandomized this reduction. Thus, MMSNP and finite-domain CSPs are computationally equivalent.\n\n\nFollowing up on Manuel's talk, I will present a completely new reduction from MMSNP to finite-domain CSPs that uses recent techniques and results from universal algebra, model theory, and Ramsey theory. This proves a stronger form of the Feder-Vardi-Kun result, and shows in particular that the Bodirsky-Pinsker tractability conjecture holds for all CSPs in MMSNP."]},"fulltext":"Monotone Monadic SNP 2: Proof of the Universal-algebraic Dichotomy Conjecture","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Monotone_Monadic_SNP_2:_Proof_of_the_Universal-algebraic_Dichotomy_Conjecture","namespace":0,"exists":"1","displaytitle":"Monotone Monadic SNP 2: Proof of the Universal-algebraic Dichotomy Conjecture"},"Most Probable Explanations for Probabilistic Database Queries":{"printouts":{"Start":[{"timestamp":"1496322000","raw":"1\/2017\/6\/1\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1496325600","raw":"1\/2017\/6\/1\/14\/0\/0\/0"}],"title":["Most Probable Explanations for Probabilistic Database Queries"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Ismail Ilkan Ceylan"],"Details":["Forming the foundations of large-scale knowledge bases, probabilistic databases have been widely studied in the literature. In particular, probabilistic query evaluation has been investigated intensively as a central inference mechanism. However, despite its power, query evaluation alone cannot extract all the relevant information encompassed in large-scale knowledge bases. To exploit this potential, we study two inference tasks; namely finding the most probable database and the most probable hypothesis for a given query. As natural counterparts of most probable explanations (MPE) and maximum a posteriori hypotheses (MAP) in probabilistic graphical models, they can be used in a variety of applications that involve prediction or diagnosis tasks. We investigate these problems relative to a variety of query languages, ranging from conjunctive queries to ontology-mediated queries, and provide a detailed complexity analysis."]},"fulltext":"Most Probable Explanations for Probabilistic Database Queries","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Most_Probable_Explanations_for_Probabilistic_Database_Queries","namespace":0,"exists":"1","displaytitle":"Most Probable Explanations for Probabilistic Database Queries"},"TBA6":{"printouts":{"Start":[{"timestamp":"1603976400","raw":"1\/2020\/10\/29\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1603981800","raw":"1\/2020\/10\/29\/14\/30\/0\/0"}],"title":["Multi-Context Stream Reasoning"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Stefan Ellmauthaler"],"Details":["The field of artificial intelligence and knowledge representation (KR) has originated a high variety of formalisms, notions, languages, and formats during the past decades. Each approach has been motivated and designed with specific applications in mind. Nowadays, in the century of Industry 4.0, the Internet of Things, and Smart-devices, we are interested in ways to connect the various approaches and allow them to distribute and exchange their knowledge and beliefs in an uniform way. In addition most information is provided continuously over time in streams of data. This leads to the problem that these sophisticated knowledge representation approaches cannot understand each others point of views, their positions on semantics are not necessarily compatible either, and most formalisms are designed as one-shot computations. These three problems between different KR-formalisms has been tackled by the concept of stream-aware Multi-Context Systems, which allow methods to transfer information under a strong and generalised notion of semantics over time.\n\n\nStefan Ellmauthaler is a post-doctoral researcher in the group of Gerhard Brewka in Leipzig. He received his B.Sc. in 'Medicine and Computer Science' and his diploma in 'Computational Intelligence' at the Vienna University of Technology. His doctoral thesis 'Multi-Context Reasoning in Continuous Data-Flow Environments' has been supervised by Gerhard Brewka at the Leipzig University. Currently his research fields are abstract argumentation, logic programming, multi-context systems, and hybrid reasoning approaches like stream reasoning and reactive reasoning.\n\n\nThe talk will take place online. If there is any interest in attending, please send an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"TBA6","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/TBA6","namespace":0,"exists":"1","displaytitle":"Multi-Context Stream Reasoning"},"Multi-Cultural Commonsense Knowledge Base Construction":{"printouts":{"Start":[{"timestamp":"1723114800","raw":"1\/2024\/8\/8\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1723118400","raw":"1\/2024\/8\/8\/12\/0\/0\/0"}],"title":["Multi-Cultural Commonsense Knowledge Base Construction"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Simon Razniewski"],"Details":["Commonsense knowledge (CSK) about concepts and their properties is useful for AI applications such as robust dialogue. Prior works like ConceptNet, TupleKB and others compiled noteworthy commonsense knowledge bases (CSKBs), but are restricted in their expressiveness to subject-predicate-object (SPO) triples with simple concepts for S and monolithic strings for P and O. Also, these projects have either prioritized precision or recall, but hardly reconcile these complementary goals. In this talk I will present several of our CSKB construction works (DICE, ASCENT, CANDLE, MANGO), where we automatically build large-scale CSKBs with advanced expressiveness and both better precision and recall than prior works.\n\nIn DICE, we introduce multi-faceted scoring, and joint reasoning for consistency and corroboration. With ASCENT, we go beyond triples by capturing composite concepts with subgroups and aspects, and by refining assertions with semantic facets. CANDLE focuses on multi-cultural CSK, while MANGO unifies the entity-centric model of ASCENT and the culture-centric model of CANDLE.\n\nThe works rely on a combination of textual information extraction and knowledge distillation from LLMs. Intrinsic evaluation shows the superior size and quality of our CSKBs, and extrinsic use cases prove their utility for retrieval-augmented generation.\n\nLinks:\n\nProject overview: https:\/\/www.mpi-inf.mpg.de\/commonsense\n\nAscent: https:\/\/ascent.mpi-inf.mpg.de\n\nCandle: https:\/\/candle.mpi-inf.mpg.de\n\nMango: https:\/\/bit.ly\/cultural-csk"]},"fulltext":"Multi-Cultural Commonsense Knowledge Base Construction","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Multi-Cultural_Commonsense_Knowledge_Base_Construction","namespace":0,"exists":"1","displaytitle":"Multi-Cultural Commonsense Knowledge Base Construction"},"Multilinguality in Knowledge Graphs":{"printouts":{"Start":[{"timestamp":"1676545200","raw":"1\/2023\/2\/16\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1676548800","raw":"1\/2023\/2\/16\/12\/0\/0\/0"}],"title":["Multilinguality in Knowledge Graphs"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Lucie-Aim\u00e9e Kaffee"],"Details":["Abstract: In this talk, I will give an overview of my work in the domain of\nmultilingual knowledge graphs with a focus on Wikidata.\nI will speak about how well knowledge graphs are covered in terms of\nmultilingual information, how to measure and increase their\nmutlilinguality, and finally about the reuse of the multilingual\ninformation.\nIn particular, I introduce a framework to measure knowledge graphs'\nlabels and language information for reuse in applications. Then, I will\ngive an overview of the topic of machine translation of knowledge graph\nlabels. Further, we explore the generation of multilingual text from\ntriples.\nI will tie in my most recent work on language models with regard to\nmultilingual and cross-cultural understanding.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Multilinguality in Knowledge Graphs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Multilinguality_in_Knowledge_Graphs","namespace":0,"exists":"1","displaytitle":"Multilinguality in Knowledge Graphs"},"Musings on Graph Data, Schemas, Modality, and Coinduction":{"printouts":{"Start":[{"timestamp":"1717671600","raw":"1\/2024\/6\/6\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1717675200","raw":"1\/2024\/6\/6\/12\/0\/0\/0"}],"title":["Musings on Graph Data, Schemas, Modality, and Coinduction"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Stephan Mennicke"],"Details":["In this talk, I'll report on a schema model for graph databases I thought about in late April 2019. The model itself has some nice theoretical and, admittedly, some weird practical consequences. The talk will provide some light in both directions. Up until the submission of my PhD thesis in October 2019, I developed the schema model further and in that very moment, after the submission, itself and any continuation on that line of research practically died. This talk will be about its recent revival and potential continuations."]},"fulltext":"Musings on Graph Data, Schemas, Modality, and Coinduction","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Musings_on_Graph_Data,_Schemas,_Modality,_and_Coinduction","namespace":0,"exists":"1","displaytitle":"Musings on Graph Data, Schemas, Modality, and Coinduction"},"Musings on the Semantics of SPARQL":{"printouts":{"Start":[{"timestamp":"1578574800","raw":"1\/2020\/1\/9\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1578580200","raw":"1\/2020\/1\/9\/14\/30\/0\/0"}],"title":["Musings on the Semantics of SPARQL"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Stephan Mennicke"],"Details":["Graph simulations have found their way into different graph database management (GDBM) tasks, e.g., in the shape of Offline indexing structures, as theoretical models for graph schemas, or as viable alternatives to matching patterns up to graph homomorphisms. Among other advantages, it is often the tractability of the simulation problem being exploited in emerging applications. However, when it\ncomes to evaluating the approaches, only basic graph patterns (BGPs) and rather small data instances, compared to today's large data instances like Wikidata or DBpedia, are considered. In the first part of this talk, I give some insights on how far graph simulations may be incorporated into full-fledged graph query processing. Therefore, we analyze different semantic interpretations of SPARQL, based on graph simulation, w.r.t. correctness, complexity, and effectiveness. Second, I briefly sketch why state-of-the-art simulation algorithms do not scale well in the graph query\/data setting. I further show the effects of a devised solution that even integrates well with the SPARQL semantics we envisioned in the first part."]},"fulltext":"Musings on the Semantics of SPARQL","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Musings_on_the_Semantics_of_SPARQL","namespace":0,"exists":"1","displaytitle":"Musings on the Semantics of SPARQL"},"Navigating ASP Solution Spaces2":{"printouts":{"Start":[{"timestamp":"1729162800","raw":"1\/2024\/10\/17\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1729166400","raw":"1\/2024\/10\/17\/12\/0\/0\/0"}],"title":["Navigating ASP Solution Spaces (Canceled)"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Sarah Alice Gaggl"],"Details":["'''This talk has been canceled. There will be no seminar on Oct 17.'''\n\nA wide range of combinatorial search problems can be modelled and solved with Answer Set Programming (ASP). While modern ASP solvers allow to quickly enumerate solutions, the user faces the problem of dealing with a possibly exponential number of solutions, which may easily go into millions and beyond. To still be able to reach an understanding of the answer set space, we propose navigation approaches to reach subspaces that fulfill desirable criteria. We start with an iterative approach to compute a diverse collection of answer sets that allows to exchange some answer sets to improve the size and diversity of the whole collection. Then, we propose an approach to collect representative answer sets that, in contrast to diverse collections, do not require to \nspecify a diversity measure. With weighted faceted answer set navigation we allow for a quantitative understanding of the answer set space. Weights can be assigned to atoms depending on how much they restrict the remaining solution space, either by counting the number of answer sets (resp. supported models) or counting the number of atoms still available to choose. Finally, we will present a visual approach to explore solution spaces and apply it to the domain of abstract argumentation."]},"fulltext":"Navigating ASP Solution Spaces2","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Navigating_ASP_Solution_Spaces2","namespace":0,"exists":"1","displaytitle":"Navigating ASP Solution Spaces (Canceled)"},"Nemo: Your Friendly and Versatile Rule Reasoning Toolkit":{"printouts":{"Start":[{"timestamp":"1718881200","raw":"1\/2024\/6\/20\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1718884800","raw":"1\/2024\/6\/20\/12\/0\/0\/0"}],"title":["Nemo: Your Friendly and Versatile Rule Reasoning Toolkit"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Alex Ivliev"],"Details":["
I give a short introduction to Nemo, a toolkit for rule-based reasoning and data processing that emphasises robustness and ease of use.<\/p>\n
\nNemo is a scalable and efficient main-memory reasoner that supports an expressive extension of Datalog with support for datatypes, existential rules, aggregates, and (stratified) negation. Built around this core is a versatile system of libraries and applications for interfacing with several data formats and programming languages, use as a web application, and IDE integration.<\/p>\n\n
Join online: https:\/\/bbb.tu-dresden.de\/rooms\/n5w-ghp-qoq-kts\/join<\/p>"]},"fulltext":"Nemo: Your Friendly and Versatile Rule Reasoning Toolkit","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Nemo:_Your_Friendly_and_Versatile_Rule_Reasoning_Toolkit","namespace":0,"exists":"1","displaytitle":"Nemo: Your Friendly and Versatile Rule Reasoning Toolkit"},"Nested Sequents for First-Order Modal Logics via Reachability Rules":{"printouts":{"Start":[{"timestamp":"1671102000","raw":"1\/2022\/12\/15\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1671105600","raw":"1\/2022\/12\/15\/12\/0\/0\/0"}],"title":["Nested Sequents for First-Order Modal Logics via Reachability Rules"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Tim Lyon"],"Details":["In this talk, we present cut-free nested sequent calculi for first-order modal logics. We consider a diverse class of first-order modal logics obtained by imposing certain Horn conditions on the relational and domain structure of QK models. Labeled sequent calculi are then obtained via standard techniques from the semantics of these logics. We show how to derive nested calculi from labeled via the 'structural refinement' technique, which consists of eliminating structural rules, introducing reachability rules, and translating notation. The reachability rules obtained via this method possess a unique functionality, consisting of propagating and\/or checking if data exists along certain paths within a nested sequent. We demonstrate how such rules operate and touch on the significance of the nested sequent formulation (in the first-order setting) which emerges naturally from the structural refinement methodology."]},"fulltext":"Nested Sequents for First-Order Modal Logics via Reachability Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Nested_Sequents_for_First-Order_Modal_Logics_via_Reachability_Rules","namespace":0,"exists":"1","displaytitle":"Nested Sequents for First-Order Modal Logics via Reachability Rules"},"News about Reasoning with Bit-Vectors":{"printouts":{"Start":[{"timestamp":"1417428000","raw":"1\/2014\/12\/1\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1417431600","raw":"1\/2014\/12\/1\/11\/0\/0\/0"}],"title":["News about Reasoning with Bit-Vectors"],"Room":[{"fulltext":"APB E005","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_E005","namespace":0,"exists":"1","displaytitle":"Raum APB E005"}],"Type":["Vortrag"],"Speaker":["Prof. Armin Biere"],"Details":["Bit-Precise reasoning (BPR) in bit-vector logic allows to capture\nsemantics of systems down to individual bits and thus is essential to\nmany verification and synthesis tasks for both hardware and software\nsystems. As an instance of Satisfiability Modulo Theories (SMT), BPR\nis in essence about word-level decision procedures for the theory of\nbit-vectors. In practice, quantifiers and other theory extensions,\nsuch as reasoning about arrays, are important too. After a motivating\nexample we give a brief overview on basic techniques for bit-precise\nreasoning and then will cover more recent theoretical results,\nincluding complexity classification results. We discuss challenges in\ndeveloping an efficient SMT solver for bit-vectors, like our award\nwinning SMT solver Boolector, and in particular present examples, for\nwhich current techniques fail."]},"fulltext":"News about Reasoning with Bit-Vectors","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/News_about_Reasoning_with_Bit-Vectors","namespace":0,"exists":"1","displaytitle":"News about Reasoning with Bit-Vectors"},"NextClosures: Parallel Computation of the Canonical Base":{"printouts":{"Start":[{"timestamp":"1444057200","raw":"1\/2015\/10\/5\/15\/0\/0\/0"}],"Ende":[{"timestamp":"1444060800","raw":"1\/2015\/10\/5\/16\/0\/0\/0"}],"title":["NextClosures: Parallel Computation of the Canonical Base"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Francesco Kriegel"],"Details":["The canonical base of a formal context plays a distinguished role in formal concept analysis. This is because it is the only minimal base so far that can be described explicitly. For the computation of this base several algorithms have been proposed. However, all those algorithms work sequentially, by computing only one pseudo-intent at a time - a fact which heavily impairs the practicability of using the canonical base in real-world applications. In this paper we shall introduce an approach that remedies this deficit by allowing the canonical base to be computed in a parallel manner. First experimental evaluations show that for sufficiently large data-sets the speedup is proportional to the number of available CPUs.\n\n\nThe talk is based on the [[Inproceedings3047\/en|eponymous paper]], which is joint work with Daniel Borchmann."]},"fulltext":"NextClosures: Parallel Computation of the Canonical Base","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/NextClosures:_Parallel_Computation_of_the_Canonical_Base","namespace":0,"exists":"1","displaytitle":"NextClosures: Parallel Computation of the Canonical Base"},"Normalisations of Existential Rules: Not so Innocuous!":{"printouts":{"Start":[{"timestamp":"1668682800","raw":"1\/2022\/11\/17\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1668686400","raw":"1\/2022\/11\/17\/12\/0\/0\/0"}],"title":["Normalisations of Existential Rules: Not so Innocuous!"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["David Carral"],"Details":["Existential rules are an expressive knowledge representation language mainly developed to query data. In the literature, they are often supposed to be in some normal form that simplifies technical developments. For instance, a common assumption is that rule heads are atomic, i.e., restricted to a single atom. Such assumptions are considered to be made without loss of generality as long as all sets of rules can be normalised while preserving entailment. However, an important question is whether the properties that ensure the decidability of reasoning are preserved as well. We provide a systematic study of the impact of these procedures on the different chase variants with respect to chase (non-)termination and FO-rewritability. This also leads us to study open problems related to chase termination of independent interest."]},"fulltext":"Normalisations of Existential Rules: Not so Innocuous!","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Normalisations_of_Existential_Rules:_Not_so_Innocuous!","namespace":0,"exists":"1","displaytitle":"Normalisations of Existential Rules: Not so Innocuous!"},"Not too Big, Not too Small ... Complexities of Fixed-Domain Reasoning in First-Order and Description Logics":{"printouts":{"Start":[{"timestamp":"1498741200","raw":"1\/2017\/6\/29\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1498744800","raw":"1\/2017\/6\/29\/14\/0\/0\/0"}],"title":["Not too Big, Not too Small ... Complexities of Fixed-Domain Reasoning in First-Order and Description Logics"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Lukas Schweizer"],"Details":["We consider reasoning problems in description logics and variants of first-order logic under the fixed-domain semantics, where the model size is finite and explicitly given. It follows from previous results that standard reasoning is NP-complete for a very wide range of logics, if the domain size is given in unary encoding. In this paper, we complete the complexity overview for unary encoding and investigate the effects of binary encoding with partially surprising results. Most notably, fixed-domain standard reasoning becomes NExpTime for the rather low-level description logics ELI and ELF (as opposed to ExpTime when no domain size is given). On the other hand, fixed-domain reasoning remains NExpTime even for first-order logic, which is undecidable under the unconstrained semantics. For less expressive logics, we establish a generic criterion ensuring NP-completeness of fixed-domain reasoning. Amongst other logics, this criterion captures all the tractable profiles of OWL 2."]},"fulltext":"Not too Big, Not too Small ... Complexities of Fixed-Domain Reasoning in First-Order and Description Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Not_too_Big,_Not_too_Small_..._Complexities_of_Fixed-Domain_Reasoning_in_First-Order_and_Description_Logics","namespace":0,"exists":"1","displaytitle":"Not too Big, Not too Small ... Complexities of Fixed-Domain Reasoning in First-Order and Description Logics"},"Notation3 Logic: From informal to formal semantics":{"printouts":{"Start":[{"timestamp":"1596114000","raw":"1\/2020\/7\/30\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1596119400","raw":"1\/2020\/7\/30\/14\/30\/0\/0"}],"title":["Notation3 Logic: From informal to formal semantics"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["D\u00f6rthe Arndt"],"Details":["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\u2019s 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.\n\n\nThis talk will be held online. If there is any interest in attending, please send an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"Notation3 Logic: From informal to formal semantics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Notation3_Logic:_From_informal_to_formal_semantics","namespace":0,"exists":"1","displaytitle":"Notation3 Logic: From informal to formal semantics"},"Notation3 as an Existential Rule Language":{"printouts":{"Start":[{"timestamp":"1700132400","raw":"1\/2023\/11\/16\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1700136000","raw":"1\/2023\/11\/16\/12\/0\/0\/0"}],"title":["Notation3 as an Existential Rule Language"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["D\u00f6rthe Arndt"],"Details":["Abstract: Notation3 Logic (N3) is an extension of RDF that allows the user to write rules introducing new blank nodes to RDF graphs. Many applications (e.g., ontology mapping) rely on this feature as blank nodes \u2013 used directly or in auxiliary constructs \u2013 are omnipresent on the Web. However, the number of fast N3 reasoners covering this very important feature of the logic is rather limited. On the other hand, there are engines like VLog or Nemo which do not directly support Semantic Web rule formats but which are developed and optimized for very similar constructs: existential rules. In this paper, we investigate the relation between N3 rules with blank nodes in their heads and existential rules. We identify a subset of N3 that can be mapped directly to existential rules and define such a mapping preserving the equivalence of N3 formulae. In order to also illustrate that in some cases N3 reasoning could benefit from our translation, we then employ this mapping in an implementation to compare the performance of the N3 reasoners EYE and cwm to VLog and Nemo on N3 rules and their mapped counterparts. Our tests show that the existential rule reasoners perform particularly well for use cases containing many facts while especially the EYE reasoner is very fast when dealing with a high number of dependent rules. We thus provide a tool enabling the Semantic Web community to directly use existing and future existential rule reasoners and benefit from the findings of this active community.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Notation3 as an Existential Rule Language","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Notation3_as_an_Existential_Rule_Language","namespace":0,"exists":"1","displaytitle":"Notation3 as an Existential Rule Language"},"Notes on Computational Learning Theory and the problem of learning CNFs":{"printouts":{"Start":[{"timestamp":"1519896000","raw":"1\/2018\/3\/1\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1519901400","raw":"1\/2018\/3\/1\/10\/50\/0\/0"}],"title":["Notes on Computational Learning Theory and the problem of learning CNFs"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Ana Ozaki"],"Details":["This is an informal talk where I first talk about the PAC learning model and the classical problem of learning the CNF class. Then I will present the MVDF class, which non-trivially lies between Horn and CNF, and discuss some results related to this class in the PAC learning model extended with membership queries."]},"fulltext":"Notes on Computational Learning Theory and the problem of learning CNFs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Notes_on_Computational_Learning_Theory_and_the_problem_of_learning_CNFs","namespace":0,"exists":"1","displaytitle":"Notes on Computational Learning Theory and the problem of learning CNFs"},"On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics":{"printouts":{"Start":[{"timestamp":"1637838000","raw":"1\/2021\/11\/25\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1637841600","raw":"1\/2021\/11\/25\/12\/0\/0\/0"}],"title":["On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["The talk is based on my forthcoming FSTTCS'21 paper (https:\/\/iccl.inf.tu-dresden.de\/web\/Inproceedings3301\/en) with the eponymous title, co-authored with my two bachelor students (Anna Pacanowska and Maja Or\u0142owska) and my college Tony Tan from Taiwan.\nIn this work we investigated the extensions of classical decidable logics with percentage quantifiers, specifying how frequently a formula is satisfied in the indented model. We showed, surprisingly, that both the two-variable logic and the guarded fragment become undecidable under such extension, sharpening the existing results in the literature. Our negative results are supplemented by decidability of the two-variable guarded fragment with even more expressive counting, namely Presburger constraints. Our results can be applied to infer decidability of various modal and description logics, e.g. Presburger Modal Logics with Converse or ALCI, with expressive cardinality constraints.\n\nThe talk is online, link to the talk:\n\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_Classical_Decidable_Logics_extended_with_Percentage_Quantifiers_and_Arithmetics","namespace":0,"exists":"1","displaytitle":"On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics"},"On Computing Explanations in Argumentation":{"printouts":{"Start":[{"timestamp":"1454593200","raw":"1\/2016\/2\/4\/13\/40\/0\/0"}],"Ende":[{"timestamp":"1454596800","raw":"1\/2016\/2\/4\/14\/40\/0\/0"}],"title":["On Computing Explanations in Argumentation"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Satyadharma Tirtarasa"],"Details":["In an argumentation, usually there is a particular argument called as the topic. Related admissible is a new semantics extending admissible semantics to catch this aspect. This semantics will be defined in both abstract argumentation and assumption-based argumentation framework. There are several types of explanations regarding their size. The computation of these explanations is also given using dispute trees."]},"fulltext":"On Computing Explanations in Argumentation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_Computing_Explanations_in_Argumentation","namespace":0,"exists":"1","displaytitle":"On Computing Explanations in Argumentation"},"On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic":{"printouts":{"Start":[{"timestamp":"1743678000","raw":"1\/2025\/4\/3\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1743681600","raw":"1\/2025\/4\/3\/12\/0\/0\/0"}],"title":["On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Tim Lyon"],"Details":["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 \u2261 \u03d5(x) such that x is a propositional variable and \u03d5(x) is a formula containing x. A solution to such an equation is a formula \u03c8 that omits x and satisfies \u03c8 \u2261 \u03d5(\u03c8), where \u03d5(\u03c8) is obtained by replacing all occurrences of x with \u03c8 in \u03d5(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 \u2261 \u03d5(x) has a solution."]},"fulltext":"On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_Explicit_Solutions_to_Fixed-Point_Equations_in_Propositional_Dynamic_Logic","namespace":0,"exists":"1","displaytitle":"On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic"},"On Mono- and Multilingual Word embeddings for NLP":{"printouts":{"Start":[{"timestamp":"1456407000","raw":"1\/2016\/2\/25\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1456410600","raw":"1\/2016\/2\/25\/14\/30\/0\/0"}],"title":["On Mono- and Multilingual Word embeddings for NLP"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Anatoly Zelenin"],"Details":["A fundamental problem of Natural Language Processing is to find a good numerical representation of words to be used in further processing steps. We present different recent mono- and bilingual approaches to map words into vector spaces. Knowing them we focus on issues of existing Multilingual approaches and discuss how to improve them further to build the foundation for systems analyzing Social Media posts from all over the world."]},"fulltext":"On Mono- and Multilingual Word embeddings for NLP","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_Mono-_and_Multilingual_Word_embeddings_for_NLP","namespace":0,"exists":"1","displaytitle":"On Mono- and Multilingual Word embeddings for NLP"},"On inconsistency-minimizing, paraconsistent reasoning in knowledge bases":{"printouts":{"Start":[{"timestamp":"1477493400","raw":"1\/2016\/10\/26\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1477497000","raw":"1\/2016\/10\/26\/15\/50\/0\/0"}],"title":["On inconsistency-minimizing, paraconsistent reasoning in knowledge bases"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Walter Forkel"],"Details":["Many different solutions have been proposed to enable working with inconsistent description logic knowledge bases. In this work we introduce a novel approach that combines the ideas of a paraconsistent four-valued description logic with the assumption that models with fewer inconsistencies are to be preferred over non-minimal models. We argue that our formalism is well suited for reasoning in the presence of inconsistencies. Furthermore we show that it extends usual $\\ALC$ in a natural way, providing the same results when used on consistent knowledge bases. Finally our approach has the advantage that it can be embedded in usual circumscribed $\\ALC$ and thus does not require an extra reasoner and also keeps the same complexity of reasoning."]},"fulltext":"On inconsistency-minimizing, paraconsistent reasoning in knowledge bases","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_inconsistency-minimizing,_paraconsistent_reasoning_in_knowledge_bases","namespace":0,"exists":"1","displaytitle":"On inconsistency-minimizing, paraconsistent reasoning in knowledge bases"},"On the Abstract Expressive Power of Description Logics with Concrete Domains":{"printouts":{"Start":[{"timestamp":"1692874800","raw":"1\/2023\/8\/24\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1692878400","raw":"1\/2023\/8\/24\/12\/0\/0\/0"}],"title":["On the Abstract Expressive Power of Description Logics with Concrete Domains"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Filippo De Bortoli"],"Details":["The talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus\n\nAbstract: Concrete domains have been introduced in Description Logic (DL) to\nenable reference to concrete objects (such as numbers) and predefined\npredicates on these objects (such as numerical comparisons) when\ndefining concepts. The main emphasis of research in this context was on\nfinding restrictions on the concrete domain such that its integration\ninto certain DLs preserves decidability. In particular, it was shown\nthat \u03c9-admissible concrete domains can be integrated into the DL ALC\nwithout causing undecidability.\n\nIn this paper, we concentrate on investigating the expressive power of\nDLs with concrete domains. Basically, their semantics is defined using\nfirst-order interpretations as abstract domains extended with partial\nfunctions from the abstract domain into the concrete domain.\nThe abstract expressive power of a given classical logic (first-order\nlogic or DL) extended with a concrete domain is determined by which\nclasses of first-order interpretations (i.e., abstract domains where we\nforget the partial functions and their values) can be expressed.\n\nTo show that such a class is not first-order definable, one can try to\nuse a compactness argument, i.e., prove that first-order definability\nwould lead to a contradiction to compactness of first-order logic (FO).\nIn the first part of the paper, we will show that extensions of FO or\nALC with a homomorphism \u03c9-compact concrete domain share many formal\nproperties with FO, such as the compactness and the downward\nL\u00f6wenheim-Skolem property. Nevertheless, their abstract expressive power\nneed not be contained in that of FO. Note that any \u03c9-admissible concrete\ndomain is homomorphism \u03c9-compact.\n\nIn the second part of the paper, we investigate whether finitely-bounded\nhomogeneous structures, which preserve decidability if employed as\nconcrete domains, can be used to express certain universal first-order\nsentences, which then could be added to knowledge bases without\ndestroying decidability. We will see that this requires rather strong\nconditions on the universal first-order sentences or an extended scheme\nfor integrating the concrete domain."]},"fulltext":"On the Abstract Expressive Power of Description Logics with Concrete Domains","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_the_Abstract_Expressive_Power_of_Description_Logics_with_Concrete_Domains","namespace":0,"exists":"1","displaytitle":"On the Abstract Expressive Power of Description Logics with Concrete Domains"},"On the Complexity of Synthesis of nop-Free Boolean Petri Nets.":{"printouts":{"Start":[{"timestamp":"1595595600","raw":"1\/2020\/7\/24\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1595601000","raw":"1\/2020\/7\/24\/14\/30\/0\/0"}],"title":["On the Complexity of Synthesis of nop-Free Boolean Petri Nets"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Evgeny Erofeev"],"Details":["In a Boolean Petri net, the interaction nop allows places and transitions to be independent, so that the firing of a transition does not affect the marking of a place, and vice versa. Recently, the complexity of synthesis of nets equipped with nop has been investigated thoroughly, while the question for the rest 128 types of nets remains open. This work tackles the case of nop-free nets synthesis, that is, the Boolean nets where places and transitions are always related via interactions that are able to modify the marking of a place. In this paper, we show that, for nop-free nets, the absence of swap leads always to a polynomial time synthesis procedure. Moreover, we give a first hint, that the presence of swap might make the synthesis for these types NP-complete.\n\n\nThis talk will be held online. If there is any interest in attending, please send an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"On the Complexity of Synthesis of nop-Free Boolean Petri Nets.","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_the_Complexity_of_Synthesis_of_nop-Free_Boolean_Petri_Nets.","namespace":0,"exists":"1","displaytitle":"On the Complexity of Synthesis of nop-Free Boolean Petri Nets"},"On the Complexity of Universality for Partially Ordered NFAs":{"printouts":{"Start":[{"timestamp":"1467816600","raw":"1\/2016\/7\/6\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1467820200","raw":"1\/2016\/7\/6\/15\/50\/0\/0"}],"title":["On the Complexity of Universality for Partially Ordered NFAs"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Tom\u00e1\u0161 Masopust"],"Details":["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.\n\n\nThis is a joint work with Markus Kr\u00f6tzsch and Micha\u00ebl Thomazo."]},"fulltext":"On the Complexity of Universality for Partially Ordered NFAs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_the_Complexity_of_Universality_for_Partially_Ordered_NFAs","namespace":0,"exists":"1","displaytitle":"On the Complexity of Universality for Partially Ordered NFAs"},"On the Complexity of k-Piecewise Testability and the Depth of Automata":{"printouts":{"Start":[{"timestamp":"1441032600","raw":"1\/2015\/8\/31\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1441036200","raw":"1\/2015\/8\/31\/15\/50\/0\/0"}],"title":["On the Complexity of k-Piecewise Testability and the Depth of Automata"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Tom\u00e1\u0161 Masopust"],"Details":["For a non-negative integer k, a language is k-piecewise testable (k-PT) if it is a finite boolean combination of languages of the form \\Sigma^*a1\\Sigma^*...\\Sigma^*an for ai in \\Sigma and 0 <= n <= k. We study the following problem: Given a DFA recognizing a piecewise testable language, decide whether the language is k-PT. We provide a complexity bound on this problem and a detailed analysis for small k's. The result can be use to find the minimal k for which the language is k-PT. We show that the upper bound on k given by the depth of the minimal DFA can be exponentially bigger than the minimal possible k, and provide a tight upper bound on the depth of the minimal DFA recognizing a k-PT language.\n\n\nJoint work with [[Micha\u00ebl Thomazo]]"]},"fulltext":"On the Complexity of k-Piecewise Testability and the Depth of Automata","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_the_Complexity_of_k-Piecewise_Testability_and_the_Depth_of_Automata","namespace":0,"exists":"1","displaytitle":"On the Complexity of k-Piecewise Testability and the Depth of Automata"},"On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets":{"printouts":{"Start":[{"timestamp":"1567083600","raw":"1\/2019\/8\/29\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1567087200","raw":"1\/2019\/8\/29\/14\/0\/0\/0"}],"title":["On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Filippo De Bortoli"],"Details":["'''Abstract:''' In recent work we have extended the description logic (DL) ALCQ by means of more expressive number restrictions using numerical and set constraints stated in the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA). It has been shown that reasoning in the resulting DL, called ALCSCC, is PSpace-complete without a TBox and ExpTime-complete w.r.t. a general TBox. The semantics of ALCSCC is defined in terms of finitely branching interpretations, that is, interpretations where every element has only finitely many role successors. This condition was needed since QFBAPA considers only finite sets. In this paper, we first introduce a variant of ALCSCC, called ALCSCC\u221e, in which we lift this requirement (inexpressible in first-order logic) and show that the complexity results for ALCSCC mentioned above are preserved. Nevertheless, like ALCSCC, ALCSCC\u221e is not a fragment of first-order logic. The main contribution of this paper is to give a characterization of the first-order fragment of ALCSCC\u221e. The most important tool used in the proof of this result is a notion of bisimulation that characterizes this fragment.\n\n\nJoint work with Franz Baader.\nThis talk is a rehearsal for a presentation at FroCoS 2019.\nDuration: 25 minutes without questions."]},"fulltext":"On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/On_the_Expressive_Power_of_Description_Logics_with_Cardinality_Constraints_on_Finite_and_Infinite_Sets","namespace":0,"exists":"1","displaytitle":"On the Expressive Power of Description Logics with Cardinality Constraints on Finite and Infinite Sets"},"Ongoing Research in the NAVAS Project":{"printouts":{"Start":[{"timestamp":"1634814000","raw":"1\/2021\/10\/21\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1634817600","raw":"1\/2021\/10\/21\/12\/0\/0\/0"}],"title":["Ongoing Research in the NAVAS Project"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Dominik Rusovac"],"Details":["This talk provides an insight into the latest research of answer set navigation methods."]},"fulltext":"Ongoing Research in the NAVAS Project","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Ongoing_Research_in_the_NAVAS_Project","namespace":0,"exists":"1","displaytitle":"Ongoing Research in the NAVAS Project"},"Ontological Modelling in Wikidata":{"printouts":{"Start":[{"timestamp":"1540472400","raw":"1\/2018\/10\/25\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1540477800","raw":"1\/2018\/10\/25\/14\/30\/0\/0"}],"title":["Ontological Modelling in Wikidata"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Markus Kr\u00f6tzsch"],"Details":["This was an invited keynote talk at the 9th Workshop on Ontology Design and Patterns (WOP'18), 2018.\n\n\n'''Abstract:''' Wikidata, the knowledge base of Wikimedia, has been extremely successful in building and sustaining new communities of editors and users. Since its inception in 2012, it has developed from an experimental \u201cdata wiki\u201d into a well-organised reference knowledge base with an amazing array of applications. Developing an ontological schema for such an open and rapidly expanding project is a huge undertaking, and difficult challenges arise on many levels. The community has directed significant efforts towards vocabulary development, many guidelines and rules have been created, and tools are used for helping editors to avoid and correct modelling errors. Nevertheless, the distributed nature of Wikidata editing often means that ontology design, too, is distributed, and a coherent global view is only being worked on once significant amounts of data have been added. The result is a knowledge graph with a widely varying modelling quality across different sub-domains.\n\nThe big question for researchers is how their insights and methods can help here. The Wikidata community is widely aware of semantic web activities and existing standards and academic publications play a role in many discussions. Yet, there seems to be only little direct exchange between the communities. In this talk, I will review the current state of Wikidata and its connection to semantic web standards such as RDF and SPARQL. I will try to raise awareness of the particular requirements of Wikidata, and argue that these are of general interest for the data-driven curation of knowledge graphs."]},"fulltext":"Ontological Modelling in Wikidata","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Ontological_Modelling_in_Wikidata","namespace":0,"exists":"1","displaytitle":"Ontological Modelling in Wikidata"},"Ontologies for Knowledge Graphs: Breaking the Rules":{"printouts":{"Start":[{"timestamp":"1475074200","raw":"1\/2016\/9\/28\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1475077800","raw":"1\/2016\/9\/28\/15\/50\/0\/0"}],"title":["Ontologies for Knowledge Graphs: Breaking the Rules"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Veronika Thost"],"Details":["Large-scale knowledge graphs (KGs) are widely used in industry and academia, and provide excellent use-cases for ontologies. We find, however, that popular ontology languages, such as OWL and Datalog, cannot express even the most basic relationships on the normalised data format of KGs. Existential rules are more powerful, but may make reasoning undecidable. Normalising them to suit KGs often also destroys syntactic restrictions that ensure decidability and low complexity. We study this issue for several classes of existential rules and derive new syntactic criteria to recognise well-behaved rule-based ontologies over KGs."]},"fulltext":"Ontologies for Knowledge Graphs: Breaking the Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Ontologies_for_Knowledge_Graphs:_Breaking_the_Rules","namespace":0,"exists":"1","displaytitle":"Ontologies for Knowledge Graphs: Breaking the Rules"},"Ontology Evolution trough Interaction":{"printouts":{"Start":[{"timestamp":"1473087600","raw":"1\/2016\/9\/5\/15\/0\/0\/0"}],"Ende":[{"timestamp":"1473091200","raw":"1\/2016\/9\/5\/16\/0\/0\/0"}],"title":["Ontology Evolution trough Interaction"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Irina Dragoste"],"Details":["This paper shows how agents can evolve their ontologies while trying to communicate, following a protocol inspired by cultural evolution experiment methodology. While other studies have dealt with evolving ontology alignments, we are interested in refining the classification precision, which is accomplished during the protocol: while communicating about objects encountered in the environment, agents may discover the need to increase their classification precision in order to reach an agreement with the interlocutor. They do so by creating and adopting new categories from other agents that would help them discriminate better. We conducted several experiments to show that a population playing this game will always converge to a state of full communication success, when agents have stabilized their knowledge and cannot learn any new categories."]},"fulltext":"Ontology Evolution trough Interaction","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Ontology_Evolution_trough_Interaction","namespace":0,"exists":"1","displaytitle":"Ontology Evolution trough Interaction"},"Ontology-Based Query Answering for Probabilistic Temporal Data":{"printouts":{"Start":[{"timestamp":"1547730000","raw":"1\/2019\/1\/17\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1547735400","raw":"1\/2019\/1\/17\/14\/30\/0\/0"}],"title":["Ontology-Based Query Answering for Probabilistic Temporal Data"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Patrick Koopmann"],"Details":["'''Abstract:''' We investigate ontology-based query answering for data that are both temporal\nand probabilistic, which might occur in contexts such as stream reasoning or\nsituation recognition with uncertain data. We present a\nframework that allows to represent temporal probabilistic data, and\nintroduce a query language with which complex temporal and probabilistic\npatterns can be described. Specifically, this language combines conjunctive\nqueries with operators from linear time logic as well as probability operators.\nWe analyse the complexities of evaluating queries in this language in various\nsettings. While in some cases, combining the temporal and the\nprobabilistic dimension in such a way comes at the cost of increased complexity,\nwe also determine cases for which this increase can be avoided. \n\nThis is a talk based on a paper that will be presented at this year\u2019s AAAI conference."]},"fulltext":"Ontology-Based Query Answering for Probabilistic Temporal Data","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Ontology-Based_Query_Answering_for_Probabilistic_Temporal_Data","namespace":0,"exists":"1","displaytitle":"Ontology-Based Query Answering for Probabilistic Temporal Data"},"Ontology-Driven Software Development in the Context of the Semantic Web (Project Thesis)":{"printouts":{"Start":[{"timestamp":"1432113600","raw":"1\/2015\/5\/20\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1432119000","raw":"1\/2015\/5\/20\/10\/50\/0\/0"}],"title":["Ontology-Driven Software Development in the Context of the Semantic Web (Project Thesis)"],"Room":[{"fulltext":"APB 0005","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_0005","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Serge Stratan"],"Details":["The last researches in Semantic Web vision gave possibility to develop new standards such as OWL, RDF\/S, SPARQL etc. While these standards provide all technical infrastructure, together with theoretical support of Description Logic, software developers have little guidance on how to build real-world Semantic Web applications. Based on some real world example, has been implemented a Semantic Web application.\nIn this work is given some ideas on a software architecture and a development methodology for Web services for the Semantic Web. This architecture is driven by formal domain model (an ontology). The methodology applies best practices from agile development technics, including the latest web tools used to build the most modern applications, together with implementation of technics which provide the best user interface (for Desktop and Mobile devices), high speed of processing data and many other things. Paper illustrates how these techniques can be put into practice using the modern Semantic Web development tools such as OWL API, Semantic Web reasoners, SPARQL DL API, and indicate future possibilities"]},"fulltext":"Ontology-Driven Software Development in the Context of the Semantic Web (Project Thesis)","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Ontology-Driven_Software_Development_in_the_Context_of_the_Semantic_Web_(Project_Thesis)","namespace":0,"exists":"1","displaytitle":"Ontology-Driven Software Development in the Context of the Semantic Web (Project Thesis)"},"Seminar 15.07.2021":{"printouts":{"Start":[{"timestamp":"1626354000","raw":"1\/2021\/7\/15\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1626359400","raw":"1\/2021\/7\/15\/14\/30\/0\/0"}],"title":["Optimizing the Execution Order of Datalog Rules in VLog"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Alex Ivliev"],"Details":["Datalog extended with existential rules is important for many reasoning tasks. To evaluate a Datalog program, its rules are applied until no new facts can be derived. Crucially, their execution order might significantly impact runtime, memory consumption and even the number of derived facts. Our goal is to find an optimal execution strategy by analysing the relationship between the rules of a given program. We implemented our approach in VLog -- a Datalog rule execution engine -- and measured its impact on performance on several databases.\n\n\nThis talk will take place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login: \n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=133369&p=679d54f7\n\nwithout ZIH-login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=133369&p=e19bcdf1"]},"fulltext":"Seminar 15.07.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_15.07.2021","namespace":0,"exists":"1","displaytitle":"Optimizing the Execution Order of Datalog Rules in VLog"},"PAC Completion of Description Logic TBoxes":{"printouts":{"Start":[{"timestamp":"1704970800","raw":"1\/2024\/1\/11\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1704974400","raw":"1\/2024\/1\/11\/12\/0\/0\/0"}],"title":["PAC Completion of Description Logic TBoxes"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Sergei Obiedkov"],"Details":["Abstract: In description logic knowledge bases, there may be a need to ensure that the terminological part of the base is complete in the sense that it captures all relevant relations between concepts. In [1], a method was proposed that does this for a user-specified subset of concepts. The method is based on attribute exploration from formal concept analysis [2] and uses queries to acquire knowledge from a domain expert. It may however require an exponential (in the size of the output) number of queries. I will present a probably approximately correct version of the method based on an algorithm for learning propositional Horn formulas [3]. The method works for an arbitrary DL language allowing the bottom concept, conjunction, and negation. \nThis is a joint work with Bar\u0131\u015f Sertkaya (Frankfurt University of Applied Sciences).\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"PAC Completion of Description Logic TBoxes","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/PAC_Completion_of_Description_Logic_TBoxes","namespace":0,"exists":"1","displaytitle":"PAC Completion of Description Logic TBoxes"},"Past, Current and Future Trends in Description Logic":{"printouts":{"Start":[{"timestamp":"1416235800","raw":"1\/2014\/11\/17\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1416241200","raw":"1\/2014\/11\/17\/16\/20\/0\/0"}],"title":["Past, Current and Future Trends in Description Logic"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Sebastian Rudolph"],"Details":["In this interactive seminar session, we will discuss the development of the field of description logics focussing on the current and possibly future \"hot topics\" in DL research. We solicit active participation from all participants to share their views and engage in the discussion. We hope that this will give newcomers in the field a first historical and topic-wise orientation and allow active DL researchers to exchange and align their views on important strands of research today and upcoming trends."]},"fulltext":"Past, Current and Future Trends in Description Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Past,_Current_and_Future_Trends_in_Description_Logic","namespace":0,"exists":"1","displaytitle":"Past, Current and Future Trends in Description Logic"},"Pattern-based ontology modeling and some of its implications for Description Logics research":{"printouts":{"Start":[{"timestamp":"1468421400","raw":"1\/2016\/7\/13\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1468425000","raw":"1\/2016\/7\/13\/15\/50\/0\/0"}],"title":["Pattern-based ontology modeling and some of its implications for Description Logics research"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Pascal Hitzler"],"Details":["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.\n\n\n\nPascal 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."]},"fulltext":"Pattern-based ontology modeling and some of its implications for Description Logics research","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Pattern-based_ontology_modeling_and_some_of_its_implications_for_Description_Logics_research","namespace":0,"exists":"1","displaytitle":"Pattern-based ontology modeling and some of its implications for Description Logics research"},"PhD Defense of Bartosz Bednarczyk":{"printouts":{"Start":[{"timestamp":"1719322200","raw":"1\/2024\/6\/25\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1719327600","raw":"1\/2024\/6\/25\/15\/0\/0\/0"}],"title":["PhD Defense of Bartosz Bednarczyk"],"Room":[{"fulltext":"APB 1004","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_1004","namespace":0,"exists":"1","displaytitle":"Raum APB 1004"}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["The public defence of the doctoral dissertation titled \"Database-Inspired Reasoning Problems in Description Logics With Path Expressions\" by Bartosz Bednarczyk (supervised by prof. Sebastian Rudolph and prof. Emanuel Kiero\u0144ski) will take place on the 25th of June at 01:30 p.m. (APB 1004). \n\nThe draft of the thesis is available here: https:\/\/iccl.inf.tu-dresden.de\/web\/Phdthesis3021\/en\n\nThe defence starts at 13:30 in APB 1004. It will also be streamed via Zoom. \nhttps:\/\/tu-dresden.zoom-x.de\/j\/65979593638?pwd=LVdbGbkGy2aQnFijO28tqYkfshU23d.1"]},"fulltext":"PhD Defense of Bartosz Bednarczyk","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/PhD_Defense_of_Bartosz_Bednarczyk","namespace":0,"exists":"1","displaytitle":"PhD Defense of Bartosz Bednarczyk"},"Positivity-Hardness and Saturation Points in Markov Decision Processes":{"printouts":{"Start":[{"timestamp":"1604581200","raw":"1\/2020\/11\/5\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1604586600","raw":"1\/2020\/11\/5\/14\/30\/0\/0"}],"title":["Positivity-Hardness and Saturation Points in Markov Decision Processes"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Jakob Piribauer"],"Details":["The Positivity problem for linear recurrence sequences is a number-theoretic decision problem whose decidability has been open for many decades. We show that this Positivity problem can be encoded into several optimization problems on Markov decision processes, a standard model combining non-deterministic and probabilistic behavior. This reduction demonstrates the inherent mathematical difficulty of various problems in the formal verification of probabilistic systems.\nFor naturally restricted versions of most of these problems, we can nevertheless establish decidability. The key ingredient is the existence of so-called saturation points which can be seen as bounds on the memory required for an optimal strategy in the Markov decision process.\n\n\nThe talk will be approximately 45 minutes long and takes place online. To access the talk use the following links:\n\nIf you have a ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?meeting_id=42224&pin=4c120949\n\n\nIf you do not have a ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?meeting_id=42224&pin=d3219e91"]},"fulltext":"Positivity-Hardness and Saturation Points in Markov Decision Processes","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Positivity-Hardness_and_Saturation_Points_in_Markov_Decision_Processes","namespace":0,"exists":"1","displaytitle":"Positivity-Hardness and Saturation Points in Markov Decision Processes"},"Preserving Constraints with the Stable Chase":{"printouts":{"Start":[{"timestamp":"1520500800","raw":"1\/2018\/3\/8\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1520506200","raw":"1\/2018\/3\/8\/10\/50\/0\/0"}],"title":["Preserving Constraints with the Stable Chase"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Maximilian Marx"],"Details":["Conjunctive query answering over databases with constraints \u2013 also known as (tuple-generating)\ndependencies \u2013 is considered a central database task. To this end, several versions of a con-\nstruction called chase have been described. Given a set \u03a3 of dependencies, it is interesting to\nask which constraints not contained in \u03a3 that are initially satisfied in a given database instance\nare preserved when computing a chase over \u03a3. Such constraints are an example for the more\ngeneral class of incidental constraints, which when added to \u03a3 as new dependencies do not affect\ncertain answers and might even speed up query answering. After formally introducing incidental\nconstraints, we show that deciding incidentality is undecidable for tuple-generating dependencies,\neven in cases for which query entailment is decidable. For dependency sets with a finite universal\nmodel, the core chase can be used to decide incidentality. For the infinite case, we propose the\nstable chase, which generalises the core chase, and study its relation to incidental constraints."]},"fulltext":"Preserving Constraints with the Stable Chase","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Preserving_Constraints_with_the_Stable_Chase","namespace":0,"exists":"1","displaytitle":"Preserving Constraints with the Stable Chase"},"Privacy-Preserving Ontology Publishing for EL Instance Stores":{"printouts":{"Start":[{"timestamp":"1547125200","raw":"1\/2019\/1\/10\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1547130600","raw":"1\/2019\/1\/10\/14\/30\/0\/0"}],"title":["Privacy-Preserving Ontology Publishing for EL Instance Stores"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Adrian Nuradiansyah"],"Details":["'''Abstract:''' We make a first step towards adapting an existing approach for privacy-preserving publishing of linked data to Description Logic (DL) ontologies. We consider the case where both the knowledge about individuals and the privacy policies are expressed using concepts of the DL EL, which corresponds to the setting where the ontology is an EL instance store. We introduce the notions of compliance of a concept with a policy and of the safety of a concept for a policy and show how optimal compliant (safe) generalizations of a given EL concept can be computed. In addition, we investigate the complexity of the optimality problem.\n\n \nThis is joint work with Franz Baader and Francesco Kriegel."]},"fulltext":"Privacy-Preserving Ontology Publishing for EL Instance Stores","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Privacy-Preserving_Ontology_Publishing_for_EL_Instance_Stores","namespace":0,"exists":"1","displaytitle":"Privacy-Preserving Ontology Publishing for EL Instance Stores"},"Projection in a Description Logic of Context with Actions":{"printouts":{"Start":[{"timestamp":"1559826000","raw":"1\/2019\/6\/6\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1559828700","raw":"1\/2019\/6\/6\/13\/45\/0\/0"}],"title":["Projection in a Description Logic of Context with Actions"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Satyadharma Tirtarasa"],"Details":["Satyadharma Tirtarasa and Benjamin Zarrie\u00df. '''Projection in a Description Logic of Context with Actions'''. In Proceedings of the 32nd International Workshop on Description Logics (DL'19), Oslo, Norway, June 2019. Springer. To appear.\n\n\n'''Abstract:''' Projection is the problem of checking whether the execution of a given sequence of actions will achieve its goal starting from some initial state. In this paper, we study a setting where we combine a two-dimensional Description Logic of context (ConDL) with an action formalism. We choose a well-studied ConDL where both: the possible states of a dynamical system itself (object level) and also different context-dependent views on this system state (context level) are organised in relational structures and can be described using usual DL constructs. To represent how such a system and its views evolve we introduce a suitable action formalism. It allows one to describe change on both levels. Furthermore, the observable changes on the object level due to an action execution can also be context-dependent. We show that the formalism is well-behaved in the sense that projection has the same complexity as standard reasoning tasks in case ALCO is the underlying DL. \n\nThis talk is a rehearsal for a SHORT ORAL presentation (17 minutes without questions) at DL 2019."]},"fulltext":"Projection in a Description Logic of Context with Actions","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Projection_in_a_Description_Logic_of_Context_with_Actions","namespace":0,"exists":"1","displaytitle":"Projection in a Description Logic of Context with Actions"},"Provenance and Probabilities in Relational Databases":{"printouts":{"Start":[{"timestamp":"1529659800","raw":"1\/2018\/6\/22\/9\/30\/0\/0"}],"Ende":[{"timestamp":"1529665200","raw":"1\/2018\/6\/22\/11\/0\/0\/0"}],"title":["Provenance and Probabilities in Relational Databases"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Pierre Senellart"],"Details":["We review the basics of data provenance in relational databases. We describe different provenance formalisms, from Boolean provenance to provenance semirings and beyond, that can be used for a wide variety of purposes, to obtain additional information on the output of a query. We discuss representation systems for data provenance, circuits in particular, with a focus on practical implementation. Finally, we explain how provenance is practically used for probabilistic query evaluation in probabilistic databases.\n\n\n'''Bio:''' Pierre Senellart is a Professor in the Computer Science Department at the \u00c9cole normale sup\u00e9rieure (ENS, PSL University) in Paris, France, and an Adjunct Professor at T\u00e9l\u00e9com ParisTech. He is an alumnus of ENS and obtained his M.Sc. (2003) and Ph.D. (2007) in computer science from Universit\u00e9 Paris-Sud, studying under the supervision of Serge Abiteboul. Before joining ENS, he was an Associate Professor (2008\u20132013) then a Professor (2013\u20132016) at T\u00e9l\u00e9com ParisTech. He also held secondary appointments as Lecturer at the University of Hong Kong in 2012\u20132013, and as Senior Research Fellow at the National University of Singapore from 2014 to 2016. His research interests focus around practical and theoretical aspects of Web data management, including Web crawling and archiving, Web information extraction, uncertainty management, Web mining, and intensional data management."]},"fulltext":"Provenance and Probabilities in Relational Databases","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Provenance_and_Probabilities_in_Relational_Databases","namespace":0,"exists":"1","displaytitle":"Provenance and Probabilities in Relational Databases"},"Quantitative Versions of the Chomsky-Sch\u00fctzenberger Theorem":{"printouts":{"Start":[{"timestamp":"1449150300","raw":"1\/2015\/12\/3\/13\/45\/0\/0"}],"Ende":[{"timestamp":"1449153900","raw":"1\/2015\/12\/3\/14\/45\/0\/0"}],"title":["Quantitative Versions of the Chomsky-Sch\u00fctzenberger Theorem"],"Room":[{"fulltext":"ABP 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/ABP_3105","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Pavlos Marantidis"],"Details":["The emergence of weighted structures in Formal Language Theory naturally gave rise to questions whether classical results hold in more general environments. The Chomsky-Sch\u00fctzenberger Theorem (1963) states that any context-free language (CFL) can be represented by two simpler languages, a regular and a Dyck language. Droste and Vogler (2013) derived such a theorem for the abstract structure of unital valuation monoids. In this talk, these constructions, in addition to a similar approach for stochastic CFLs will be presented."]},"fulltext":"Quantitative Versions of the Chomsky-Sch\u00fctzenberger Theorem","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Quantitative_Versions_of_the_Chomsky-Sch%C3%BCtzenberger_Theorem","namespace":0,"exists":"1","displaytitle":"Quantitative Versions of the Chomsky-Sch\u00fctzenberger Theorem"},"Quantum Computing and the Limits of the Efficiently Computable":{"printouts":{"Start":[{"timestamp":"1503928800","raw":"1\/2017\/8\/28\/14\/0\/0\/0"}],"Ende":[{"timestamp":"1503932400","raw":"1\/2017\/8\/28\/15\/0\/0\/0"}],"title":["Quantum Computing and the Limits of the Efficiently Computable"],"Room":[{"fulltext":"APB E023","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_E023","namespace":0,"exists":"1","displaytitle":"Raum APB E023"}],"Type":["Vortrag"],"Speaker":["Scott Aaronson"],"Details":["I'll offer a crash course on quantum computing, which seeks to exploit the strange rules of quantum physics to solve certain problems dramatically faster than we know how to solve them with any existing computer. I promise no hype: just a a sober summary of how a quantum computer would actually work (hint: it's not just by \"trying every possible answer in parallel\"), for which problems quantum computers are and aren't expected to provide an advantage, and the current status of the effort to make quantum computing practical. I'll also say something about the ultimate physical limits of computation, and about speculative proposals for going beyond even quantum computers.\n\n \n'''Bio'''\n\n[http:\/\/www.scottaaronson.com\/ Scott Aaronson] is David J. Bruton Centennial Professor of Computer Science at the University of Texas at Austin. He received his bachelor's from Cornell University and his PhD from UC Berkeley, and did postdoctoral fellowships at the Institute for Advanced Study as well as the University of Waterloo. Before coming to UT Austin, he spent nine years as a professor in Electrical Engineering and Computer Science at MIT. Aaronson's research in theoretical computer science has focused mainly on the capabilities and limits of quantum computers. His first book, Quantum Computing Since Democritus, was published in 2013 by Cambridge University Press. He\u2019s received the National Science Foundation\u2019s Alan T. Waterman Award, the United States PECASE Award, the Vannevar Bush Fellowship, and MIT's Junior Bose Award for Excellence in Teaching."]},"fulltext":"Quantum Computing and the Limits of the Efficiently Computable","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Quantum_Computing_and_the_Limits_of_the_Efficiently_Computable","namespace":0,"exists":"1","displaytitle":"Quantum Computing and the Limits of the Efficiently Computable"},"Query Rewriting for DL-Lite with n-ary Concrete Domains":{"printouts":{"Start":[{"timestamp":"1498136400","raw":"1\/2017\/6\/22\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1498140000","raw":"1\/2017\/6\/22\/14\/0\/0\/0"}],"title":["Query Rewriting for DL-Lite with n-ary Concrete Domains"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Stefan Borgwardt"],"Details":["We investigate ontology-based query answering (OBQA) in a setting where both the ontology and the query can refer to concrete values such as numbers and strings. In contrast to previous work on this topic, the built-in predicates used to compare values are not restricted to being unary. We introduce restrictions on these predicates and on the ontology language that allow us to reduce OBQA to query answering in databases using the so-called combined rewriting approach. Though at first sight our restrictions are different from the ones used in previous work, we show that our results strictly subsume some of the existing first-order rewritability results for unary predicates."]},"fulltext":"Query Rewriting for DL-Lite with n-ary Concrete Domains","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Query_Rewriting_for_DL-Lite_with_n-ary_Concrete_Domains","namespace":0,"exists":"1","displaytitle":"Query Rewriting for DL-Lite with n-ary Concrete Domains"},"Query Stability in Data-aware Business Processes":{"printouts":{"Start":[{"timestamp":"1481122200","raw":"1\/2016\/12\/7\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1481125800","raw":"1\/2016\/12\/7\/15\/50\/0\/0"}],"title":["Query Stability in Data-aware Business Processes"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Werner Nutt"],"Details":["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.\n\n\nWe 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.\n\n\nWerner 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."]},"fulltext":"Query Stability in Data-aware Business Processes","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Query_Stability_in_Data-aware_Business_Processes","namespace":0,"exists":"1","displaytitle":"Query Stability in Data-aware Business Processes"},"Querying Probabilistic Ontologies":{"printouts":{"Start":[{"timestamp":"1422283800","raw":"1\/2015\/1\/26\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1422287400","raw":"1\/2015\/1\/26\/15\/50\/0\/0"}],"title":["Querying Probabilistic Ontologies"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["J\u00f6rg Sch\u00f6nfisch"],"Details":["In recent years a lot of efforts was put into the field of Semantic Web research to specify knowledge as precisely as possible. However, optimizing for precision alone is not sufficient. The handling of uncertain or incomplete information is getting more and more important and it promises to significantly improve the quality of query answering in Semantic Web applications. In this presentation in present my plan to develop a framework that extends the rich semantics offered by ontologies with probabilistic information, stores this in a probabilistic database and provides query answering with the help of query rewriting. I describe how these three aspects can be combined. Especially, I am focusing on how uncertainty is incorporated into the ABox and how it is handled by the database and the rewriter during query answering."]},"fulltext":"Querying Probabilistic Ontologies","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Querying_Probabilistic_Ontologies","namespace":0,"exists":"1","displaytitle":"Querying Probabilistic Ontologies"},"Querying Wikidata with GraphQL":{"printouts":{"Start":[{"timestamp":"1686222000","raw":"1\/2023\/6\/8\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1686225600","raw":"1\/2023\/6\/8\/12\/0\/0\/0"}],"title":["Querying Wikidata with GraphQL"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Anas Shahab"],"Details":["Abstract: Knowledge graphs like Wikidata are widely used in commercial and\nresearch domains. They represent knowledge that conveys information\nabout the real world in the form of graphs. Often they are modelled\nusing directed-edge labelled graphs using the Resource Description\nFramework (RDF). RDF is a framework that represents information in the\nform of Linked Data. SPARQL is a protocol and query language for RDF. It\nis based on matching graph patterns and is used to query RDF graphs.\nSPARQL is a powerful query language as it is expressive, and provides\nmany features to retrieve and manipulate data. However, SPARQL queries\nare complex in nature and have a steep learning curve. There are few\ntools and libraries available to developers for working with SPARQL.\nGraphQL is a popular query language for working with APIs. It is a\nflexible query language and is designed to have a human-oriented syntax.\nThis makes it easy for developers to learn and implement it in\napplications. Moreover, there are many supporting resources that help\nthe integration of GraphQL into the development of such systems.\n\nThe purpose of our work is to show ways of querying the knowledge graph,\nWikidata, using GraphQL queries. This helps avoid the complexity of\ndealing with SPARQL queries, and makes use of the flexibility and\nfeatures offered by GraphQL. In this work, we show some key differences\nbetween GraphQL and SPARQL. We show some existing commercial and\nopen-source solutions to query RDF data via GraphQL. Our main focus is\nto introduce two existing open-source solutions, GraphQL-LD and\nHyperGraphQL, that can be used to query Wikidata via GraphQL queries.\nBoth these approaches use GraphQL queries to act as layer of abstraction\nthat hides the complexity of SPARQL queries. We show extensively how\nthese approaches operate and the respective features that they offer. We\nprovide details on how we can use GraphQL-LD and HyperGraphQL to fetch\ndata from Wikidata and demonstrate the results. Since they are\nopen-source, we made appropriate changes to the source code to implement\nthe approaches on Wikidata. The changes were also made to help analyse\nthe steps in the implementation and facilitate querying. Our results\nshow that some key differences between GraphQL-LD and HyperGraphQL exist\nin terms of implementation and features. We demonstrate these in this\nwork extensively and compare them via examples against standard GraphQL\nand SPARQL features.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Querying Wikidata with GraphQL","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Querying_Wikidata_with_GraphQL","namespace":0,"exists":"1","displaytitle":"Querying Wikidata with GraphQL"},"Question Answering Systems":{"printouts":{"Start":[{"timestamp":"1475672400","raw":"1\/2016\/10\/5\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1475676000","raw":"1\/2016\/10\/5\/14\/0\/0\/0"}],"title":["Question Answering Systems"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Anatoly Zelenin"],"Details":["With the ever-growing amount of linked data available on the web there is a need for user-friendly interfaces to query this data. One way to\nachieve this is to provide systems that can answer natural language questions. In this talk I will present recent approaches to such Question Answering Systems and Natural Language Interfaces, focusing on the translation from natural language to query languages."]},"fulltext":"Question Answering Systems","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Question_Answering_Systems","namespace":0,"exists":"1","displaytitle":"Question Answering Systems"},"Question Answering over Real-World Knowledge Graphs":{"printouts":{"Start":[{"timestamp":"1495112400","raw":"1\/2017\/5\/18\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1495116000","raw":"1\/2017\/5\/18\/14\/0\/0\/0"}],"title":["Question Answering over Real-World Knowledge Graphs"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Anatoly Zelenin"],"Details":["With more and more data created and stored in databases there is a need for more user-friendly interfaces to query this data. Question Answering Systems, also called Natural Language Interfaces, are one of the approaches that try to provide such interfaces. Instead of typing a query in a formal query language the user asks the question in natural language.\n\nWe present a novel formalism for semantic composition called Phrase Representation Structures and based on this formalism we propose an architecture and a prototypical implementation for interactive Question Answering Systems. We address one of the main issues of such systems: the manual creation of a Lexicon for large knowledge bases. To create the Lexicon we use the lexical information contained in the knowledge base. Additionally, we provide an user interface such that users can complete the lexical information.\n\nOur findings indicate that our proposed architecture could be used as a foundation for Question Answering Systems focused on professional users. Finally, we discuss promising directions for future research to improve the quality and the user-friendliness of such systems."]},"fulltext":"Question Answering over Real-World Knowledge Graphs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Question_Answering_over_Real-World_Knowledge_Graphs","namespace":0,"exists":"1","displaytitle":"Question Answering over Real-World Knowledge Graphs"},"Quine's Fluted Fragment":{"printouts":{"Start":[{"timestamp":"1557406800","raw":"1\/2019\/5\/9\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1557412200","raw":"1\/2019\/5\/9\/14\/30\/0\/0"}],"title":["Quine's Fluted Fragment"],"Room":[],"Type":["Vortrag"],"Speaker":["Ian Pratt-Hartmann"],"Details":["We consider the fluted fragment, a decidable fragment of first-order logic with an unbounded number of variables, originally identified in 1968 by W. V. Quine. We show that the satisfiability problem for this fragment has non-elementary complexity, thus refuting an earlier published claim by W.C. Purdy that it is in NExpTime. More precisely, we consider the intersection of the fluted fragment and the m-variable fragment of first-order logic, for all non-negative m. We obtain upper and lower complexity bounds for this fragment that coincide for all m up to the value 4.\n\n\n'''Short bio:''' Ian Pratt-Hartmann studied mathematics and philosophy at [http:\/\/www.bnc.ox.ac.uk Brasenose College, Oxford], and philosophy at [http:\/\/www.princeton.edu\/main\/ Princeton] and [http:\/\/www.stanford.edu\/ Stanford] Universities, gaining his PhD. from Princeton. He is currently Senior Lecturer in the Department of Computer Science at the [http:\/\/www.manchester.ac.uk\/ University of Manchester]. Since February, 2014, Dr. Pratt-Hartmann has held a joint appointment in the [http:\/\/informatyka.wmfi.uni.opole.pl\/ Institute of Computer Science] at the [http:\/\/www.uni.opole.pl\/ University of Opole]. His academic interests range widely over computational logic, natural language semantics and artificial intelligence."]},"fulltext":"Quine's Fluted Fragment","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Quine%27s_Fluted_Fragment","namespace":0,"exists":"1","displaytitle":"Quine's Fluted Fragment"},"Reasonable Highly Expressive Query Languages":{"printouts":{"Start":[{"timestamp":"1438613400","raw":"1\/2015\/8\/3\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1438617000","raw":"1\/2015\/8\/3\/15\/50\/0\/0"}],"title":["Reasonable Highly Expressive Query Languages"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Markus Kr\u00f6tzsch"],"Details":["Expressive query languages are gaining relevance in knowledge representation (KR), and new reasoning problems come to the fore. Especially query containment is interesting in this context. The problem is known to be decidable for many expressive query languages, but exact complexities are often missing. We introduce a new query language, guarded queries (GQ), which generalizes most known languages where query containment is decidable. GQs can be nested (more expressive), or restricted to linear recursion (less expressive). Our comprehensive analysis of the computational properties and expressiveness of (linear\/nested) GQs also yields insights on many previous languages."]},"fulltext":"Reasonable Highly Expressive Query Languages","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Reasonable_Highly_Expressive_Query_Languages","namespace":0,"exists":"1","displaytitle":"Reasonable Highly Expressive Query Languages"},"Reasoning about disclosure in data integration in the presence of source constraints":{"printouts":{"Start":[{"timestamp":"1563454800","raw":"1\/2019\/7\/18\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1563458400","raw":"1\/2019\/7\/18\/14\/0\/0\/0"}],"title":["Reasoning about disclosure in data integration in the presence of source constraints"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Micha\u00ebl Thomazo"],"Details":["Joint work with M. Benedikt, P. Bourhis, L. Jachiet\n\n\n'''Abstract:''' Data integration systems allow users to access data sitting in multiple sources by means of queries over a global schema, related to the sources via mappings. Data sources often contain sensitive information, and thus an analysis is needed to verify that a schema satisfies a privacy policy, given as a set of queries whose answers should not be accessible to users. Such an analysis should take into account not only knowledge that an attacker may have about the mappings, but also what they may know about the semantics of the sources. In this talk, I'll discuss the impact that source constraints can have on disclosure analysis.\n\n'''Speaker bio:''' Micha\u00ebl Thomazo (Inria, DI ENS, ENS, CNRS, PSL University)"]},"fulltext":"Reasoning about disclosure in data integration in the presence of source constraints","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Reasoning_about_disclosure_in_data_integration_in_the_presence_of_source_constraints","namespace":0,"exists":"1","displaytitle":"Reasoning about disclosure in data integration in the presence of source constraints"},"Relating Description Complexity to Entropy":{"printouts":{"Start":[{"timestamp":"1678964400","raw":"1\/2023\/3\/16\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1678968000","raw":"1\/2023\/3\/16\/12\/0\/0\/0"}],"title":["Relating Description Complexity to Entropy"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Reijo Jaakkola"],"Details":["We demonstrate some novel links between entropy and description complexity, a notion referring to the minimal formula length for specifying given properties. Let MLU be the logic obtained by extending propositional logic with the universal modality, and let GMLU be the corresponding extension with the ability to count. In the finite, MLU is expressively complete for specifying sets of variable assignments, while GMLU is expressively complete for multisets. We show that for MLU, the model classes with maximal Boltzmann entropy are the ones with maximal description complexity. Concerning GMLU, we show that expected Boltzmann entropy is asymptotically equivalent to expected description complexity multiplied by the number of proposition symbols considered. To contrast these results, we prove that this link breaks when we move to considering first-order logic FO over vocabularies with higher-arity relations. To establish the aforementioned result, we show that almost all finite models require relatively large FO-formulas to define them. Our results relate to links between Kolmogorov complexity and entropy, demonstrating a way to conceive such results in the logic-based scenario where relational structures are classified by formulas of different sizes.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Relating Description Complexity to Entropy","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Relating_Description_Complexity_to_Entropy","namespace":0,"exists":"1","displaytitle":"Relating Description Complexity to Entropy"},"Relbacoess":{"printouts":{"Start":[{"timestamp":"1421058600","raw":"1\/2015\/1\/12\/10\/30\/0\/0"}],"Ende":[{"timestamp":"1421062200","raw":"1\/2015\/1\/12\/11\/30\/0\/0"}],"title":["Relbacoess"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Rui Zhang"],"Details":["A brief talk on the research work on formal modeling access control via description logics, modeling ontology evolution via Pi calculus and a current project in the recent years and possible topics to collaborate on."]},"fulltext":"Relbacoess","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Relbacoess","namespace":0,"exists":"1","displaytitle":"Relbacoess"},"Reliance-Based Optimization of Existential Rule Reasoning":{"printouts":{"Start":[{"timestamp":"1639043100","raw":"1\/2021\/12\/9\/9\/45\/0\/0"}],"Ende":[{"timestamp":"1639046700","raw":"1\/2021\/12\/9\/10\/45\/0\/0"}],"title":["Reliance-Based Optimization of Existential Rule Reasoning"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Alex Ivliev"],"Details":["Existential rules is a powerful formalism for describing implicit knowledge contained within a dataset. Extracting such knowledge can be achieved with the chase, which is a well-known algorithm for computing universal models. This is done by exhaustively calculating the consequences of each given rule. However, the order in which the rules are selected can have a significant impact on the run time of the procedure as well as the number of derived facts. It was discovered in recent work that core-stratified rule sets allow for a selection strategy that is guaranteed to produce so-called core models, which, in the finite case, correspond to the smallest possible universal models. The strategy is based on considering certain syntactic relationships between the rules called reliances. These indicate whether it is possible for a rule to produce facts used by another or if selecting a rule in the wrong order may introduce redundant facts into the result.\n\nIn this work, we utilize these reliances to devise rule application strategies that optimize the chase procedure based on the following criteria: First, we try to minimize the number of times rules are applied during the chase, aiming to improve run times. Second, we want to avoid applying rules in a way which introduces redundant facts. The goal here is to minimize the size of the resulting model, ideally producing a core. While it is always possible to derive a core model in core-stratified rule sets, we show situations where our approach is guaranteed to produce cores even if the rule set is not stratified. Moreover, we give a detailed description of the algorithms necessary for detecting a reliance relationship between two given rules as well as prove their correctness. We implement our approach into the rule reasoning engine VLog and evaluate its effectiveness on several knowledge bases used for benchmarking as well as some real-world datasets. We find a significant improvement in the run times for a small portion of the considered knowledge bases and are able to match VLog in the remaining ones.\n\nThis is a diploma defense, the talk is online.\nLink: https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Reliance-Based Optimization of Existential Rule Reasoning","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Reliance-Based_Optimization_of_Existential_Rule_Reasoning","namespace":0,"exists":"1","displaytitle":"Reliance-Based Optimization of Existential Rule Reasoning"},"Report on research visit to NRC":{"printouts":{"Start":[{"timestamp":"1538658000","raw":"1\/2018\/10\/4\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1538663400","raw":"1\/2018\/10\/4\/14\/30\/0\/0"}],"title":["Report on research visit to NRC"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Shima Asaadi"],"Details":["Report on research visit to NRC"]},"fulltext":"Report on research visit to NRC","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Report_on_research_visit_to_NRC","namespace":0,"exists":"1","displaytitle":"Report on research visit to NRC"},"Representative Answer Sets: Collecting Something of Everything":{"printouts":{"Start":[{"timestamp":"1694689200","raw":"1\/2023\/9\/14\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1694692800","raw":"1\/2023\/9\/14\/12\/0\/0\/0"}],"title":["Representative Answer Sets: Collecting Something of Everything"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Elisa B\u00f6hl"],"Details":["Title: Representative Answer Sets: Collecting Something of Everything\n\nAbstract: Answer set programming (ASP) is a popular problem\nsolving paradigm with applications in planning and configuration.\nIn practice, the number of answer sets can be overwhelmingly high,\nwhich naturally causes interest in a concise characterisation of the\nsolution space in terms of representative answer sets. We establish\na notion of representativeness that refers to the entropy of specified\ntarget atoms within a collection of answer sets. Accordingly, we pro-\npose different approaches for collecting such representative answer\nsets, based on answer set navigation. Finally, we conduct experi-\nments using our prototypical implementation, which reveals promis-\ning results.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Representative Answer Sets: Collecting Something of Everything","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Representative_Answer_Sets:_Collecting_Something_of_Everything","namespace":0,"exists":"1","displaytitle":"Representative Answer Sets: Collecting Something of Everything"},"Representing Abstract Dialectical Frameworks with Binary Decision Diagrams":{"printouts":{"Start":[{"timestamp":"1662030000","raw":"1\/2022\/9\/1\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1662031800","raw":"1\/2022\/9\/1\/11\/30\/0\/0"}],"title":["Representing Abstract Dialectical Frameworks with Binary Decision Diagrams"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Stefan Ellmauthaler"],"Details":["Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.\n\nThe talk will take place in a hybrid fashion, physically in the seminar room, and online through the link:\n\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Representing Abstract Dialectical Frameworks with Binary Decision Diagrams","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Representing_Abstract_Dialectical_Frameworks_with_Binary_Decision_Diagrams","namespace":0,"exists":"1","displaytitle":"Representing Abstract Dialectical Frameworks with Binary Decision Diagrams"},"Research Lightning Talks":{"printouts":{"Start":[{"timestamp":"1719486000","raw":"1\/2024\/6\/27\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1719489600","raw":"1\/2024\/6\/27\/12\/0\/0\/0"}],"title":["Research Lightning Talks"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Aidan Bailey, Lucas Carr, Luke Slater"],"Details":["In this seminar session, three of our guest students will present their recent and ongoing research in three short talks.\n\n\n1. Aidan Bailey will show two applications of ASP. On one hand, the generation of propositional formulas, and by extension knowledge bases, adhering to specified properties. On the other hand, graph drawing via placements of nodes and edges adhering to constraints and optimised on specific criteria promoting usability, understandability and aesthetics.\n\n2. Lucas Carr will present an idea for a notion of defeasible implications in formal concept analysis, which is currently being developed. Formal concept analysis allows us to model hierarchies between concepts, where concepts are defined by a relation between objects which fall into the concept, and properties these objects share. A clear notion of implication exists within FCA, which can be loosely characterised as saying attributes X imply attributes Y, if every object with X also has Y. The focus of my work will be to try introduce a notion of defeasibility, which would enable us to say attributes X imply attributes Y within some frame of preference, or typicality. The motivation for this is to allow to recognise relations in data which do not strictly hold, but are still potentially useful.\n\n3. Luke Slater will talk about knowledge compilation for ranking functions. Ranking functions are essential in various domains of defeasible reasoning, such as belief revision. These functions operate by dividing the space of Boolean valuations into a totally ordered partition, necessitating separate SAT solving steps for inference at each rank. This research aims to develop a method to compile a ranking function into a single structure, facilitating inference through a single query."]},"fulltext":"Research Lightning Talks","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Research_Lightning_Talks","namespace":0,"exists":"1","displaytitle":"Research Lightning Talks"},"Restricted Chase (Non)Termination for Existential Rules with Disjunctions":{"printouts":{"Start":[{"timestamp":"1493298000","raw":"1\/2017\/4\/27\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1493301600","raw":"1\/2017\/4\/27\/14\/0\/0\/0"}],"title":["Restricted Chase (Non)Termination for Existential Rules with Disjunctions"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Davil Carral"],"Details":["The restricted chase is a sound and complete algorithm for conjunctive query answering over ontologies of disjunctive existential rules. We develop acyclicity conditions to ensure its termination. Our criteria cannot always detect termination (the problem is undecidable), and we develop the first cyclicity criteria to show non-termination of the restricted chase. Experiments on real-world ontologies show that our acyclicity notions improve significantly over known criteria and that most remaining ontologies are indeed cyclic."]},"fulltext":"Restricted Chase (Non)Termination for Existential Rules with Disjunctions","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Restricted_Chase_(Non)Termination_for_Existential_Rules_with_Disjunctions","namespace":0,"exists":"1","displaytitle":"Restricted Chase (Non)Termination for Existential Rules with Disjunctions"},"Restricted Chase Acyclicity: A Novel Acyclicity Notion for Description Logics":{"printouts":{"Start":[{"timestamp":"1478098200","raw":"1\/2016\/11\/2\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1478101800","raw":"1\/2016\/11\/2\/15\/50\/0\/0"}],"title":["Restricted Chase Acyclicity: A Novel Acyclicity Notion for Description Logics"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["David Carral"],"Details":["Conjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the chase algorithm. In this presentation, we will introduce a novel acyclicity notion which provides a sufficient condition for termination of the restricted chase over Horn-SRIQ TBoxes. We also show that this notion generalizes most existing acyclicity conditions (both theoretically and empirically). Furthermore, this new acyclicity notion gives rise to a very efficient reasoning procedure. We provide evidence for this by providing a materialization based reasoner for acyclic ontologies which outperforms state-of-the-art systems."]},"fulltext":"Restricted Chase Acyclicity: A Novel Acyclicity Notion for Description Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Restricted_Chase_Acyclicity:_A_Novel_Acyclicity_Notion_for_Description_Logics","namespace":0,"exists":"1","displaytitle":"Restricted Chase Acyclicity: A Novel Acyclicity Notion for Description Logics"},"Revisiting Circumscription":{"printouts":{"Start":[{"timestamp":"1494507600","raw":"1\/2017\/5\/11\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1494511200","raw":"1\/2017\/5\/11\/14\/0\/0\/0"}],"title":["Revisiting Circumscription"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Walter Forkel"],"Details":["Circumscription is one of the classic formalisms for introducing non-monotonicity in a logic. In this talk, we show that the current version of circumscription in certain cases does not allow to draw conclusions that would be expected intuitively. We analyze the cases in which that happens and introduce a novel definition of circumscription that subsumes the original circumscription, and behaves as intuitively expected. We show that the new formulation has useful properties, in particular that it reduces to standard first-order logic in certain setups."]},"fulltext":"Revisiting Circumscription","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Revisiting_Circumscription","namespace":0,"exists":"1","displaytitle":"Revisiting Circumscription"},"SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability":{"printouts":{"Start":[{"timestamp":"1576760400","raw":"1\/2019\/12\/19\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1576765800","raw":"1\/2019\/12\/19\/14\/30\/0\/0"}],"title":["SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Marcos Cramer"],"Details":["In abstract argumentation theory, many argumentation semantics have been proposed for evaluating argumentation frameworks. This paper is based on the following research question: Which semantics corresponds well to what humans consider a rational judgment on the acceptability of arguments? There are two systematic ways to approach this research question: A normative perspective is provided by the principle-based approach, in which semantics are evaluated based on their satisfaction of various normatively desirable principles. A descriptive perspective is provided by the empirical approach, in which cognitive studies are conducted to determine which semantics best predicts human judgments about arguments. In this paper, we combine both approaches to motivate a new argumentation semantics called SCF2. For this purpose, we introduce and motivate two new principles and show that no semantics from the literature satisfies both of them. We define SCF2 and prove that it satisfies both new principles. Furthermore, we discuss findings of a recent empirical cognitive study that provide additional support to SCF2."]},"fulltext":"SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/SCF2_-_an_Argumentation_Semantics_for_Rational_Human_Judgments_on_Argument_Acceptability","namespace":0,"exists":"1","displaytitle":"SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability"},"SEABirds: An AHP Approach to Solve the Angry Birds AI Challenge":{"printouts":{"Start":[{"timestamp":"1466607000","raw":"1\/2016\/6\/22\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1466610600","raw":"1\/2016\/6\/22\/15\/50\/0\/0"}],"title":["SEABirds: An AHP Approach to Solve the Angry Birds AI Challenge"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":[],"Details":["SEABirds is the agent developed using the Analytic Hierarchical Process (AHP), a decision making technique, to play and compete in the Angry Birds AI Competition. The distinctive characteristic of our agent is the usage of AHP in combination with human-based values, which gives modest results compared to other agents in the benchmark. Precisely, our agent outperforms 20 other agents that used different approaches to solve the same 21 levels of the game, given roughly the same amount of time."]},"fulltext":"SEABirds: An AHP Approach to Solve the Angry Birds AI Challenge","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/SEABirds:_An_AHP_Approach_to_Solve_the_Angry_Birds_AI_Challenge","namespace":0,"exists":"1","displaytitle":"SEABirds: An AHP Approach to Solve the Angry Birds AI Challenge"},"SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer)":{"printouts":{"Start":[{"timestamp":"1707390000","raw":"1\/2024\/2\/8\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1707393600","raw":"1\/2024\/2\/8\/12\/0\/0\/0"}],"title":["SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer)"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Anouk Michelle Oudshoorn"],"Details":["Abstract: SHACL is a widely used W3C standard to manage RDF data: it is used to express integrity constraints on \"complete\" data. These constraints may contain recursion and negation and many other kinds of exotic features, like counting over paths expressed by regular expressions. As SHACL is intended for validation over complete data, we add ontologies to the RDF data (and create a knowledge base) and ask what it means to combine both: we define validation of SHACL combined with ontologies as SHACL validation over the core chase of this knowledge base. \n\nHowever, creating the core chase is not feasible in practice. To tackle this, we propose a way to build the core chase in a layer-by-layer manner, based on pre-calculated building blocks and without having to look for non-embedding endomorphisms, as the usual core construction does. We use these building blocks to rewrite SHACL validation in case of ontologies to plain SHACL validation.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer)","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/SHACL_validation_over_DL-Lite,_ELHI_and_Horn-SHIQ_ontologies_(or_calculating_the_core_chase_layer-by-layer)","namespace":0,"exists":"1","displaytitle":"SHACL validation over DL-Lite, ELHI and Horn-SHIQ ontologies (or calculating the core chase layer-by-layer)"},"SOQE 2017":{"printouts":{"Start":[{"timestamp":"1512550800","raw":"1\/2017\/12\/6\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1512756000","raw":"1\/2017\/12\/8\/18\/0\/0\/0"}],"title":["SOQE 2017: Workshop on Second-Order Quantifier Elimination and Related Topics"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["Workshop on Second-Order Quantifier Elimination and Related Topics"]},"fulltext":"SOQE 2017","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/SOQE_2017","namespace":0,"exists":"1","displaytitle":"SOQE 2017: Workshop on Second-Order Quantifier Elimination and Related Topics"},"SQID: Reasonable Wikidata":{"printouts":{"Start":[{"timestamp":"1510219200","raw":"1\/2017\/11\/9\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1510224600","raw":"1\/2017\/11\/9\/10\/50\/0\/0"}],"title":["SQID: Reasonable Wikidata"],"Room":[],"Type":["Vortrag"],"Speaker":["Maximilian Marx"],"Details":["SQID is a data browser for Wikidata that integrates data from various\nsources, including the Wikidata Query service, the Wikidata API,\nWikidata dumps (analysed offline), and further Wikimedia sources. It\nfeatures class and property browsers, and provides a concise display of\nboth outgoing and incoming statements for items.\n\nA recent addition to SQID is the integration of proposals from Primary\nSources, where proposed references may be approved or rejected with just\na single click.\n\nWe extend SQID with a reasoning component that is able to infer new\nstatements from existing data. These rules can be used to:\n- materialise statements that should be present, but are not (such as inverses of \u201cspouse\u201d statements);\n- find inconsistencies in the data (e.g., statements missing mandatory qualifiers); and to\n- display statements that logically follow from the data, but do not need to be materialised (e.g., \u201crelative\u201d statements obtained from following \u201cfather\u201d\/\u201cmother\u201d-paths).\n\nRules of the latter type contribute to a better browsing experience by\nmaking explicit data that could only be obtained by combining different\nstatements (not necessarily belonging to the same item), whereas rules\nof the former types help to improve the quality of the data itself.\n\nWe introduce the basic usage of SQID and demonstrate applications for\nrules in the use cases above."]},"fulltext":"SQID: Reasonable Wikidata","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/SQID:_Reasonable_Wikidata","namespace":0,"exists":"1","displaytitle":"SQID: Reasonable Wikidata"},"STEP by Step, towards Smart Services":{"printouts":{"Start":[{"timestamp":"1518081600","raw":"1\/2018\/2\/8\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1518087000","raw":"1\/2018\/2\/8\/10\/50\/0\/0"}],"title":["STEP by Step, towards Smart Services"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Maria Maleshkova"],"Details":["The past few years have been marked by the increased use of sensor technologies, abundant availability of mobile devices, and growing popularity of wearables, which enable the direct integration of their data as part of rich client applications. Despite the potential and added value that such aggregate applications bring, the implementations are usually custom solutions for particular use cases and do not support easy integration of further devices. To this end, the vision of the Web of Things (WoT) is to leverage Web standards in order to interconnect all types of devices and real-world objects, and thus to make them a part of the World Wide Web (WWW) and provide overall interoperability. Especially in the context of Industry 4.0, where processes, hardware and applications are integrated beyond the individual companies\u2019 borders, interoperability, connectivity and data integration are key for developing Smart Services \u2013 a vision of tomorrow's way of delivering services, which build on top of intelligent machines and products that communicate with each other, cooperatively driving production. Within this setup, the STEP project aims to provide architectural solutions, process optimisation, and data representation approaches that support the realisation of predictive."]},"fulltext":"STEP by Step, towards Smart Services","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/STEP_by_Step,_towards_Smart_Services","namespace":0,"exists":"1","displaytitle":"STEP by Step, towards Smart Services"},"Satisfiability Testing -- Recent Developments and Open Problems":{"printouts":{"Start":[{"timestamp":"1655377200","raw":"1\/2022\/6\/16\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1655380800","raw":"1\/2022\/6\/16\/12\/0\/0\/0"}],"title":["Satisfiability Testing -- Recent Developments and Open Problems"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Norbert Manthey"],"Details":["With the introduction of clause learning in 1996,\nsatisfiability testing (SAT) solvers have become effective to replace\nother state-of-the-art algorithm in applications. Shortly after,\nefficient data structures and heuristics have been introduced, boosting\nthe performance of these solvers further. Recent developments shift SAT\nsolvers towards anytime algorithms, to attempt to find a good average\nsolving time for a wide range of input problems. Consequently, SAT\nsolvers have become the core tool to solve many industrial applications.\nHowever, there are still limitations, and open research questions that\nwould allow to make SAT solving even more effective. This presentation\nwill shed some light on various past and recent developments, as well as\npoint out current known limitations as well as open research questions.\n\nThe talk is Hybird, with a 20 person maximum capacity in the seminar room APB 3027\n\nOnline link: https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Satisfiability Testing -- Recent Developments and Open Problems","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Satisfiability_Testing_--_Recent_Developments_and_Open_Problems","namespace":0,"exists":"1","displaytitle":"Satisfiability Testing -- Recent Developments and Open Problems"},"Satisfiability in the Triguarded Fragment of First-Order Logic":{"printouts":{"Start":[{"timestamp":"1543496400","raw":"1\/2018\/11\/29\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1543501800","raw":"1\/2018\/11\/29\/14\/30\/0\/0"}],"title":["Satisfiability in the Triguarded Fragment of First-Order Logic"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Sebastian Rudolph"],"Details":["'''Abstract:''' Most Description Logics (DLs) can be translated into well-known decidable fragments of first-order logic FO, including the guarded fragment GF and the two-variable fragment FO2. Given their prominence in DL research, we take closer look at GF and FO2, and present a new fragment that subsumes both. This fragment, called the triguarded fragment (denoted TGF), is obtained by relaxing the standard definition of GF: quantification is required to be guarded only for subformulae with three or more free variables. We show that satisfiability of equality-free TGF is N2ExpTime-complete, but becomes NExpTime-complete if we bound the arity of predicates by a constant (a natural assumption in the context of DLs). Finally, we observe that many natural extensions of TGF, including the addition of equality, lead to undecidability. \n\n\nThis talk is a presentation given at the 31st International Workshop on Description Logics, 2018."]},"fulltext":"Satisfiability in the Triguarded Fragment of First-Order Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Satisfiability_in_the_Triguarded_Fragment_of_First-Order_Logic","namespace":0,"exists":"1","displaytitle":"Satisfiability in the Triguarded Fragment of First-Order Logic"},"Satisfiability of temporal logics with concrete domain":{"printouts":{"Start":[{"timestamp":"1464187800","raw":"1\/2016\/5\/25\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1464191400","raw":"1\/2016\/5\/25\/15\/50\/0\/0"}],"title":["Satisfiability of temporal logics with concrete domain"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Claudia Carapelle"],"Details":["We show how we can enrich linear- and branching-time temporal logics with the ability to talk about data words and data trees, where the data values are taken from a \"concrete domain\" D. We consider the satisfiability problem for such logics, and identify sufficient conditions on D to guarantee decidability."]},"fulltext":"Satisfiability of temporal logics with concrete domain","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Satisfiability_of_temporal_logics_with_concrete_domain","namespace":0,"exists":"1","displaytitle":"Satisfiability of temporal logics with concrete domain"},"Second Workshop on Human Reasoning and Computational Logic":{"printouts":{"Start":[{"timestamp":"1523350800","raw":"1\/2018\/4\/10\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1523556000","raw":"1\/2018\/4\/12\/18\/0\/0\/0"}],"title":["Second Workshop on Human Reasoning and Computational Logic"],"Room":[{"fulltext":"APB 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["sonstige Veranstaltung"],"Speaker":[],"Details":["From the 10th to the 12th of April 2018, we organize the second workshop on Human Reasoning and Computational Logic at TU Dresden, Germany. The goal of this workshop is to provide a platform for the scientific exchange with respect to Human Reasoning between the areas of Cognitive Science and Computational Logic."]},"fulltext":"Second Workshop on Human Reasoning and Computational Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Second_Workshop_on_Human_Reasoning_and_Computational_Logic","namespace":0,"exists":"1","displaytitle":"Second Workshop on Human Reasoning and Computational Logic"},"Selected Advances in Data Semantics":{"printouts":{"Start":[{"timestamp":"1492524000","raw":"1\/2017\/4\/18\/14\/0\/0\/0"}],"Ende":[{"timestamp":"1492527600","raw":"1\/2017\/4\/18\/15\/0\/0\/0"}],"title":["Selected Advances in Data Semantics"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Pascal Hitzler"],"Details":["We present some recent advances in ontology engineering and its applications. This includes two Protege plug-ins and an extension to the OWL API which simplify the dealing with logical axioms in ontology modeling: The ROWLTab allows the user to enter OWL axioms in the form or rules; a formal evaluation which we conducted shows that this form of OWL modeling is quicker and less error-prone than the standard Protege interface. The OWLAX plug-in provides a diagram-based approach to the modeling of most common logical axioms. The OWL API LaTeX renderer provides transcriptions into description logic syntax. We will also present first results of some ongoing work on explaining trained neural networks by means of semantic background knowledge."]},"fulltext":"Selected Advances in Data Semantics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Selected_Advances_in_Data_Semantics","namespace":0,"exists":"1","displaytitle":"Selected Advances in Data Semantics"},"Semantic Search for Novel Information":{"printouts":{"Start":[{"timestamp":"1484825400","raw":"1\/2017\/1\/19\/11\/30\/0\/0"}],"Ende":[{"timestamp":"1484827200","raw":"1\/2017\/1\/19\/12\/0\/0\/0"}],"title":["Semantic Search for Novel Information"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Michael F\u00e4rber"],"Details":["Users more and more face the challenge to screen the continuously increasing number of (Web) documents and to assess the contained information with respect to their relevance and novelty. For instance, technology scouts need to discover and monitor new technologies, while investors and stock brokers would like to be informed about recent acquisitions. The approaches used so far for detecting novel information in text documents (semi-)automatically are often very inefficient. This is due to the fact that most approaches only consider the relevance, but not the novelty of text documents. The few existing novel information detection approaches do not use any semantically-structured representation of the already given and of the extracted information.\n\n\nIn this talk, new approaches for detecting and extracting novel, relevant information from unstructured text documents are presented which exploit the explicit modeling of the semantics of the given and extracted information. Using semantics has the benefit of resolving ambiguities in the language and to specify the exact information need regarding relevance and novelty. The explicit modeling is performed by using Semantic Web technologies such as the Resource Description Framework (RDF). In the presented work we assume that all knowledge which is known to the system is available in the form of an RDF knowledge graph.\nFirstly, we consider existing large knowledge graphs for the task of semantic novel information detection. Secondly, we present approaches for detecting emerging entities and novel RDF statements. Ultimately, the developed approaches can be used for knowledge graph population. This describes the task of enriching existing knowledge graphs with additional entities or triples."]},"fulltext":"Semantic Search for Novel Information","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Semantic_Search_for_Novel_Information","namespace":0,"exists":"1","displaytitle":"Semantic Search for Novel Information"},"Similarity search in metric spaces: New indexing techniques for similarity search in metric spaces":{"printouts":{"Start":[{"timestamp":"1449754200","raw":"1\/2015\/12\/10\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1449757800","raw":"1\/2015\/12\/10\/14\/30\/0\/0"}],"title":["Similarity search in metric spaces: New indexing techniques for similarity search in metric spaces"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Steffen Guhlemann"],"Details":["A topic of growing importance in computer science is the handling of similarity in multiple heterogenous domains. Currently there is no common infrastructure to support this for the general metric space. The goal of this work is lay the foundation for such an infrastructure, which could be integrated into classical data base management systems.\nAfter some analysis of the state of the art the M-Tree is identified as most suitable base and enhanced in multiple ways to the EM-Tree retaining structural compatibility. The query algorithms are optimized to reduce the number of necessary distance calculations. On the basis of a mathematical analysis of the relation between the tree structure and the query performance degrees of freedom in the tree edit algorithms are used to build trees optimized for answering similarity queries using a minimal number of distance calculations."]},"fulltext":"Similarity search in metric spaces: New indexing techniques for similarity search in metric spaces","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Similarity_search_in_metric_spaces:_New_indexing_techniques_for_similarity_search_in_metric_spaces","namespace":0,"exists":"1","displaytitle":"Similarity search in metric spaces: New indexing techniques for similarity search in metric spaces"},"Smoke Test Planning using Answer Set Programming":{"printouts":{"Start":[{"timestamp":"1599742800","raw":"1\/2020\/9\/10\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1599748200","raw":"1\/2020\/9\/10\/14\/30\/0\/0"}],"title":["Smoke Test Planning using Answer Set Programming"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Valentin Roland"],"Details":["Smoke testing is an important method to increase stability and reliability of hardware-depending systems. Due to concurrent access to the same physical resource and the impracticality of the use of virtualization, smoke testing requires some form of planning. In this paper, we propose to decompose test cases in terms of atomic actions consisting of preconditions and effects. We present a solution based on answer set programming with multi-shot solving that automatically generates short parallel test plans. Experiments suggest that the approach is feasible for non-inherently sequential test cases and scales up to thousands of test cases.\n\n\nThis talk will be held online and take approximately 30 minutes after which questions can be asked. If there is any interest in attending, please send an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"Smoke Test Planning using Answer Set Programming","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Smoke_Test_Planning_using_Answer_Set_Programming","namespace":0,"exists":"1","displaytitle":"Smoke Test Planning using Answer Set Programming"},"Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata":{"printouts":{"Start":[{"timestamp":"1457362200","raw":"1\/2016\/3\/7\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1457365800","raw":"1\/2016\/3\/7\/15\/50\/0\/0"}],"title":["Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Serge Stratan"],"Details":["Ontologies represent one of the basic elements in the Semantic Web. They contain background\nknowledge represented by relevant terms and formal relations between them, so that machines\ncan read it automatically. Ontologies on the Semantic Web come from a vast variety of different\nsources, spanning institutions, and persons aiming for different goals and quality criteria.\n\nMeasuring some of the aspects of ontologies, enables us to answer the question: \u201cHow to assess\nthe quality of an ontology on the Web?\u201d. The ontology evaluation task is essential for a wide\nadoption of ontologies, in the Semantic Web and in other semantically enabled technologies.\n\nThe Wikidata project, being a part of a big Wikimedia family, is widely known for its data that is\nprovided freely to the public. The data is structured and stored in a web ontology. This ontology\nhas turned immediately into a resource of big value, with a large range of potential applications\nacross all areas of science, technology, and culture. Unfortunately, at the moment there is no\npossibility to assess the quality of the Wikidata ontology.\n\nWe have chosen Wikidata as a basic scenario for implementation of an automated system which\nwould allow to browse the class hierarchy contained in the Wikidata ontology. The class hier-\narchy is created by the class entities and two properties (\u2018subclass of\u2019 and \u2018instance of\u2019) which\ndenote relations between classes. Besides the Wikidata taxonomy browser, additionally we im-\nplemented a component for ontology evaluation, which shows how the quality of the Wikidata\nontology is assessed for several evaluation criteria.\n\nThis is the defence of the eponymous Master thesis by Serge Stratan."]},"fulltext":"Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Software_Implementation_for_Taxonomy_Browsing_and_Ontology_Evaluation_for_the_case_of_Wikidata","namespace":0,"exists":"1","displaytitle":"Software Implementation for Taxonomy Browsing and Ontology Evaluation for the case of Wikidata"},"Solving Angry Birds with Reinforcement Learning":{"printouts":{"Start":[{"timestamp":"1487847600","raw":"1\/2017\/2\/23\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1487851200","raw":"1\/2017\/2\/23\/12\/0\/0\/0"}],"title":["Solving Angry Birds with Reinforcement Learning"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Richard Kwasnicki and Julius Gonsior"],"Details":["Reinforcement Learning is an area of machine learning tackling the problem, which action an agent should take to get a maximum reward. After explaining the model-free reinforcement learning technique Q-learning the result of implementing it for solving the popular puzzle video game Angry Birds is being presented."]},"fulltext":"Solving Angry Birds with Reinforcement Learning","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Solving_Angry_Birds_with_Reinforcement_Learning","namespace":0,"exists":"1","displaytitle":"Solving Angry Birds with Reinforcement Learning"},"Solving Datalog(S) Problems with Lazy-Grounding ASP Solving":{"printouts":{"Start":[{"timestamp":"1614862800","raw":"1\/2021\/3\/4\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1614868200","raw":"1\/2021\/3\/4\/14\/30\/0\/0"}],"title":["Solving Datalog(S) Problems with Lazy-Grounding ASP Solving"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Philipp Hanisch"],"Details":["Datalog(S) extends Datalog with support for sets, and it can be captured in a decidable fragment of existential rules. We show that it can also be captured by Answer Set Programming (ASP) with function symbols. The traditional ground-and-solve approach for ASP, however, is insufficient, as it computes the grounding in a first step before solving. Thus, the introduction of function symbols can lead to infinite groundings, even though a finite one would be sufficient, since grounding and solving are separated and the obtained grounding is an over-approximation of the smallest possible one. We therefore propose the use of ASP systems with lazy-grounding, i.e., systems that interleave grounding and solving, to solve Datalog(S) programs as they guarantee termination. We show empirically that the lazy-grounding ASP solver Alpha can solve practical Datalog(S) problems. \n\n\nNote that this talk acts as a colloquium\/examination for the module INF-PM-FPG.\nIt will take place online via BigBlueButton. To access the room, take one of the following links: \n\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=86965&p=58febf13\n\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=86965&p=35a69ec8"]},"fulltext":"Solving Datalog(S) Problems with Lazy-Grounding ASP Solving","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Solving_Datalog(S)_Problems_with_Lazy-Grounding_ASP_Solving","namespace":0,"exists":"1","displaytitle":"Solving Datalog(S) Problems with Lazy-Grounding ASP Solving"},"Solving Problems Exponentially Faster: Implementing a Nondeterministic Universal Turing Machine Using DNA":{"printouts":{"Start":[{"timestamp":"1443447000","raw":"1\/2015\/9\/28\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1443452400","raw":"1\/2015\/9\/28\/15\/0\/0\/0"}],"title":["Solving Problems Exponentially Faster: Implementing a Nondeterministic Universal Turing Machine Using DNA"],"Room":[{"fulltext":"APB 1004","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_1004","namespace":0,"exists":"1","displaytitle":"Raum APB 1004"}],"Type":["Vortrag"],"Speaker":["Ross D. King"],"Details":["The theory of computer science is based around Universal Turing Machines (UTMs), abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of UTMs. The nondeterministic polynomial (NP) time complexity class of problems is the most significant in computer science, and a tractable\/efficient (i.e. polynomial P) way to solve them would be of great economic and social importance. By definition nondeterministic UTMs (NUTMs) solve NP complete problems in P time. However, NUTMs have previously been believed to be physically impossible to construct. I will describe the physical design of a NUTM based on implementing a Thue string rewriting system in DNA. It uses polymerase chain reactions (PCRs), and site-directed mutagenesis, to execute an exponential number of computational paths in P time - each path represented by a different sequence of DNA. I will show evidence that this design works: computational modelling, and wet molecular biology implementation of Thue rules. The current design has many limitations, e.g. restricted error-correction. However, it opens up the prospect of engineering NUTM based computers able to outperform all standard computers on significant practical problems.\n\n\nRoss D. King is Professor of Machine Intelligence at the University of Manchester, UK. His main research interests are in the interface between computer science and biology\/chemistry. The research achievement he is most proud of is originating the idea of a \"Robot Scientist\": using laboratory robotics to physically implement a closed-loop scientific discovery system. His Robot Scientist \"Adam\" was the first machine to hypothesise and experimentally confirm scientific knowledge. His new robot \"Eve\" is searching for drugs against neglected tropical diseases. His work on this subject has been published in the top scientific journals, Science and Nature, and has received wide publicity. He is also very interested in NP problems, computational economics, and computational aesthetics."]},"fulltext":"Solving Problems Exponentially Faster: Implementing a Nondeterministic Universal Turing Machine Using DNA","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Solving_Problems_Exponentially_Faster:_Implementing_a_Nondeterministic_Universal_Turing_Machine_Using_DNA","namespace":0,"exists":"1","displaytitle":"Solving Problems Exponentially Faster: Implementing a Nondeterministic Universal Turing Machine Using DNA"},"TBA":{"printouts":{"Start":[{"timestamp":"1542286800","raw":"1\/2018\/11\/15\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1542292200","raw":"1\/2018\/11\/15\/14\/30\/0\/0"}],"title":["Standard and Non-Standard Inferences in the Description Logic FL0 Using Tree Automata"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Oliver Fern\u00e1ndez Gil"],"Details":["Although being quite inexpressive, the description logic (DL) FL0, which provides only conjunction, value restriction and the top concept as concept constructors, has an intractable subsumption problem in the presence of terminologies (TBoxes): subsumption reasoning w.r.t. acyclic FL0 TBoxes is coNP-complete, and becomes even ExpTime-complete in case general TBoxes are used. In this talk, I will describe an approach that uses automata working on infinite trees to solve both standard and non-standard inferences in FL0 w.r.t. general TBoxes. I will start by sketching an alternative proof of the ExpTime upper bound for subsumption in FL0 w.r.t. general TBoxes based on the use of looping tree automata. Afterwards, I will explain how to employ parity tree automata to tackle non-standard inference problems such as computing the least common subsumer w.r.t. general TBoxes."]},"fulltext":"TBA","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/TBA","namespace":0,"exists":"1","displaytitle":"Standard and Non-Standard Inferences in the Description Logic FL0 Using Tree Automata"},"Seminar 09.09.2021":{"printouts":{"Start":[{"timestamp":"1631192400","raw":"1\/2021\/9\/9\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1631197800","raw":"1\/2021\/9\/9\/14\/30\/0\/0"}],"title":["Standpoint Logic: Multi-Perspective Knowledge Representation"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Luc\u00eda G\u00f3mez \u00c1lvarez"],"Details":["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.\nOur 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.\nTo 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.\n\n\nThis 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:\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=145027&p=4d1d790d\n\nwithout ZIH-login:\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=145027&p=93e20500"]},"fulltext":"Seminar 09.09.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_09.09.2021","namespace":0,"exists":"1","displaytitle":"Standpoint Logic: Multi-Perspective Knowledge Representation"},"Standpoint logic: a multi-modal logic for reasoning within semantic indeterminacy":{"printouts":{"Start":[{"timestamp":"1576155600","raw":"1\/2019\/12\/12\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1576159200","raw":"1\/2019\/12\/12\/14\/0\/0\/0"}],"title":["Standpoint logic: a multi-modal logic for reasoning within semantic indeterminacy"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Luc\u00eda G\u00f3mez \u00c1lvarez"],"Details":["'''Abstract:''' Standpoint logic is a multi-modal logic intended at reasoning with different interpretations of semantically heterogeneous terms. The framework offers an alternative to \u201cfuzzy\u201d approaches to the representation of meaning and allows for the specification of \u201csemantic commitments\u201d and \u201cpenumbral connections\u201d.\n\n\nIn this talk, I will introduce the logic and provide an overview of its proof theory and semantics. I will demonstrate its expressivity in an application scenario in the forestry domain, using data schemas from the repository Global Forest Watch and concepts from the ENVO ontology. I will finally discuss the complexity of the logic and some restrictions that could make implementations viable."]},"fulltext":"Standpoint logic: a multi-modal logic for reasoning within semantic indeterminacy","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Standpoint_logic:_a_multi-modal_logic_for_reasoning_within_semantic_indeterminacy","namespace":0,"exists":"1","displaytitle":"Standpoint logic: a multi-modal logic for reasoning within semantic indeterminacy"},"Static Program Analysis in Datalog":{"printouts":{"Start":[{"timestamp":"1679569200","raw":"1\/2023\/3\/23\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1679569200","raw":"1\/2023\/3\/23\/11\/0\/0\/0"}],"title":["Static Program Analysis in Datalog"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Knut Berling"],"Details":["Abstract: Doop is a framework for Program Analysis of Java code. It utilizes the Datalog engine Souffle to run high-speed analyses on an Intermediate Code Representation. Existing analyses mainly deal with larger-scope Pointer Analysis, but not with local optimization possibilities. In this talk, I focus on the implementation of local static analyses like Constant Folding, Liveness and Available Expressions in Doop. I will give an introduction into the related frameworks, and point out benefits and limitations of Doop and Souffle regarding each analysis. Furthermore I will compare my results to existing tools for static code analysis and give an outlook whether Doop is suitable for local static analysis.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Static Program Analysis in Datalog","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Static_Program_Analysis_in_Datalog","namespace":0,"exists":"1","displaytitle":"Static Program Analysis in Datalog"},"Statistics for Knowledge Graph Modelling":{"printouts":{"Start":[{"timestamp":"1655982000","raw":"1\/2022\/6\/23\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1655985600","raw":"1\/2022\/6\/23\/12\/0\/0\/0"}],"title":["Statistics for Knowledge Graph Modelling"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Marcin Pietrasik"],"Details":["In this talk I will provide a high level overview of how statistical approaches can be used to model knowledge graphs. The talk is intended for everyone, regardless of statistics background, and will cover the basic vocabulary and concepts before moving on to a high level view of inference and how it can be used to approximate joint distributions. Finally, I will tie these ideas with my current work.\n\nThe talk will take place in a hybrid fashion, physical attendance is in our seminar room.\nLink: https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Statistics for Knowledge Graph Modelling","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Statistics_for_Knowledge_Graph_Modelling","namespace":0,"exists":"1","displaytitle":"Statistics for Knowledge Graph Modelling"},"Strong Equivalence in Non-monotonic Reasoning":{"printouts":{"Start":[{"timestamp":"1674126000","raw":"1\/2023\/1\/19\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1674129600","raw":"1\/2023\/1\/19\/12\/0\/0\/0"}],"title":["Strong Equivalence in Non-monotonic Reasoning"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Hannes Stra\u00df"],"Details":["Abstract: In classical logic, when two theories have the same models, they are\nmutually replaceable in arbitrary contexts. This is not the case in\nvarious non-monotonic formalisms, e.g. logic programs under the stable\nmodel semantics, or abstract argumentation frameworks. There, two\ntheories (programs\/frameworks) can have the same models (stable\nmodels\/extensions), but yet differ in their semantics when both are\nextended with the same third theory. To obtain mutual replaceability, a\nstronger notion is needed \u2013 this equivalence across all possible\nextensions is known as strong equivalence.\n\nWe address the question on how non-monotonicity is related to this\ndivergence of standard and strong equivalence, show examples of how\nstrong equivalence for concrete formalisms is analysed in the\nliterature, and finally preview an abstract, algebraic approach to\ncharacterising strong equivalence model-theoretically."]},"fulltext":"Strong Equivalence in Non-monotonic Reasoning","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Strong_Equivalence_in_Non-monotonic_Reasoning","namespace":0,"exists":"1","displaytitle":"Strong Equivalence in Non-monotonic Reasoning"},"Structural Subsumption Based Similarity Measures: applications with a medical ontology and in image object recognition":{"printouts":{"Start":[{"timestamp":"1465565400","raw":"1\/2016\/6\/10\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1465569000","raw":"1\/2016\/6\/10\/14\/30\/0\/0"}],"title":["Structural Subsumption Based Similarity Measures: applications with a medical ontology and in image object recognition"],"Room":[{"fulltext":"APB 1004","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_1004","namespace":0,"exists":"1","displaytitle":"Raum APB 1004"}],"Type":["Vortrag"],"Speaker":["Boontawee Suntisrivaraporn"],"Details":["Description Logics (DLs) are a family of logic-based knowledge representation formalisms, which can be used to develop ontologies in a formally well-founded way. The standard reasoning service of subsumption has proved indispensable in ontology design and maintenance. This checks, relative to the logical definitions in the ontology, whether one concept is more general\/specific than another. When no subsumption relationship is identified, however, no information about the two concepts can be given. We introduce a similarity measure based on the structural subsumption algorithm for the DL EL and then generalize this to one for the DL ALEH. The proposed similarity measures compute a numerical degree of similarity between two concept descriptions despite not being in the subsumption relation. In this talk, two application scenarios will be discussed: the first is about new findings in SNOMED CT; whereas the second is the employment of the similarity measure in an image object recognition framework."]},"fulltext":"Structural Subsumption Based Similarity Measures: applications with a medical ontology and in image object recognition","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Structural_Subsumption_Based_Similarity_Measures:_applications_with_a_medical_ontology_and_in_image_object_recognition","namespace":0,"exists":"1","displaytitle":"Structural Subsumption Based Similarity Measures: applications with a medical ontology and in image object recognition"},"Searching for Structural Similarities in Large Graphs":{"printouts":{"Start":[{"timestamp":"1492088400","raw":"1\/2017\/4\/13\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1492092000","raw":"1\/2017\/4\/13\/14\/0\/0\/0"}],"title":["Searching for Structural Similarities in Large Graphs"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Michael G\u00fcnther"],"Details":["Structural Similarity, ein Ma\u00df, welches die \u00c4hnlichkeit von Knoten anhand struktureller Eigenschaften im Graphen misst, findet Anwendung in vielen Gebieten der Informatik. Bisherige Algorithmen zur Bestimmung von Structural Similarity sind f\u00fcr gro\u00dfe Graphen nicht geeignet, oder beschr\u00e4nken sich darauf die direkte Nachbarschaft der Knoten zu observieren. Daher m\u00f6chte ich ein alternatives Scoring-Verfahren vorstellen mit dem sich Structural Similarity auch f\u00fcr gro\u00dfe Graphen in geeigneter Weise quantifizieren l\u00e4sst."]},"fulltext":"Searching for Structural Similarities in Large Graphs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Searching_for_Structural_Similarities_in_Large_Graphs","namespace":0,"exists":"1","displaytitle":"Suche struktureller \u00c4hnlichkeiten in gro\u00dfen Graphen"},"TBA4":{"printouts":{"Start":[{"timestamp":"1574946000","raw":"1\/2019\/11\/28\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1574951400","raw":"1\/2019\/11\/28\/14\/30\/0\/0"}],"title":["TE-ETH: Lower Bounds for QBFs of Bounded Treewidth"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Markus Hecher"],"Details":["The problem of deciding the validity (QSAT) of quantified Boolean formulas (QBF) is a vivid research area in both theory and practice. In the field of parameterized algorithmics, the well-studied graph measure treewidth turned out to be a successful parameter. A well-known result by Chen in parameterized complexity is that QSAT when parameterized by the treewidth of the primal graph of the input formula together with the quantifier depth of the formula is fixed-parameter tractable. More precisely, the runtime of such an algorithm is polynomial in the formula size and exponential in the treewidth, where the exponential function in the treewidth is a tower, whose height is the quantifier depth. \n\n\nA natural question is whether one can significantly improve these results and decrease the tower while assuming the Exponential Time Hypothesis (ETH). In the last years, there has been a growing interest in the quest of establishing lower bounds under ETH, showing mostly problem-specific lower bounds up to the third level of the polynomial hierarchy. Still, an important question is to settle this as general as possible and to cover the whole polynomial hierarchy. \n\nIn this work, we show lower bounds based on the ETH for arbitrary QBFs parameterized by treewidth (and quantifier depth). More formally, we establish lower bounds for QSAT and treewidth, namely, that under ETH there cannot be an algorithm that solves QSAT of quantifier depth i in runtime significantly better than i-fold exponential in the treewidth and polynomial in the input size. In doing so, we provide a versatile reduction technique to compress treewidth that encodes the essence of dynamic programming on arbitrary tree decompositions. Further, we describe a general methodology for a more fine-grained analysis of problems parameterized by treewidth that are at higher levels of the polynomial hierarchy.\n\n'''Authors:''' Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler"]},"fulltext":"TBA4","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/TBA4","namespace":0,"exists":"1","displaytitle":"TE-ETH: Lower Bounds for QBFs of Bounded Treewidth"},"Temporal Logics with Probabilistic Distributions2":{"printouts":{"Start":[{"timestamp":"1553778000","raw":"1\/2019\/3\/28\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1553783400","raw":"1\/2019\/3\/28\/14\/30\/0\/0"}],"title":["Temporal Logics with Probabilistic Distributions"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Alisa Kovtunova"],"Details":["In many applications such as monitoring of dynamical systems, the data are actually time-dependent, e.g., describing the states of a dynamical system at different points in time. Moreover, events are more likely or less likely to happen in certain time points defined by the type of an event. There exist many well-studied distributions which can characterise the natures of events among us. For example, according to a Pareto distribution, a.k.a. a power-law distribution, the longer something has gone on, the longer we expect it to continue going on. Like new companies or start-ups, either (with the high probability) they fail during the first year of existence, or, if they manage to survive for decades, their chances of collapse are extremely small.\n\n\nIn order to capture dynamic time-dependent and probabilistic patterns of knowledge, using basic notions from probability theory and statistics, we have introduced temporal logics of expectation, where we can speak about statements not only occurring eventually in the future, but giving additional information on when they are likely to happen. The resulted combination of a temporal DL-Lite fragment (with a two-dimensional semantics, where one dimension is for time and the other for the DL domain) and an additional probabilistic constructor \"distribution eventuality\" is interpreted over multiple weighted worlds, viz., temporal DL interpretations."]},"fulltext":"Temporal Logics with Probabilistic Distributions2","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Temporal_Logics_with_Probabilistic_Distributions2","namespace":0,"exists":"1","displaytitle":"Temporal Logics with Probabilistic Distributions"},"Temporal Query Answering in EL":{"printouts":{"Start":[{"timestamp":"1439218200","raw":"1\/2015\/8\/10\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1439221800","raw":"1\/2015\/8\/10\/15\/50\/0\/0"}],"title":["Temporal Query Answering in EL"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Veronika Thost"],"Details":["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."]},"fulltext":"Temporal Query Answering in EL","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Temporal_Query_Answering_in_EL","namespace":0,"exists":"1","displaytitle":"Temporal Query Answering in EL"},"Temporal constraint satisfaction problems in least fixed point logic":{"printouts":{"Start":[{"timestamp":"1541077200","raw":"1\/2018\/11\/1\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1541082600","raw":"1\/2018\/11\/1\/14\/30\/0\/0"}],"title":["Temporal constraint satisfaction problems in least fixed point logic"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Jakub Rydval"],"Details":["The constraint satisfaction problem (CSP) for a fixed structure L with finite relational signature is the computational problem of deciding whether a given finite structure of the same signature homomorphically maps to L. A temporal constraint language is a structure over the rational numbers Q whose relations are first-order definable in (Q;<). In 2009, Bodirsky and Kara presented a complete classification of the computational complexity of CSPs for temporal constraint languages. In contrast to finite domain structures, there are temporal constraint languages whose CSP cannot be solved by any Datalog program but can be expressed in least fixed point logic (LFP). An example is CSP(Q; { (x,y,z), where x>y or x>z} ), known as the and\/or scheduling problem. I will give a proof of a dichotomy for LFP expressibility of CSPs of temporal constraint languages. For a temporal constraint language L, exactly one of the following is true: either L interprets all finite structures primitively positively with parameters and CSP(L) is inexpressible in LFP, or CSP(L) is inexpressible in LFP if and only if L admits a primitive positive definition of the relation X:={ (x,y,z), where x>y=z or y>z=x or z>x=y}."]},"fulltext":"Temporal constraint satisfaction problems in least fixed point logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Temporal_constraint_satisfaction_problems_in_least_fixed_point_logic","namespace":0,"exists":"1","displaytitle":"Temporal constraint satisfaction problems in least fixed point logic"},"Temporal reasoning with DatalogMTL":{"printouts":{"Start":[{"timestamp":"1695121200","raw":"1\/2023\/9\/19\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1695124800","raw":"1\/2023\/9\/19\/12\/0\/0\/0"}],"title":["Temporal reasoning with DatalogMTL"],"Room":[{"fulltext":"APB room 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Przemys\u0142aw Wa\u0142\u0119ga"],"Details":["Abstract: During the talk, I will present DatalogMTL \u2013 an extension of Datalog with operators from metric temporal logic (MTL) \u2013 and our research on this formalism. DatalogMTL allows for performing complex temporal reasoning tasks over the rational timeline, which makes it suitable for many practical applications. However, performing the main reasoning tasks in this setting is computationally expensive, e.g., fact entailment is EXPSPACE-complete in combined and PSPACE-complete in data complexity. High complexity, together with the need of performing reasoning over infinite temporal structures, makes developing practical algorithms for DatalogMTL challenging. I will describe our approaches to address these difficulties, and discuss their experimental evaluation.\n\n\nThe talk will take place in a hybrid fashion, physically in the APB room 2026, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Temporal reasoning with DatalogMTL","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Temporal_reasoning_with_DatalogMTL","namespace":0,"exists":"1","displaytitle":"Temporal reasoning with DatalogMTL"},"The 21st International Workshop on Description Logics 2008":{"printouts":{"Start":[{"timestamp":"1210672800","raw":"1\/2008\/5\/13\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1210960800","raw":"1\/2008\/5\/16\/18\/0\/0\/0"}],"title":["The 21st International Workshop on Description Logics 2008"],"Room":[],"Type":["Konferenz"],"Speaker":[],"Details":["The DL workshop is the major annual event of the description logic\nresearch community. The workshop is thought as a gathering forum to\nmeet, discuss and exchange experiences among all those, both in the\nacademia and industry, who are interested in description logics and\ntheir applications."]},"fulltext":"The 21st International Workshop on Description Logics 2008","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_21st_International_Workshop_on_Description_Logics_2008","namespace":0,"exists":"1","displaytitle":"The 21st International Workshop on Description Logics 2008"},"The Combined Approach to Query Answering in Horn-ALCHOIQ2":{"printouts":{"Start":[{"timestamp":"1539867600","raw":"1\/2018\/10\/18\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1539869400","raw":"1\/2018\/10\/18\/13\/30\/0\/0"}],"title":["The Combined Approach to Query Answering in Horn-ALCHOIQ"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["David Carral"],"Details":["Abstract:\n\"Combined approaches have become a successful technique for solving\nconjunctive query (CQ) answering over description logics (DL) ontologies.\nNevertheless, existing approaches are restricted to tractable DL languages.\nIn this work, we extend the combined method to the more expressive DL\nHorn-ALCHOIQ---a language for which CQ answering is ExpTime-complete\u2014\nin order to develop an efficient and scalable CQ answering procedure which\nis worst-case optimal for \\halchoiq and \\elho ontologies. We implement and\nstudy the feasibility of our algorithm, and compare its performance to the DL\nreasoner Konclude.\"\n\nThis is a rehearsal talk for KR 2018."]},"fulltext":"The Combined Approach to Query Answering in Horn-ALCHOIQ2","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_Combined_Approach_to_Query_Answering_in_Horn-ALCHOIQ2","namespace":0,"exists":"1","displaytitle":"The Combined Approach to Query Answering in Horn-ALCHOIQ"},"The Combined Approach to Query Answering in Horn-ALCHOIQ":{"printouts":{"Start":[{"timestamp":"1528376400","raw":"1\/2018\/6\/7\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1528381800","raw":"1\/2018\/6\/7\/14\/30\/0\/0"}],"title":["The Combined Approach to Query Answering in Horn-ALCHOIQ"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["David Carral"],"Details":["Abstract: \"Combined approaches have become a successful technique for solving conjunctive query (CQ) answering over description logics (DL) ontologies. Nevertheless, existing approaches are restricted to tractable DL languages. In this work, we extend the combined method to the more expressive DL Horn-ALCHOIQ\u2014a language for which CQ answering is EXPTIME-complete\u2014in order to develop an efficient and scalable CQ answering procedure which is worst case optimal for Horn-ALCHOIQ and ELHO ontologies. We implement and study the feasibility of our algorithm, and compare its performance to the DL reasoner Konclude.\" \n\n\nThis paper has been submitted to KR 2018. The extended technical report can be found at https:\/\/iccl.inf.tu-dresden.de\/web\/Techreport3024\/en."]},"fulltext":"The Combined Approach to Query Answering in Horn-ALCHOIQ","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_Combined_Approach_to_Query_Answering_in_Horn-ALCHOIQ","namespace":0,"exists":"1","displaytitle":"The Combined Approach to Query Answering in Horn-ALCHOIQ"},"The Curse of Finiteness: Undecidability of Database-Inspired Reasoning Problems in Very Expressive Description Logics":{"printouts":{"Start":[{"timestamp":"1464792600","raw":"1\/2016\/6\/1\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1464796200","raw":"1\/2016\/6\/1\/15\/50\/0\/0"}],"title":["The Curse of Finiteness: Undecidability of Database-Inspired Reasoning Problems in Very Expressive Description Logics"],"Room":[{"fulltext":"APB 1096","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_1096","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Sebastian Rudolph"],"Details":["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)."]},"fulltext":"The Curse of Finiteness: Undecidability of Database-Inspired Reasoning Problems in Very Expressive Description Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_Curse_of_Finiteness:_Undecidability_of_Database-Inspired_Reasoning_Problems_in_Very_Expressive_Description_Logics","namespace":0,"exists":"1","displaytitle":"The Curse of Finiteness: Undecidability of Database-Inspired Reasoning Problems in Very Expressive Description Logics"},"The Identity Problem in Description Logic Ontologies":{"printouts":{"Start":[{"timestamp":"1499950800","raw":"1\/2017\/7\/13\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1499954400","raw":"1\/2017\/7\/13\/14\/0\/0\/0"}],"title":["The Identity Problem in Description Logic Ontologies"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Adrian Nuradiansyah"],"Details":["The work in this paper is motivated by a privacy scenario in which the identity of certain persons (represented as anonymous individuals) should be hidden. We assume that factual information about known individuals (i.e., individuals whose identity is known) and anonymous individuals is stored in an ABox and general background information is expressed in a TBox, where both the TBox and the ABox are publicly accessible. The identity problem then asks whether one can deduce from the TBox and the ABox that a given anonymous individual is equal to a known one. Since this would reveal the identity of the anonymous individual, such a situation needs to be avoided. We first observe that not all Description Logics (DLs) are able to derive any such equalities between individuals, and thus the identity problem is trivial in these DLs. We then consider DLs with nominals, number restrictions, or function dependencies, in which the identity problem is non-trivial. We show that in these DLs the identity problem has the same complexity as the instance problem. Finally, we consider an extended scenario in which users with different r\u00f4les can access different parts of the TBox and ABox, and we want to check whether, by a sequence of r\u00f4le changes and queries asked in each r\u00f4le, one can deduce the identity of an anonymous individual."]},"fulltext":"The Identity Problem in Description Logic Ontologies","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_Identity_Problem_in_Description_Logic_Ontologies","namespace":0,"exists":"1","displaytitle":"The Identity Problem in Description Logic Ontologies"},"The Method of Refinement: Deriving Proof-Calculi from Semantics for Multi-Modal Logics":{"printouts":{"Start":[{"timestamp":"1591880400","raw":"1\/2020\/6\/11\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1591885800","raw":"1\/2020\/6\/11\/14\/30\/0\/0"}],"title":["The Method of Refinement: Deriving Proof-Calculi from Semantics for Multi-Modal Logics"],"Room":[{"fulltext":"Digital","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Digital","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Tim Lyon"],"Details":["In this talk, we look at how to derive nested calculi from labelled calculi for multi-modal logics, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. Since labelled calculi are constructed by transforming the semantics of a logic into a proof system, the method of refinement shows how one can derive simplified calculi from the semantics of a logic. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. As a consequence of the extraction process, each nested calculus inherits fundamental proof-theoretic properties from its associated labelled calculus and is suitable for applications such as decidability and interpolation.\n\nTim is currently working at the informatics faculty of the TU Wien in Vienna as a PreDoc Researcher in the research unit \"Theory and Logic\".\n\nThis talk will be held digitally. If there is any interest in attending, please write an e-mail to thomas.feller@tu-dresden.de."]},"fulltext":"The Method of Refinement: Deriving Proof-Calculi from Semantics for Multi-Modal Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_Method_of_Refinement:_Deriving_Proof-Calculi_from_Semantics_for_Multi-Modal_Logics","namespace":0,"exists":"1","displaytitle":"The Method of Refinement: Deriving Proof-Calculi from Semantics for Multi-Modal Logics"},"The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion":{"printouts":{"Start":[{"timestamp":"1659006000","raw":"1\/2022\/7\/28\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1659009600","raw":"1\/2022\/7\/28\/12\/0\/0\/0"}],"title":["The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Jonas Karge"],"Details":["In multi-agent belief fusion, there is increasing interest in results and methods from social choice theory. As a theoretical cornerstone, the Condorcet Jury Theorem (CJT) states that given a number of equally competent, independent agents where each is more likely to guess the true out of two alternatives, the chances of determining this objective truth by majority voting increase with the number of participating agents, approaching certainty. Past generalizations of the CJT have shown that some of its underlying assumptions can be weakened. Motivated by requirements from practical belief fusion scenarios, we provide a significant further generalization that subsumes several of the previous ones. Our considered setting simultaneously allows for heterogeneous competence levels across the agents (even tolerating entirely incompetent or even malicious voters), and voting for any number of alternatives from a finite set. We derive practical lower bounds for the numbers of agents needed to give probabilistic guarantees for determining the true state through approval voting. We also demonstrate that the non-asymptotic part of the CJT fails in our setting for arbitrarily high numbers of voters.\n\nThe talk will take place in a hybrid fashion, physically in the seminar room, and online through the link:\n\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_More_the_Worst-Case-Merrier:_A_Generalized_Condorcet_Jury_Theorem_for_Belief_Fusion","namespace":0,"exists":"1","displaytitle":"The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion"},"The Power of the Terminating Chase":{"printouts":{"Start":[{"timestamp":"1554987600","raw":"1\/2019\/4\/11\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1554993000","raw":"1\/2019\/4\/11\/14\/30\/0\/0"}],"title":["The Power of the Terminating Chase"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Markus Kr\u00f6tzsch"],"Details":["'''Abstract''':\nThe chase has become a staple of modern database theory with applications in data integration, query optimisation, data exchange, ontology-based query answering, and many other areas. Most application scenarios and implementations require the chase to terminate and produce a finite universal model, and a large arsenal of sufficient termination criteria is available to guarantee this (generally undecidable) condition. In this invited tutorial, we therefore ask about the expressive power of logical theories for which the chase terminates. Specifically, which database properties can be recognised by such theories, i.e., which Boolean queries can they realise? For the skolem (semi-oblivious) chase, and almost any known termination criterion, this expressivity is just that of plain Datalog. Surprisingly, this limitation of most prior research does not apply to the chase in general. Indeed, we show that standard\u2013chase terminating theories can realise queries with data complexities ranging from PTime to non-elementary that are out of reach for the terminating skolem chase. A \u201cDatalog-first\u201d standard chase that prioritises applications of rules without existential quantifiers makes modelling simpler \u2013 and we conjecture: computationally more efficient. This is one of the many open questions raised by our insights, and we conclude with an outlook on the research opportunities in this area.\n\nThis work has been published and presented at ICDT 2019, Lisbon, Portugal."]},"fulltext":"The Power of the Terminating Chase","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_Power_of_the_Terminating_Chase","namespace":0,"exists":"1","displaytitle":"The Power of the Terminating Chase"},"The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard":{"printouts":{"Start":[{"timestamp":"1649329200","raw":"1\/2022\/4\/7\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1649332800","raw":"1\/2022\/4\/7\/12\/0\/0\/0"}],"title":["The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["In logic-based knowledge representation, query answering has essentially replaced mere satisfiability checking as the infer encing problem of primary interest. For knowledge bases in the basic description logic ALC, the computational complexity of conjunctive query (CQ) answering is well known to be EXPTIME-complete and hence not harder than satisfiability. This does not change when the logic is extended by certain features (such as counting or role hierarchies), whereas adding others (inverses, nominals or transitivity together with role-hierarchies) turns CQ answering exponentially harder. We contribute to this line of results by showing the surprising fact that even extending ALC by just the Self operator \u2013 which proved innocuous in many other contexts \u2013 increases the complexity of CQ entailment to 2EXPTIME. As common for this type of problem, our proof establishes a reduction from alternating Turing machines running in exponential space, but several novel ideas and encoding tricks are required to make the approach work in that specific, restricted setting."]},"fulltext":"The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_Price_of_Selfishness:_Conjunctive_Query_Entailment_for_ALCSelf_is_2EXPTIME-hard","namespace":0,"exists":"1","displaytitle":"The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard"},"The Relevance of Formal Logics for Cognitive Logics, and Vice Versa":{"printouts":{"Start":[{"timestamp":"1671015600","raw":"1\/2022\/12\/14\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1671019200","raw":"1\/2022\/12\/14\/12\/0\/0\/0"}],"title":["The Relevance of Formal Logics for Cognitive Logics, and Vice Versa"],"Room":[{"fulltext":"APB room 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Gabriele Kern-Isberner"],"Details":["Classical logics like propositional or predicate logic have been considered as the gold standard for rational human reasoning, and hence as a solid, desirable norm on which all human knowledge and decision making should be based, ideally. For instance, Boolean logic was set up as kind of an arithmetic framework that should help make rational reasoning computable in an objective way, similar to the arithmetics of numbers. Computer scientists adopted this view to (literally) implement objective knowledge and rational deduction, in particular for AI applications. Psychologists have used classical logics as norms to assess the rationality of human commonsense reasoning. However, both disciplines could not ignore the severe limitations of classical logics, e.g., computational complexity and undecidedness, failures of logic-based AI systems in practice, and lots of psychological paradoxes. Many of these problems are caused by the inability of classical logics to deal with uncertainty in an adequate way. Both disciplines have used probabilities as a way out of this dilemma, hoping that numbers and the Kolmogoroff axioms can do the job (somehow). However, psychologists have been observing also lots of paradoxes here (maybe even more).\n\nSo then, are humans hopelessly irrational? Is human reasoning incompatible with formal, axiomatic logics? In the end, should computer-based knowledge and information processing be considered as superior in terms of objectivity and rationality?\n\nCognitive logics aim at overcoming the limitations of classical logics and resolving the observed paradoxes by proposing logic-based approaches that can model human reasoning consistently and coherently in benchmark examples. The basic idea is to reverse the normative way of assessing human reasoning in terms of logics resp. probabilities, and to use typical human reasoning patterns as norms for assessing the cognitive quality of logics. Cognitive logics explore the broad field of logic-based approaches between the extreme points marked by classical logics and probability theory with the goal to find more suitable logics for AI applications, on the one hand, and to gain more insights into the rational structures of human reasoning, on the other."]},"fulltext":"The Relevance of Formal Logics for Cognitive Logics, and Vice Versa","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_Relevance_of_Formal_Logics_for_Cognitive_Logics,_and_Vice_Versa","namespace":0,"exists":"1","displaytitle":"The Relevance of Formal Logics for Cognitive Logics, and Vice Versa"},"The RustBelt and its Separation Logic":{"printouts":{"Start":[{"timestamp":"1732791600","raw":"1\/2024\/11\/28\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1732795200","raw":"1\/2024\/11\/28\/12\/0\/0\/0"}],"title":["The RustBelt and its Separation Logic"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Matthias Mei\u00dfner"],"Details":["Rust is a systems-programming language whose expressive type system centers around the concept of ownership enabling both stronger, statically verified safety guarantees as well as lower level control compared to more mainstream \"safe\" languages. The RustBelt project provided some formal verification for those claims using a seperation logic for modelling rusts typing rules. In this seminar we aim at giving an introduction into the features of Rust's type system as well as into the stack of logical tools used to verify the properties it promises."]},"fulltext":"The RustBelt and its Separation Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_RustBelt_and_its_Separation_Logic","namespace":0,"exists":"1","displaytitle":"The RustBelt and its Separation Logic"},"The World Avatar project \u2013 a universal digital twin":{"printouts":{"Start":[{"timestamp":"1655287200","raw":"1\/2022\/6\/15\/10\/0\/0\/0"}],"Ende":[{"timestamp":"1655290800","raw":"1\/2022\/6\/15\/11\/0\/0\/0"}],"title":["The World Avatar project \u2013 a universal digital twin"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Markus KRAFT"],"Details":["\u201cThe World Avatar\u201d (TWA) project aims to create a digital \u2018avatar\u2019 of the real world. The digital world is represented using a dynamic knowledge graph that contains concepts and data that describe the world, and an ecosystem of autonomous computational agents that simulate the behaviour of the world and that update the concepts and data so that the digital world remains current in time. In this manner, it is proposed that it is possible to create digital twins that can describe the behaviour of any complex system, and by doing so provide the ability to make data-driven decisions about how to optimise the systems. Examples will be presented from TWA including chemical knowledge creation, laboratory automation, building management, smart city operation, climate resilience and national energy scenarios. \n\nThe talk is Hybird!, with a 20 person maximum capacity in the seminar room APB 3027\n\nOnline link: https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"The World Avatar project \u2013 a universal digital twin","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/The_World_Avatar_project_%E2%80%93_a_universal_digital_twin","namespace":0,"exists":"1","displaytitle":"The World Avatar project \u2013 a universal digital twin"},"Third Workshop on Human Reasoning and Computational Logic":{"printouts":{"Start":[{"timestamp":"1554368400","raw":"1\/2019\/4\/4\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1554483600","raw":"1\/2019\/4\/5\/17\/0\/0\/0"}],"title":["Third Workshop on Human Reasoning and Computational Logic"],"Room":[{"fulltext":"APB 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Konferenz"],"Speaker":[],"Details":["From the 4th to the 5th of April 2019, we organize the third workshop on Human Reasoning and Computational Logic at TU Dresden, Germany. The goal of this workshop is to provide a platform for the scientific exchange with respect to Human Reasoning between the areas of Cognitive Science and Computational Logic."]},"fulltext":"Third Workshop on Human Reasoning and Computational Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Third_Workshop_on_Human_Reasoning_and_Computational_Logic","namespace":0,"exists":"1","displaytitle":"Third Workshop on Human Reasoning and Computational Logic"},"To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence":{"printouts":{"Start":[{"timestamp":"1688036400","raw":"1\/2023\/6\/29\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1686312000","raw":"1\/2023\/6\/9\/12\/0\/0\/0"}],"title":["To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Jonas Karge"],"Details":["Abstract: Aggregating pieces of information or beliefs held by (abstract) agents is central to a variety of belief merging applications. When the merging process aims at retrieving an underlying ground truth, the Condorcet Jury Theorem (CJT) allows identifying voting rules that almost surely track the true piece of information for large groups of agents, given that specific conditions are met. As essential assumptions, the CJT relies on all agents being equally competent as well as independent from one another. In the search for a generalization of the CJT applicable to real-world scenarios, both aforementioned assumptions were weakened separately. In this work, we provide a generalization of the CJT that allows, at the same time, for heterogeneous competence levels across agents as well as a degree of dependence modeled through an opinion leader exerting influence on the electorate. Additionally, we derive a concrete bound on the number of agents necessary to successfully track the underlying ground truth, and examine the bound's tightness by means of statistical simulations.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/To_Lead_or_to_be_Led:_A_Generalized_Condorcet_Jury_Theorem_under_Dependence","namespace":0,"exists":"1","displaytitle":"To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence"},"Topological Clones and the Computational Complexity of Constraint Satisfaction Problems":{"printouts":{"Start":[{"timestamp":"1431536400","raw":"1\/2015\/5\/13\/17\/0\/0\/0"}],"Ende":[{"timestamp":"1431541800","raw":"1\/2015\/5\/13\/18\/30\/0\/0"}],"title":["Topological Clones and the Computational Complexity of Constraint Satisfaction Problems"],"Room":[{"fulltext":"WIL B 321","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/WIL_B_321","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Manuel Bodirsky"],"Details":["This is the inaugural lecture of Prof. Manuel Bodirsky.\n\n\nConstraint Satisfaction Problems (CSPs) are fundamental computational problems that appear in many areas of theoretical computer science. We are given a finite set of variables and constraints, and would like to know whether there exists an assignment of values to the variables that satisfies all the constraints. For example Boolean satisfiability problems, graph k-colorability, and the feasibility problem for linear programs can be cast as CSPs. It is a major research theme to classify the CSPs that can be solved in polynomial time, and those that are computationally difficult (NP-hard).\n\nWhen the variables can only take values from some fixed finite domain, it has been conjectured by Feder and Vardi that, depending on the allowed constraints in the input, the CSP is either in P or NP-hard. The most successful and fruitful approach to this conjecture is based on concepts and results from universal algebra.\n\nI will give an introduction to the universal-algebraic approach for the more general situation when the underlying domain is infinite. It turns out that for a large class of CSPs, the computational complexity only depends on the topological polymorphism clone of the allowed constraints. The study of these topological clones (which can be viewed as a multi-variate generalisation of topological automorphism groups) leads to many questions of independent interest in universal algebra and model theory, but also in Ramsey theory and topological dynamics."]},"fulltext":"Topological Clones and the Computational Complexity of Constraint Satisfaction Problems","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Topological_Clones_and_the_Computational_Complexity_of_Constraint_Satisfaction_Problems","namespace":0,"exists":"1","displaytitle":"Topological Clones and the Computational Complexity of Constraint Satisfaction Problems"},"Towards Breaking the Language and Modality Barrier: Learning Cross-lingual Cross-modal Semantic Representations":{"printouts":{"Start":[{"timestamp":"1484823600","raw":"1\/2017\/1\/19\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1484825400","raw":"1\/2017\/1\/19\/11\/30\/0\/0"}],"title":["Towards Breaking the Language and Modality Barrier: Learning Cross-lingual Cross-modal Semantic Representations"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Achim Rettinger"],"Details":["Information retrieval and machine learning approaches are running in the background of most of the applications we use in our daily digital life. The assistance they are providing is manifold, but relies on a set of core content processing tasks requiring compatible content representations. However, this is rarely the case in real-world scenarios.\nThis talk is concerned with shared representation formalisms for content encoded in heterogeneous modalities. The heterogeneity may result from intra-modal varieties, like text in different languages for the modality of natural language, or by the different modalities themselves, like when relating text to images. \nI will present three ways to obtain a joint representation of heterogeneously represented content. The first one is based on explicit semantics as encoded in knowledge graphs, the second one extends this approach by adding implicit semantics extracted from large data sets and the final one relies on joint learning without utilizing explicit semantics.\nThe presented approaches contribute to the long standing challenges of braking the language and modality barriers which enables the joint semantic processing of content in originally incompatible representation formalisms. This constitutes a fundamental building block for a more human-notion of semantic data analytics."]},"fulltext":"Towards Breaking the Language and Modality Barrier: Learning Cross-lingual Cross-modal Semantic Representations","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Towards_Breaking_the_Language_and_Modality_Barrier:_Learning_Cross-lingual_Cross-modal_Semantic_Representations","namespace":0,"exists":"1","displaytitle":"Towards Breaking the Language and Modality Barrier: Learning Cross-lingual Cross-modal Semantic Representations"},"Towards Conjunctive Query Answering in Defeasible EL bot":{"printouts":{"Start":[{"timestamp":"1532610000","raw":"1\/2018\/7\/26\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1532615400","raw":"1\/2018\/7\/26\/14\/30\/0\/0"}],"title":["Towards Conjunctive Query Answering in Defeasible EL_bot"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Maximilian Pensel"],"Details":["In Defeasible Description Logics (DDLs), typical or default information about concepts can be stated in the form of defeasible concept inclusions (DCIs) in a DBox. As opposed to general concept inclusions (GCIs), which are strict in the sense that e.g. \"every element of C must be an element of D\", defeasible statements are more vague and allow to state that \"elements of C are usually elements of D\", where the term usually insinuates that DCIs are satisfied individually for elements not satisfying properties contradicting the DCI. In 2017, we have discovered and resolved a severe shortcoming of earlier approaches to define semantics for DDLs rooted in the preferential approach by KLM. We introduce a new kind of canonical model in order to determine consequences in defeasible EL_bot. These so-called typicality models extend classical canonical models by additional concept representatives, which are individually forced to satisfy certain DCIs. Typicality models allow us to reconstruct the consequences obtained by previous approaches and extend them appropriately to alleviate the discovered insufficiency. More recently, we have extended this formalism beyond the reasoning service subsumption, to also be capable of deciding defeasible instance checks.\n\nThe natural next step is to strengthen the deductive power of our formalism to enable conjunctive query answering (CQA) in defeasible EL_bot, a reasoning service that, to the best of our knowledge, has not been studied for DDLs. We conjecture that the query rewriting approach by Lutz et al. (2009), allowing the use of classical canonical models to answer conjunctive queries, can be adopted to answer defeasible conjunctive queries by using typicality models, due to their canonical nature.\n\nThis endeavour is still in its very early stages and aspects of this talk concerning CQA are preliminary ideas and working theories. Input and feedback from the audience is greatly appreciated."]},"fulltext":"Towards Conjunctive Query Answering in Defeasible EL bot","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Towards_Conjunctive_Query_Answering_in_Defeasible_EL_bot","namespace":0,"exists":"1","displaytitle":"Towards Conjunctive Query Answering in Defeasible EL_bot"},"Towards Understanding Brain Function by Uncovering the Conceptual Structure of C.elegans Sensorium":{"printouts":{"Start":[{"timestamp":"1733396400","raw":"1\/2024\/12\/5\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1733400000","raw":"1\/2024\/12\/5\/12\/0\/0\/0"}],"title":["Towards Understanding Brain Function by Uncovering the Conceptual Structure of C.elegans Sensorium"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Emma Reyner-Fuentes"],"Details":["The framework of Embodied and Embedded cognition suggests that animals engage in a continuous sensory-motor feedback loop with their environment, mediated by their nervous systems. A significant challenge in the study of nervous systems lies in the lack of a comprehensive model for the sensorium - the mechanism by which organisms perceive their surroundings.\nIn this presentation, I will introduce two information theory-based approaches that enable exploration of the sensorium of Caenorhabditis elegans, examining its connectivity, responsiveness, and neuronal characterization.\nThe first approach demonstrates how K-Formal Concept Analysis (K-FCA), an information-theoretical tool, can be applied for Exploratory Data Analysis (EDA) of this sensorium.\nThrough K-FCA, we can identify specific neurons\u2019 responses to various odorants in an immediate and visual manner. Additionally, this method allows us to observe clusters of neurons based on responsiveness to odorants, as well as clusters of odorants according to their perceptual representations within the nematode\u2019s sensorium.\nThe second approach focuses on characterizing neurons based on their neural traces, using Convolutional Neural Networks (CNNs), Explainability techniques, and FCA. Although this approach remains a work in progress, I will present preliminary findings on how neurons can be characterized through their neural traces, revealing distinct neuronal profiles that enable their identification.\nOverall, this talk will showcase tools from Information Theory, Deep Learning, and Artificial Intelligence in general, to support the exploration, analysis, and understanding of the structural organization of C. elegans\u2019 sensorium. This will, therefore, allow us to begin to deeply understand brain functioning."]},"fulltext":"Towards Understanding Brain Function by Uncovering the Conceptual Structure of C.elegans Sensorium","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Towards_Understanding_Brain_Function_by_Uncovering_the_Conceptual_Structure_of_C.elegans_Sensorium","namespace":0,"exists":"1","displaytitle":"Towards Understanding Brain Function by Uncovering the Conceptual Structure of C.elegans Sensorium"},"Tracking False Information Online":{"printouts":{"Start":[{"timestamp":"1582820100","raw":"1\/2020\/2\/27\/16\/15\/0\/0"}],"Ende":[{"timestamp":"1582825500","raw":"1\/2020\/2\/27\/17\/45\/0\/0"}],"title":["Tracking False Information Online"],"Room":[{"fulltext":"APB 1004","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_1004","namespace":0,"exists":"1","displaytitle":"Raum APB 1004"}],"Type":["Vortrag"],"Speaker":["Isabelle Augenstein"],"Details":["Digital media enables fast sharing of information and discussions among users. While this comes with many benefits to today\u2019s society, such as broadening information access, the manner in which information is disseminated also has obvious downsides. Since fast access to information is expected by many users and news outlets are often under financial pressure, speedy access often comes at the expense of accuracy, which leads to misinformation. Moreover, digital media can be misused by campaigns to intentionally spread false information, i.e. disinformation, about events, individuals or governments. In this talk, I will present on different ways false information is spread online, including misinformation and disinformation. I will then report findings from our recent and ongoing work on automatic fact checking, stance detection and framing attitudes."]},"fulltext":"Tracking False Information Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Tracking_False_Information_Online","namespace":0,"exists":"1","displaytitle":"Tracking False Information Online"},"Tractable Query Answering for Expressive Ontologies and Existential Rules":{"printouts":{"Start":[{"timestamp":"1507800000","raw":"1\/2017\/10\/12\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1507805400","raw":"1\/2017\/10\/12\/10\/50\/0\/0"}],"title":["Tractable Query Answering for Expressive Ontologies and Existential Rules"],"Room":[{"fulltext":"APB 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["David Carral"],"Details":["The disjunctive skolem chase is a sound and complete (albeit non-terminating) algorithm that can be used to solve conjunctive query answering over DL ontologies and programs with disjunctive existential rules.\nEven though acyclicity notions can be used to ensure chase termination for a large subset of real-world knowledge bases, the complexity of reasoning over acyclic theories still remains high.\nHence, we study several restrictions which not only guarantee chase termination but also ensure polynomiality.\nWe include an evaluation that shows that almost all acyclic DL ontologies do indeed satisfy these general restrictions."]},"fulltext":"Tractable Query Answering for Expressive Ontologies and Existential Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Tractable_Query_Answering_for_Expressive_Ontologies_and_Existential_Rules","namespace":0,"exists":"1","displaytitle":"Tractable Query Answering for Expressive Ontologies and Existential Rules"},"Tree Automata with Global and Non-Global Counting":{"printouts":{"Start":[{"timestamp":"1734001200","raw":"1\/2024\/12\/12\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1734004800","raw":"1\/2024\/12\/12\/12\/0\/0\/0"}],"title":["Tree Automata with Global and Non-Global Counting"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Luisa Herrmann"],"Details":["Similar to the case of finite string automata, there is a long tradition of adding counting mechanisms to finite tree automata in order to increase their expressiveness, resulting in two interesting models (among others): Parikh tree automata (PTA) increment a number of counters when computing a tree and eventually test their membership in a semilinear set. On the other hand, one-counter tree automata (OCTA) use only one counter that can be incremented, decremented and tested for zero during a computation. The calculation principles for the counting mechanisms work orthogonally in both approaches \u2013 while OCTA split their computations at each node and execute them pathwise, PTA allow a global view: their counters are incremented over the whole input tree. When comparing the expressive power of the two models, one will find differences that stem not only from the specific storage types used, but also from the global or non-global view of the input.\n\nThis talk will report on two recent works, where we exchanged the computation mode of both tree automata models:\n\nWe introduce global one-counter tree automata (GOCTA) deviating from OCTA by working on one counter which is passed through the tree in lexicographical order, rather than duplicating the counter at every branching position. When comparing the capabilities of GOCTA and OCTA, we obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the non-emptiness problem of GOCTA is undecidable while, in stark contrast, their membership problem is in P.\n\nIn a similar spirit, we define a non-global version of Parikh tree automata. Here, we copy and distribute the current configuration at each node to all its children, incrementing the counters pathwise, and check the arithmetic constraint at each leaf. Again we obtain that, in contrast to the original definition of PTA, non-emptiness becomes undecidable if we allow the automaton to use at least three counters. However, we can prove decidability of non-emptiness for a (still powerful) restriction of the model."]},"fulltext":"Tree Automata with Global and Non-Global Counting","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Tree_Automata_with_Global_and_Non-Global_Counting","namespace":0,"exists":"1","displaytitle":"Tree Automata with Global and Non-Global Counting"},"Tsetlin Machine, A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic":{"printouts":{"Start":[{"timestamp":"1732186800","raw":"1\/2024\/11\/21\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1732190400","raw":"1\/2024\/11\/21\/12\/0\/0\/0"}],"title":["Tsetlin Machine, A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Patrick Karlsen"],"Details":["This is a talk about a paper [1] with the following abstract:\n\nAlthough simple individually, artificial neurons provide state-of-the-art performance when interconnected in deep networks. Arguably, the Tsetlin Automaton is an even simpler and more versatile learning mechanism, capable of solving the multi-armed bandit problem. Merely by means of a single integer as memory, it learns the optimal action in stochastic environments through increment and decrement operations. In this paper, we introduce the Tsetlin Machine, which solves complex pattern recognition problems with propositional formulas, composed by a collective of Tsetlin Automata. To eliminate the longstanding problem of vanishing signal-to-noise ratio, the Tsetlin Machine orchestrates the automata using a novel game. Further, both inputs, patterns, and outputs are expressed as bits, while recognition and learning rely on bit manipulation, simplifying computation. Our theoretical analysis establishes that the Nash equilibria of the game align with the propositional formulas that provide optimal pattern recognition accuracy. This translates to learning without local optima, only global ones. In five benchmarks, the Tsetlin Machine provides competitive accuracy compared with SVMs, Decision Trees, Random Forests, Naive Bayes Classifier, Logistic Regression, and Neural Networks. We further demonstrate how the propositional formulas facilitate interpretation. In conclusion, we believe the combination of high accuracy, interpretability, and computational simplicity makes the Tsetlin Machine a promising tool for a wide range of domains.\n\n[1] https:\/\/arxiv.org\/abs\/1804.01508"]},"fulltext":"Tsetlin Machine, A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Tsetlin_Machine,_A_Game_Theoretic_Bandit_Driven_Approach_to_Optimal_Pattern_Recognition_with_Propositional_Logic","namespace":0,"exists":"1","displaytitle":"Tsetlin Machine, A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic"},"Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy":{"printouts":{"Start":[{"timestamp":"1677754800","raw":"1\/2023\/3\/2\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1677758400","raw":"1\/2023\/3\/2\/12\/0\/0\/0"}],"title":["Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy"],"Room":[{"fulltext":"APB room 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Elisa B\u00f6hl"],"Details":["Abstract: Answer set programming (ASP) solvers have advanced in recent years, with a variety of different specialisation and overall development. Thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process, the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. The core idea is to collect diverse answer sets one after another by iteratively solving and updating the program. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. The evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.\n\nThe talk will take place in a hybrid fashion, physically in the APB room 3027, and online through the link:\nhttps:\/\/bbb.tu-dresden.de\/b\/pio-zwt-smp-aus"]},"fulltext":"Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Tunas_-_Fishing_for_Diverse_Answer_Sets:_A_Multi-Shot_Trade_up_Strategy","namespace":0,"exists":"1","displaytitle":"Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy"},"Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade up Strateg":{"printouts":{"Start":[{"timestamp":"1662031800","raw":"1\/2022\/9\/1\/11\/30\/0\/0"}],"Ende":[{"timestamp":"1662033600","raw":"1\/2022\/9\/1\/12\/0\/0\/0"}],"title":["Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade up Strateg"],"Room":[{"fulltext":"APB room 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_room_3027","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Elisa B\u00f6hl"],"Details":["Answer set programming (ASP) solvers have advanced in\nrecent years, with a variety of different specialisation and overall devel-\nopment. Thus, even more complex and detailed programs can be solved.\nA side effect of this development are growing solution spaces and the\nproblem of how to find those answer sets one is interested in. One gen-\neral approach is to give an overview in form of a small number of highly\ndiverse answer sets. By choosing a favourite and repeating the process,\nthe user is able to leap through the solution space. But finding highly\ndiverse answer sets is computationally expensive. In this paper we intro-\nduce a new approach called Tunas for Trade Up Navigation for Answer\nSets to find diverse answer sets by reworking existing solution collec-\ntions. The core idea is to collect diverse answer sets one after another by\niteratively solving and updating the program. Once no more answer sets\ncan be added to the collection, the program is allowed to trade answer\nsets from the collection for different answer sets, as long as the collection\ngrows and stays diverse. Elaboration of the approach is possible in three\nvariations, which we implemented and compared to established methods\nin an empirical evaluation. The evaluation shows that the Tunas app-\nroach is competitive with existing methods, and that efficiency of the\napproach is highly connected to the underlying logic program.\n\nThe talk will take place in a hybrid fashion, physically in the seminar room, and online through the link:\n\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade up Strateg","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Tunas_-_Fishing_for_Diverse_Answer_Sets:_A_Multi-shot_Trade_up_Strateg","namespace":0,"exists":"1","displaytitle":"Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade up Strateg"},"Tuple-Generating Dependencies Capture Complex Values":{"printouts":{"Start":[{"timestamp":"1642676400","raw":"1\/2022\/1\/20\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1642680000","raw":"1\/2022\/1\/20\/12\/0\/0\/0"}],"title":["Tuple-Generating Dependencies Capture Complex Values"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Maximilian Marx"],"Details":["We formalise a variant of Datalog that allows complex values constructed by nesting elements of\nthe input database in sets and tuples. We study its complexity and give a translation into sets\nof tuple-generating dependencies (TGDs) for which the standard chase terminates on any input\ndatabase. We identify a fragment for which reasoning is tractable. As membership is undecidable\nfor this fragment, we develop decidable sufficient conditions. \n\nThe talk is about an accepted paper with Markus in ICDT 2022.\n\nLink to the online talk:\nhttps:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n"]},"fulltext":"Tuple-Generating Dependencies Capture Complex Values","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Tuple-Generating_Dependencies_Capture_Complex_Values","namespace":0,"exists":"1","displaytitle":"Tuple-Generating Dependencies Capture Complex Values"},"Two-Dimensional Description Logics of Context":{"printouts":{"Start":[{"timestamp":"1416993600","raw":"1\/2014\/11\/26\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1416997200","raw":"1\/2014\/11\/26\/10\/20\/0\/0"}],"title":["Two-Dimensional Description Logics of Context"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Szymon Klarman"],"Details":["In this talk I will introduce an extension of Description Logics (DLs) for representing and reasoning about contextualized knowledge. Our formalism is inspired by McCarthy's theory of formalizing contexts and based on two-dimensional semantics, with one dimension representing a usual object domain and the other a domain of contexts. Additionally, it is equipped with a second DL language for describing the context domain. As a result, we obtain a family of two-sorted, two-dimensional combinations of pairs of DLs."]},"fulltext":"Two-Dimensional Description Logics of Context","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Two-Dimensional_Description_Logics_of_Context","namespace":0,"exists":"1","displaytitle":"Two-Dimensional Description Logics of Context"},"Uniform Interpolation for Expressive Description Logics":{"printouts":{"Start":[{"timestamp":"1461677400","raw":"1\/2016\/4\/26\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1461681000","raw":"1\/2016\/4\/26\/14\/30\/0\/0"}],"title":["Uniform Interpolation for Expressive Description Logics"],"Room":[{"fulltext":"APB E005","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_E005","namespace":0,"exists":"1","displaytitle":"Raum APB E005"}],"Type":["Vortrag"],"Speaker":["Patrick Koopmann"],"Details":["Description Logics are a family of logics that are used to model ontologies, terminological knowledge bases that are used to represent domain knowledge in a range of areas such as the semantic web, medicine, biology and many more. Uniform interpolation restricts the vocabulary used in an ontology to a specified set of terms, such that information expressible in this vocabulary is preserved. It has potentially many applications, such as in ontology reuse or ontology analysis. The theoretical properties of uniform interpolation in description logics are not encouraging for practical applications: finite representations do not always exist in classical description logics, and the size can be triple exponential with respect to the size of the input already for simpler description logics. We present an approach based on resolution that allows to compute uniform interpolants in various expressive description logics practically in a lot of cases. An evaluation on realistic ontologies shows a high success rate despite the known worst-case complexities."]},"fulltext":"Uniform Interpolation for Expressive Description Logics","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Uniform_Interpolation_for_Expressive_Description_Logics","namespace":0,"exists":"1","displaytitle":"Uniform Interpolation for Expressive Description Logics"},"Universality Results for Spiking Neural P Systems with Cooperating Rules":{"printouts":{"Start":[{"timestamp":"1462373400","raw":"1\/2016\/5\/4\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1462377000","raw":"1\/2016\/5\/4\/15\/50\/0\/0"}],"title":["Universality Results for Spiking Neural P Systems with Cooperating Rules"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Maximilian Marx"],"Details":["Metta, Raghuraman, and Krithivasan introduce the concept of Spiking Neural systems with cooperating rules, bringing the ideas behind cooperating distributed grammar systems (CD grammar systems) to the world of Spiking Neural P systems (SN P systems), a model for computation inspired by the functioning of neurons in a nervous system. An essential feature in these systems is the cooperation of multiple components according to some fixed cooperation protocol. Building on the proof by Metta, Raghuraman, and Krithivasan for the terminating protocol, we show that universality can be retained for the other cooperation protocols by slightly lifting some of the model\u2019s restrictions, such as using the maximally parallel mode of derivation instead of the strongly sequential mode, or allowing for local synchronization in the asynchronous case. We present a concrete example demonstrating the power of the model by generating a non-semi-linear (and hence non-context-free) set of numbers, and contrast it with a CD grammar system generating the same set."]},"fulltext":"Universality Results for Spiking Neural P Systems with Cooperating Rules","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Universality_Results_for_Spiking_Neural_P_Systems_with_Cooperating_Rules","namespace":0,"exists":"1","displaytitle":"Universality Results for Spiking Neural P Systems with Cooperating Rules"},"Using Datalog to Ground ASP Programs":{"printouts":{"Start":[{"timestamp":"1617282000","raw":"1\/2021\/4\/1\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1617287400","raw":"1\/2021\/4\/1\/14\/30\/0\/0"}],"title":["Using Datalog to Ground ASP Programs"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Philipp Hanisch"],"Details":["Answer Set Programming (ASP) is a powerful tool in Knowledge Representation and Reasoning. The typical approach to find the answer sets of an ASP program is a ground-and-solve approach, where a grounder transforms an input program with variables into a ground program without variables and a solver computes the answer sets of the ground program. To be feasible, this requires an intelligent grounding phase to keep the grounding relatively small.\nThe relational query language Datalog is related to ASP and has some similarities to it. Even though they arise from the same origin, there might be recent progress in the development of fast Datalog reasoners, which might be beneficial for grounding ASP programs. Thus, we present an approach for an ASP grounder that uses a Datalog reasoner. We then implement this approach by using the Datalog reasoner VLog, and we show that our implementation is competitive with state-of-the-art grounders. \n\n\nNote that this talk is a defence of a \"Belegarbeit\". It will take place online via BigBlueButton. To access the room, take one of the following links: \n\n\nwith ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=86969&p=6e64180f\n\n\nwithoput ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=86969&p=94b73c2d"]},"fulltext":"Using Datalog to Ground ASP Programs","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Using_Datalog_to_Ground_ASP_Programs","namespace":0,"exists":"1","displaytitle":"Using Datalog to Ground ASP Programs"},"Seminar 24.06.2021":{"printouts":{"Start":[{"timestamp":"1624539600","raw":"1\/2021\/6\/24\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1624545000","raw":"1\/2021\/6\/24\/14\/30\/0\/0"}],"title":["Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains"],"Room":[{"fulltext":"Online","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Online","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Jakub Rydval"],"Details":["Concrete domains have been introduced in the area of Description Logic to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. Unfortunately, in the presence of general concept inclusions (GCIs), which are supported by all modern DL systems, adding concrete domains may easily lead to undecidability. To regain decidability of the DL ALC in the presence of GCIs, quite strong restrictions, in sum called omega-admissibility, were imposed on the concrete domain. On the one hand, we generalize the notion of omega-admissibility from concrete domains with only binary\npredicates to concrete domains with predicates of arbitrary arity. On the other hand, we relate omega-admissibility to well-known notions from model theory. In particular, we show that finitely bounded homogeneous structures yield omega-admissible concrete domains. This allows us to show omega-admissibility of concrete domains using existing results from model theory. When integrating concrete domains into lightweight DLs of the EL family, achieving decidability is not enough. One wants reasoning in the resulting DL to be tractable. This can be achieved by using so-called p-admissible concrete domains and restricting the interaction between the DL and the concrete domain. We investigate p-admissibility from an algebraic point of view. Again, this yields strong algebraic tools for demonstrating p-admissibility. In particular, we obtain an expressive numerical p-admissible concrete domain based on the rational numbers. Although omega-admissibility and p-admissibility are orthogonal conditions that are almost exclusive, our algebraic characterizations of these two properties allow us to locate an infinite class of p-admissible concrete domains whose integration into ALC yields decidable DLs.\n\n\nThis talk will take place online via BigBlueButton. To access the room, take one of the following links:\n\nwith ZIH-login: \n\nhttps:\/\/selfservice.zih.tu-dresden.de\/l\/link.php?m=128250&p=cc3d308c\n\nwithout ZIH-login:\n\nhttps:\/\/selfservice.zih.tu-dresden.de\/link.php?m=128250&p=0d4fa104"]},"fulltext":"Seminar 24.06.2021","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Seminar_24.06.2021","namespace":0,"exists":"1","displaytitle":"Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains"},"Using Ontologies to Query Probabilistic Numerical Data":{"printouts":{"Start":[{"timestamp":"1499347800","raw":"1\/2017\/7\/6\/13\/30\/0\/0"}],"Ende":[{"timestamp":"1499349600","raw":"1\/2017\/7\/6\/14\/0\/0\/0"}],"title":["Using Ontologies to Query Probabilistic Numerical Data"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Patrick Koopmann"],"Details":["We consider ontology-based query answering in a setting where some of the data are numerical and of a probabilistic nature, such as data obtained from uncertain sensor readings. The uncertainty for such numerical values can be more precisely represented by continuous probability distributions than by discrete probabilities for numerical facts concerning exact values. For this reason, we extend existing approaches using discrete probability distributions over facts by continuous probability distributions over numerical values. We determine the exact (data and combined) complexity of query answering in extensions of the well-known description logics EL and ALC with numerical comparison operators in this probabilistic setting."]},"fulltext":"Using Ontologies to Query Probabilistic Numerical Data","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Using_Ontologies_to_Query_Probabilistic_Numerical_Data","namespace":0,"exists":"1","displaytitle":"Using Ontologies to Query Probabilistic Numerical Data"},"VLog: A Column-oriented Rule-Based Engine":{"printouts":{"Start":[{"timestamp":"1519291200","raw":"1\/2018\/2\/22\/9\/20\/0\/0"}],"Ende":[{"timestamp":"1519296600","raw":"1\/2018\/2\/22\/10\/50\/0\/0"}],"title":["VLog: A Column-oriented Rule-Based Engine"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Jacopo Urbani"],"Details":["In this talk, I will first introduce our young research group in Amsterdam which is concerned with the design and implementation of efficient large-scale systems for AI. Then, I will present VLog, one of such a systems which is designed to execute Datalog reasoning and is developed in collaboration with TUD. VLog adopts the distinctive approach of computing the Datalog materialisation by storing the inference with a columnar layout. It has been shown that columnar relational technology can execute efficiently analytical SQL queries, but it deals poorly with updates. For Datalog queries, however, the problem of updates can be avoided altogether by working in append-only mode and by producing the inferences one \"set-at-a-time\u201d instead of one \"fact-at-a-time\u201d. I will first introduce the core design principles of VLog, and describe how its approach leads to good data compression and allows the implementation of techniques for avoiding duplicates. Then, I will present some experiments and give a short demo that illustrates its potential on large knowledge bases. In the last part of the talk, I will briefly report on some ongoing work on extending VLog to handle existentially quantified rules, statistical inference, and on a novel machine learning technique for improving query-driven evaluation."]},"fulltext":"VLog: A Column-oriented Rule-Based Engine","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/VLog:_A_Column-oriented_Rule-Based_Engine","namespace":0,"exists":"1","displaytitle":"VLog: A Column-oriented Rule-Based Engine"},"Verification of Golog Programs over Description Logic Actions":{"printouts":{"Start":[{"timestamp":"1509614100","raw":"1\/2017\/11\/2\/9\/15\/0\/0"}],"Ende":[{"timestamp":"1509617700","raw":"1\/2017\/11\/2\/10\/15\/0\/0"}],"title":["Verification of Golog Programs over Description Logic Actions"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Benjamin Zarrie\u00df"],"Details":["Golog is a powerful programming language for logic-based agents. The primitives of the language are actions whose preconditions and effects are defined in a Situation Calculus action theory using first-order logic. To describe possible courses of actions the programmer can freely combine imperative control structures with constructs for non-deterministic choice, leaving it to the system to resolve the non-determinism in a suitable manner. Golog has been successfully used for high-level decision making in the area of cognitive robotics. Obviously, it is important to verify certain properties of a Golog program before executing it on a physical robot. However, due to the high expressiveness of the language the verification problem is in general undecidable. In this thesis, we study the verification problem for Golog programs over actions defined in action languages based on Description Logics and explore the boundary between decidable and undecidable fragments."]},"fulltext":"Verification of Golog Programs over Description Logic Actions","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Verification_of_Golog_Programs_over_Description_Logic_Actions","namespace":0,"exists":"1","displaytitle":"Verification of Golog Programs over Description Logic Actions"},"Verification of Knowledge-Based Programs over Description Logic Actions":{"printouts":{"Start":[{"timestamp":"1441637400","raw":"1\/2015\/9\/7\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1441641000","raw":"1\/2015\/9\/7\/15\/50\/0\/0"}],"title":["Verification of Knowledge-Based Programs over Description Logic Actions"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Benjamin Zarrie\u00df"],"Details":["A knowledge-based program defines the behavior of an agent by combining primitive actions, programming constructs and test conditions that make explicit reference to the agent's knowledge. In this paper we consider a setting where an agent is equipped with a Description Logic (DL) knowledge base providing general domain knowledge and an incomplete description of the initial situation. We introduce a corresponding new DL-based action language that allows for representing both physical and sensing actions, that we then use to build knowledge-based programs with test conditions expressed in an epistemic DL. After proving undecidability for the general case, we then discuss a restricted fragment where verification becomes decidable. The provided proof is constructive and comes with an upper bound on the procedure's complexity."]},"fulltext":"Verification of Knowledge-Based Programs over Description Logic Actions","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Verification_of_Knowledge-Based_Programs_over_Description_Logic_Actions","namespace":0,"exists":"1","displaytitle":"Verification of Knowledge-Based Programs over Description Logic Actions"},"Verifying Temporal Properties of Biological Systems":{"printouts":{"Start":[{"timestamp":"1422888600","raw":"1\/2015\/2\/2\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1422892200","raw":"1\/2015\/2\/2\/15\/50\/0\/0"}],"title":["Verifying Temporal Properties of Biological Systems"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Rafael Pe\u00f1aloza Nyssen"],"Details":["Biological systems, seen as a collection of components interacting over time, are commonly modeled through interaction systems like cellular automata and Boolean networks. Once such a model is built, it is important to verify whether some desired temporal properties hold in it. In this talk we present a graph-based approach for verifying properties expressible in linear temporal logic that matches the lower complexity bounds of the problem. The talk will include some animations made with LaTeX."]},"fulltext":"Verifying Temporal Properties of Biological Systems","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Verifying_Temporal_Properties_of_Biological_Systems","namespace":0,"exists":"1","displaytitle":"Verifying Temporal Properties of Biological Systems"},"Visualisierung r\u00e4umlich-zeitlicher Inhalte aus Wikidata":{"printouts":{"Start":[{"timestamp":"1417710600","raw":"1\/2014\/12\/4\/16\/30\/0\/0"}],"Ende":[{"timestamp":"1417714200","raw":"1\/2014\/12\/4\/17\/30\/0\/0"}],"title":["Visualisierung r\u00e4umlich-zeitlicher Inhalte aus Wikidata"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Verteidigung Studienarbeit"],"Speaker":["Georg Wild"],"Details":["Das Projekt Wikidata bietet neue M\u00f6glichkeiten zur algorithmischen Interpretation komplexer relationaler Wissensstrukturen. Der immer weiter wachsende Umfang dieses Datenbestands verlangt nach M\u00f6glichkeiten, Teilmengen der Daten in einem menschenfreundlichen Format zu pr\u00e4sentieren, das gr\u00f6\u00dfere Zusammenh\u00e4nge erkennbar macht. Mit dem Ziel, die zeitliche und r\u00e4umliche Verortung umfangreicher Datenmengen intuitiv begreifbar zu machen, werden wir im Verlauf dieser Arbeit einen Entwurf f\u00fcr eine geeignete Datenvisualisierung erarbeiten und diesen anschlie\u00dfend in Form einer interaktiven Webanwendung umsetzen."]},"fulltext":"Visualisierung r\u00e4umlich-zeitlicher Inhalte aus Wikidata","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Visualisierung_r%C3%A4umlich-zeitlicher_Inhalte_aus_Wikidata","namespace":0,"exists":"1","displaytitle":"Visualisierung r\u00e4umlich-zeitlicher Inhalte aus Wikidata"},"Visualization and navigation paradigms for triadic formal concept analysis":{"printouts":{"Start":[{"timestamp":"1418050200","raw":"1\/2014\/12\/8\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1418053800","raw":"1\/2014\/12\/8\/15\/50\/0\/0"}],"title":["Visualization and navigation paradigms for triadic formal concept analysis"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Diana Troanc\u0103"],"Details":["Formal Concept Analysis (FCA) is a mathematical discipline that describes conceptual hierarchies arising from a binary incidence structures (so-called formal contexts) in terms of lattice theory. In a concept lattice, formal concepts are ordered by subconcept-superconcept relationship, giving rise to very intuitive ways of visualizing and navigating data sets. FCA has become an extremely active and important field of research having made impressive progress over the last years.\n\nThis research focuses on Triadic FCA, an extension of \u201cclassical\u201d FCA considering ternary incidence structures (tricontexts with objects, attributes and conditions) giving rise to so-called triconcepts. Although such ternary incidence structures arise naturally in diverse data analysis settings, the structure of the corresponding trilattices is still not so well-understood and previous attempts to develop intuitive visualizations have led to unsatisfactory results. This presentation aims to introduce new ideas for a visualization and navigation framework that enable human users to explore and interact with triadic data sets in an intuitive and natural manner."]},"fulltext":"Visualization and navigation paradigms for triadic formal concept analysis","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Visualization_and_navigation_paradigms_for_triadic_formal_concept_analysis","namespace":0,"exists":"1","displaytitle":"Visualization and navigation paradigms for triadic formal concept analysis"},"Weighted Automata with Storage":{"printouts":{"Start":[{"timestamp":"1652353200","raw":"1\/2022\/5\/12\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1652356800","raw":"1\/2022\/5\/12\/12\/0\/0\/0"}],"title":["Weighted Automata with Storage"],"Room":[{"fulltext":"Https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Https:\/\/bbb.tu-dresden.de\/b\/ali-zgz-l8d-52n","namespace":0,"exists":"","displaytitle":""}],"Type":["Vortrag"],"Speaker":["Luisa Hermann"],"Details":["This talk is an excerpt of the PhD defense talk by Luisa Hermann.\n\nIn this thesis, we investigate weighted tree automata with storage theoretically. This model generalises finite state automata in three dimensions: (i) from words to trees, (ii) by using an arbitrary storage type in addition to a finite-state control, and (iii) by considering languages in a quantitative setting using a weight structure."]},"fulltext":"Weighted Automata with Storage","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Weighted_Automata_with_Storage","namespace":0,"exists":"1","displaytitle":"Weighted Automata with Storage"},"Weighted Model Counting on the GPU by Exploiting Small Treewidth":{"printouts":{"Start":[{"timestamp":"1535634000","raw":"1\/2018\/8\/30\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1535639400","raw":"1\/2018\/8\/30\/14\/30\/0\/0"}],"title":["Weighted Model Counting on the GPU by Exploiting Small Treewidth"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Johannes Fichte"],"Details":["We propose a novel solver that efficiently finds almost the exact number of solutions of a Boolean formula (#Sat) and the weighted model count of a weighted Boolean formula (WMC) if the treewidth of the given formula is sufficiently small. The basis of our approach are dynamic programming algorithms on tree decompositions, which we engineered towards efficient parallel execution on the GPU. We provide thorough experiments and compare the runtime of our system with state-of-the-art #Sat and WMC solvers. Our results are encouraging in the sense that also complex reasoning problems can be tackled by parameterized algorithms executed on the GPU if instances have treewidth at most 30, which is the case for more than half of counting and weighted counting benchmark instances."]},"fulltext":"Weighted Model Counting on the GPU by Exploiting Small Treewidth","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Weighted_Model_Counting_on_the_GPU_by_Exploiting_Small_Treewidth","namespace":0,"exists":"1","displaytitle":"Weighted Model Counting on the GPU by Exploiting Small Treewidth"},"TBA3":{"printouts":{"Start":[{"timestamp":"1575550800","raw":"1\/2019\/12\/5\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1575556200","raw":"1\/2019\/12\/5\/14\/30\/0\/0"}],"title":["What makes a variant of query determinacy (un)decidable?"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Jerzy Marcinkowski"],"Details":["Suppose there is a database we have no direct access to, but there are views of this database available to us, defined by some queries Q_1 , Q_2 , . . . Q_k. And we are given another query Q. Will we be able to compute Q only using the available views?\n\n\n\nThe above question, call it \"the question of determinacy\", sounds almost philosophical. One can easily imagine a bearded man in himation chained to the wall of a cave watching the views projected on the wall and pondering whether, from what he is able to see, the reality can be faithfully reconstructed.\n\nFor us it is a database theory question though. And a really well motivated one, with motivations ranging from query evaluation plans optimization (where we prefer a positive answer) to privacy issues (where the preferred answer is negative).\n\nQuery determinacy is a broad topic, with literally hundreds of papers published since the late 1980s. This talk is not going to be a \"survey\" (which would be impossible, within a one hour time frame, and with this speaker), but rather a personal perspective of a person somehow involved in the recent developments in the area.\n\nFirst I will explain how, in the last 30+ years, the question of determinacy was formalized. There are many parameters here: obviously one needs to choose the query language of the queries Q_i and the query language of Q. But -- surprisingly -- there is also some choice regarding what the word \"to compute\" actually means in this context.\n\nThen I will concentrate on the variants of the decision problem of determinacy (for each choice of parameters there is one such problem -- Q_1 , Q_2 , . . . Q_k and Q constitute the instance, and the question is whether Q_1 , Q_2 , . . . Q_k determine Q) and I will talk about how I understand the mechanisms rendering different variants of determinacy decidable or undecidable. This will be on a slightly informal level. No new theorems will be presented, but I think I will be able to show simplified proofs of some of the earlier results.\n\nThis is a preview of the [https:\/\/diku-dk.github.io\/edbticdt2020\/?contents=invited_ICDT_talk.html invited talk at ICDT 2020]."]},"fulltext":"TBA3","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/TBA3","namespace":0,"exists":"1","displaytitle":"What makes a variant of query determinacy (un)decidable?"},"What makes modern SAT Solvers work that well":{"printouts":{"Start":[{"timestamp":"1437403800","raw":"1\/2015\/7\/20\/14\/50\/0\/0"}],"Ende":[{"timestamp":"1437407400","raw":"1\/2015\/7\/20\/15\/50\/0\/0"}],"title":["What makes modern SAT Solvers work that well"],"Room":[{"fulltext":"APB 3105","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3105","namespace":0,"exists":"1","displaytitle":"Raum APB 3105"}],"Type":["Vortrag"],"Speaker":["Norbert Manthey"],"Details":["When the satisfiability testing is explained to students, they usually hear about the DPLL algorithm from the 1960. Although modern algorithms are still build on the principles of that algorithm, a few modifications have been added that improve the strength of the reasoner significantly. With the CDCL algorithm, for some problems an unsatisfiability proof can be generated exponentially faster than with DPLL. The talk first presents the DPLL algorithm, and then presents the basic concepts of the CDCL algorithm."]},"fulltext":"What makes modern SAT Solvers work that well","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/What_makes_modern_SAT_Solvers_work_that_well","namespace":0,"exists":"1","displaytitle":"What makes modern SAT Solvers work that well"},"Winning Snake: Design Choices in Multi-Shot ASP":{"printouts":{"Start":[{"timestamp":"1727348400","raw":"1\/2024\/9\/26\/11\/0\/0\/0"}],"Ende":[{"timestamp":"1727352000","raw":"1\/2024\/9\/26\/12\/0\/0\/0"}],"title":["Winning Snake: Design Choices in Multi-Shot ASP"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Elisa B\u00f6hl"],"Details":["Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snake. This game is particularly interesting because a victory can be assured by solving the underlying NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game\u2019s progress."]},"fulltext":"Winning Snake: Design Choices in Multi-Shot ASP","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Winning_Snake:_Design_Choices_in_Multi-Shot_ASP","namespace":0,"exists":"1","displaytitle":"Winning Snake: Design Choices in Multi-Shot ASP"},"Workshop on Human Reasoning and Computational Logic":{"printouts":{"Start":[{"timestamp":"1486630800","raw":"1\/2017\/2\/9\/9\/0\/0\/0"}],"Ende":[{"timestamp":"1486749600","raw":"1\/2017\/2\/10\/18\/0\/0\/0"}],"title":["Workshop on Human Reasoning and Computational Logic"],"Room":[{"fulltext":"APB 2026","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_2026","namespace":0,"exists":"","displaytitle":""}],"Type":["sonstige Veranstaltung"],"Speaker":[],"Details":["The goal of this workshop is to provide a platform for the scientific exchange between the areas of Cognitive Science and Computational Logic on Human Reasoning."]},"fulltext":"Workshop on Human Reasoning and Computational Logic","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Workshop_on_Human_Reasoning_and_Computational_Logic","namespace":0,"exists":"1","displaytitle":"Workshop on Human Reasoning and Computational Logic"},"Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting":{"printouts":{"Start":[{"timestamp":"1564491600","raw":"1\/2019\/7\/30\/13\/0\/0\/0"}],"Ende":[{"timestamp":"1564493400","raw":"1\/2019\/7\/30\/13\/30\/0\/0"}],"title":["Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting"],"Room":[{"fulltext":"APB 3027","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/APB_3027","namespace":0,"exists":"1","displaytitle":"Raum APB 3027"}],"Type":["Vortrag"],"Speaker":["Bartosz Bednarczyk"],"Details":["'''Abstract.''' Among the most expressive knowledge representation formalisms are the description logics of the Z family. For well-behaved fragments of ZOIQ, entailment of positive two-way regular path queries is well known to be 2EXPTIMEcomplete under the proviso of unary encoding of numbers in cardinality constraints. We show that this assumption can be dropped without an increase in complexity and EXPTIME-completeness can be achieved when bounding the number of query atoms, using a novel reduction from query entailment to knowledge base satisfiability. These findings allow to strengthen other results regarding query entailment and query containment problems in very expressive description logics. Our results also carry over to GC2, the two-variable guarded fragment of first order logic with counting quantifiers, for which hitherto only conjunctive query entailment has been investigated."]},"fulltext":"Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Worst-Case_Optimal_Querying_of_Very_Expressive_Description_Logics_with_Path_Expressions_and_Succinct_Counting","namespace":0,"exists":"1","displaytitle":"Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting"},"Young Scientist's Third International Workshop on Trends in Information Processing (YSIP3)":{"printouts":{"Start":[{"timestamp":"1568678400","raw":"1\/2019\/9\/17\/0\/0\/0\/0"}],"Ende":[{"timestamp":"1568937600","raw":"1\/2019\/9\/20\/0\/0\/0\/0"}],"title":["Young Scientist's Third International Workshop on Trends in Information Processing (YSIP3)"],"Room":[{"fulltext":"Stavropol and Arkhyz, Russian Federation","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Stavropol_and_Arkhyz,_Russian_Federation","namespace":0,"exists":"","displaytitle":""}],"Type":["Konferenz"],"Speaker":[],"Details":["We invite young scientists \u2013 typically master or PhD students \u2013 to submit new scientific results \u2013 as, for example, obtained in their bachelor thesis, project work, master thesis, or PhD project \u2013 in all areas of Information Processing."]},"fulltext":"Young Scientist's Third International Workshop on Trends in Information Processing (YSIP3)","fullurl":"\/\/iccl.inf.tu-dresden.de\/web\/Young_Scientist%27s_Third_International_Workshop_on_Trends_in_Information_Processing_(YSIP3)","namespace":0,"exists":"1","displaytitle":"Young Scientist's Third International Workshop on Trends in Information Processing (YSIP3)"}},"serializer":"SMW\\Serializers\\QueryResultSerializer","version":2,"meta":{"hash":"e425d82aa5d0a956b3d4ccc5e8c03fa0","count":349,"offset":0,"source":"","time":"0.148537"}},"ask":{"conditions":"[[Kategorie:Veranstaltung]] [[Start::+]]","parameters":{"limit":1000,"offset":0,"sortkeys":{"":"ASC"},"mainlabel":"","querymode":1,"format":"eventcalendar","source":"","link":"subject","headers":"show","intro":"","outro":"","searchlabel":"... further results","default":"","import-annotation":false,"defaultview":"month","views":"month,basicWeek,agendaDay","firstday":"Monday","start":"current","legend":"none","dayview":false,"class":"","theme":"basic","clicktarget":"none","includeend":true},"printouts":["?Start","?Ende","?Titel EN=title","?Raum=Room","?Veranstaltungsart=Type","?Vortragender=Speaker","?Beschreibung EN=Details"]}},"version":"0.8.0"}

	2025-01-20:	ICCL Researchers Contribute to Lean Standard Library
	2024-11-20:	Jonas Karge Wins Student Best Paper Award at PRIMA24
	2024-11-05:	Best Paper Award for Nemo
	2024-07-01:	CACM blog article on work-family balance in academia by ICCL researcher Luisa Herrmann
	2024-06-13:	Markus Krötzsch Wins 2024 Teaching Award

News and Events

News and Events

Recent News

Event Calendar

April 2025