Suchergebnisse
Aus International Center for Computational Logic
- | ?Titel EN= | template=Neuigkeit_kurz_inline/en736 Bytes (85 Wörter) - 01:06, 20. Mär. 2019
- |Titel EN=Ongoing Research in the NAVAS Project |Beschreibung EN=This talk provides an insight into the latest research of answer set naviga359 Bytes (44 Wörter) - 17:25, 15. Okt. 2021
- |Titel EN=Report on research visit to NRC |Beschreibung EN=Report on research visit to NRC315 Bytes (36 Wörter) - 14:59, 10. Dez. 2018
- |Titel EN=Automata, Logic, Algebra... What do they have in common? |Beschreibung EN=In this talk, a few language classes will be discussed including their auto439 Bytes (50 Wörter) - 04:13, 18. Okt. 2018
- |Titel EN=Chile – A Trip Report |Vortragender=Sebastian Rudolph262 Bytes (24 Wörter) - 18:16, 24. Mai 2016
- |Titel EN=Lyndon words and density of runs |Beschreibung EN=The concept of Lyndon words is very useful in combinatorics on words. We sh495 Bytes (65 Wörter) - 04:17, 18. Okt. 2018
- |Titel EN=Decomposition of regular languages |Beschreibung EN=I will discuss a problem how to decompose a regular language with respect…497 Bytes (63 Wörter) - 04:13, 18. Okt. 2018
- |Titel EN=Relbacoess |Beschreibung EN=A brief talk on the research work on formal modeling access control via des498 Bytes (61 Wörter) - 06:09, 18. Okt. 2018
- |Titel EN=Computability and Complexity of (Iterated) Belief Revision |Beschreibung EN=Belief revision denotes the process of the incorporation of new information665 Bytes (82 Wörter) - 13:29, 4. Okt. 2022
- |Titel EN=Solving Angry Birds with Reinforcement Learning |Beschreibung EN=Reinforcement Learning is an area of machine learning tackling the problem,600 Bytes (77 Wörter) - 04:15, 18. Okt. 2018
- |Titel EN=Investigating the finite-cliquewidth-model property of C². |Beschreibung EN=Abstract: I will try to explain to you the results of my internship on 2-v607 Bytes (82 Wörter) - 09:32, 6. Jul. 2023
- |Titel EN=On Computing Explanations in Argumentation |Beschreibung EN=In an argumentation, usually there is a particular argument called as the…737 Bytes (89 Wörter) - 05:47, 18. Okt. 2018
- |Titel EN=Satisfiability of temporal logics with concrete domain |Beschreibung EN=We show how we can enrich linear- and branching-time temporal logics with…618 Bytes (80 Wörter) - 05:38, 18. Okt. 2018
- |Titel EN=Communication with Automata |Beschreibung EN=In this talk I will give an overview on the basic notions of Petri nets, in665 Bytes (95 Wörter) - 23:46, 16. Mai 2022
- |Titel EN=Notes on Computational Learning Theory and the problem of learning CNFs |Beschreibung EN=This is an informal talk where I first talk about the PAC learning model an640 Bytes (89 Wörter) - 03:40, 18. Okt. 2018
- |Titel EN=Explaining neural network reasoning |Beschreibung EN=Neural networks are in heavy use everywhere in artificial intelligence toda729 Bytes (91 Wörter) - 05:45, 18. Okt. 2018
- |Titel EN=Introducing Existential Rules and Module Extraction |Beschreibung EN=In this talk the general framework of Datalog with Existential Rules will…685 Bytes (91 Wörter) - 05:49, 18. Okt. 2018
- |Titel EN=Question Answering Systems |Beschreibung EN=With the ever-growing amount of linked data available on the web there is…689 Bytes (91 Wörter) - 05:28, 18. Okt. 2018
- |Titel EN=Weighted Automata with Storage |Beschreibung EN=This talk is an excerpt of the PhD defense talk by Luisa Hermann.704 Bytes (99 Wörter) - 22:11, 27. Apr. 2022
- |Titel EN=Graph Structure and Monadic Second-Order Logic |Beschreibung EN=In this talk, I will introduce the book from Courcelle and Engelfriet (Grap716 Bytes (92 Wörter) - 06:09, 18. Okt. 2018
