Attribut:Beschreibung EN

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Dies ist eine Eigenschaft des Typs Text.

Seiten mit dem Attribut „Beschreibung EN“

Es werden 25 Seiten angezeigt, die dieses Attribut verwenden:

(vorherige 25) (nächste 25)

1

11th European Conference on Logics in Artificial Intelligence (JELIA-2008) +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. The European Conference on Logics in Artificial Intelligence (or Journées Européennes 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), Évora, Portugal (1996), Dagstuhl, Germany (1998), Málaga, Spain (2000), Cosenza, Italy (2002), Lisbon, Portugal (2004), and Liverpool, UK (2006). The 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.  +
12th EMCL Workshop +On the 20th and 21th February, the 12th EMCL student workshop takes place in Dresden (see http://www.pk.workshop.computational-logic.org/). Students in the European Master's Program in Computational Logic of the universities in Bozen, Dresden, Vienna, and Lisbon organize the workshop. The program contains presentations by the students suggested for master theses, presentations by alumni about their continued education in PhD programs or in industry, and research talks by the partner universities. During the workshop, the Best Master Thesis Award 2017 will be given.  +
17. WLP - Workshop Logic Programming +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ünglich rein relationale Konzept auch Funktionen und Constraints. In den vergangenen Jahren hat dieses Paradigma eine hohe Attraktivität erworben, u.a. in den Bereichen Datenbanken und Verarbeitung von natürlicher 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 übrige Softwarelandschaft, der Behandlung von Dynamik und des Umgangs mit Kommunikation stellt.  +

2

22nd Workshop on (Constraint) Logic Programming 2008 +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.  +
29th Workshop on (Constraint) Logic Programming (WLP 2015) +The Workshops on (Constraint) Logic Programming are the annual meeting of the German Society of Logic Programming Gesellschaft für 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). The 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. The technical program of the workshop will include invited talks, presentations of refereed papers, and system demonstrations.  +

3

38th German Conference on Artificial Intelligence +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. In September 2015, prior to the conference, there is an international summer school on reasoning organized by the international center of computational logic.  +

9

9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA) +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.  +

A

A Dichotomy for Evaluating Simple Regular Path Queries +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. Whereas 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. '''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.  +
A Single Approach to Decide Chase Termination on Linear Existential Rules +<b>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. Joint work with M. Leclère, M.-L. Mugnier and F. Ulliana. <b>Speaker Bio:</b> Michaël 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/.  +
A pragmatic approach to translation: Vocabulary alignment through Multiagent Interaction and Observation +Talk by: Paula Chocrón Institute: Artificial Intelligence Research Institute (IIIA-CSIC), Barcelona, Spain Abstract: "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?" I 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.  +
A proof of CSP Dichotomy conjecture +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.  +
APB 3027 +This is the seminar room of the Institute for Theoretical Computer Science.  +
APB 3041 +Secretariat Knowledge-Based Systems  +
APB 3105 +This is the oval meeting room on the third floor of Andreas-Pfitzmann-Bau.  +
APB E005 +This is one of the seminar rooms on the ground floor of Andreas-Pfitzmann-Bau. It offers around 30 seats and several large chalk boards.  +
APB E008 +This is one of the seminar rooms on the ground floor of Andreas-Pfitzmann-Bau. It offers around 30 seats.  +
APB E023 +This is the largest lecture hall in the Andreas Pfitzmann Building. It offers about 140 seats.  +
ASPARTIX-D Ready for the Competition +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 ready for the first International Competition on Computational Models of Argumentation (ICCMA 2015).  +
Abstrakte Argumentation +Argumentation is one of the major fields in Artificial Intelligence (AI). Numerous applications in diverse domains like legal reasoning, multi-agent systems, social networks, e-government, decision support and many more make this topic very interdisciplinary and lead to a wide range of different formalizations. Out of them the concept of abstract Argumentation Frameworks (AFs) is one of the most popular approaches to capture certain aspects of argumentation. This very simple yet expressive model has been introduced by Phan Minh Dung in 1995. Arguments and a binary attack relation between them, denoting conflicts, are the only components one needs for the representation of a wide range of problems and the reasoning therein. Nowadays numerous semantics exist to solve the inherent conflicts between the arguments by selecting sets of “acceptable” arguments. Depending on the application, acceptability is defined in different ways.  +
Adaptive Language Interaction +This talk is part of Dresden Talks on Interaction & Visualization: <https://imld.de/research/dresden-talks/2018-demberg/> Language-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). In 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.". Finally, 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.  +
Adding Threshold Concepts to the Description Logic EL +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.  +
Advances in Abstract Argumentation - Expressiveness and Dynamics +In recent years the research field of argumentation has become a major topic in the study of artificial intelligence (AI). Within the argumentation process, the focus of this work is on the evaluation of the acceptability of conflicting arguments using the formal models of abstract argumentation frameworks (AFs) and abstract dialectical frameworks (ADFs). While an AF is a directed graph where nodes represent arguments and directed edges represent conflicts between arguments, ADFs constitute a very powerful generalization of AFs by additionally assigning to each argument an acceptance condition. In this work we contribute to the advancement of the study of abstract argumentation by addressing aspects of expressiveness and dynamics of argumentation semantics. In terms of expressiveness we complement recent work on realizability in AFs, investigate the role of rejected arguments, and study the induced class of compact argumentation frameworks. Then, we lift the study of expressiveness to the concept of input-output AFs. Finally, we present a unifying algorithmic approach to realizability capturing AFs and ADFs as well as intermediate formalisms in a modular way, which is also implemented in ASP. Taking into account the dynamic nature of argumentation, we study two central issues therein: revision and splitting. For revision we apply the seminal AGM theory of belief change to argumentation by presenting representation theorems for revision operators which guarantee to result in a single framework. We also present concrete belief change operators and analyze their computational complexity. Finally, we study splitting of ADFs, aiming for optimization of computation by incremental computation of semantics.  +
Thema3427 +Answer set programming (ASP) is one of the most popular modeling languages in knowledge representation. In recent years, many integrated development environments (IDE) for ASP programs including editors and debuggers are developed. However, none of them focuses on analyzing the answer sets. With the availability of a huge number of answer sets, it is increasingly important to provide a solution to navigate them. We study and analyze the answer sets to perform the user access to specific answers. To this end, we aim at conducting and exploring different navigation approaches, such as, filtering, sort- ing, finding diverse/similar solutions, and faceted browsing. Afterward, we implement a tool performing the above approaches in order to simplify the search task. We conclude by testing the performance of the proposed tool into two different real world examples of ASP programs.  +
Aktivitaet2000 +Member in the program committee of the 23rd ACM International Conference on Information and Knowledge Management (CIKM 2014)  +
Aktivitaet2001 +Proceedings & Publicity Chair of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2012)  +
(vorherige 25) (nächste 25)