Tutors: Jannik Presberger The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree automata whose pointwise maximum is equivalent to the given automaton. Through its versatility the ASM approach is non-monolithic and integratable at any development level into current software design and analysis environments.
Different semantics of abstract Argumentation Frameworks (AFs) provide different levels of decisiveness for reasoning about the acceptability of conflicting arguments. The talk will be about the two-variable fragment of First-Order Logic interpreted on words.Motivation: There are several reasons why logicians could be interested in FO2[<]. This logic will lead us to a new characterization of the robust class of so called regular transductions.
In the latter, automata on infinite words are the technical ingredient that leads to model completeness.
If we allow randomized streaming algorithms with a two-sided error, then the above space trichotomy becomes a space quatrochotomy: for every regular languages, the space complexity of the sliding window word problem is either constant, doubly logarithmic, logarithmic, or linear.
In the context of non-monotonic reasoning this notion is not as meaningful due to the possibility of resolving conflicts by adding information.
These certificates are vectors satisfying certain linear inequation systems that we derive by applying variants of Farkas' Lemma to the linear programs characterizing the reachability probabilities in MDP. Friday, 3rd - 5th DS, APB E065 (individual appointments for evaluation). 2019 Dec 10: 13:15-16:15: Adding Quantitative Taste to FO2 on Words. Rule construction is graphically visualized by covering cells in the non-deterministic matrix. Invariants are one of the most fundamental and useful notions in automated verification, dynamical systems, and control theory. For modes (a) and (b), a correction of the theoretical assignment before the individual evaluation will be attempted, meaning that there is a chance you can get feedback on your solution on the evaluation day. Sprache; Suche; Intern; Professur für Rechnerarchitektur.
The talk will introduce this structure and define the Constraint Satisfaction Problem of its first-order reducts. One theoretical submission per team is sufficient. (c) In digital form as a PDF document included in your practical submission (the deadline is then 23:59). 10.12.19 Lighting (slides) Since dualization is equivalent to many important problems in computer and data sciences, including the famous problem of computing minimal transversals of a hypergraph, the quasi-polynomial dualization algorithm for Boolean lattices proposed by M. Fredman and L. Khachiyan in 1996 was an important breakthrough. Joint consultation with Prof. Gumhold: 11th of February 2020 at 2pm APB 2026, Lernraum (another joint consultation): 13.02.2002, 3:30-5 pm APB/E009, Supervisors: Benjamin Russig
For example, a polynomial time algorithm for model checking Markov chains against UBA-properties is known, which is not possible for properties specified by NBA. On the theoretical side, we develop sufficient conditions to guarantee its termination (i.e., acyclicity notions), and study several restrictions that furthermore ensure its polynomiality.
Note that for technical reasons, every team member has to upload a copy of their practical solution to OPAL in order to get scored. In the talk, we also discuss some relations to subgraph counting algorithms as well as machine learning.
Questions arising in other areas of mathematics are sometimes dealt with by appealing to the field set theory. Sprache; Suche; Intern ; Professur für Computergraphik und Visualisierung ... (WS 2019/20) Instructor: Prof. Dr. S. Gumhold: Time&Place: Tuesday, 11:10am (3 rd DS) in APB E023 For exercise, see below. There are various known characterizations, using counting logics, using the Sherali-Adams hierarchy in linear programming, and using pebble games. Moreover, for the constant and logarithmic space classes we provide very natural characterizations: For every regular language L the sliding window word problem can be solved in(i) constant space if and only if L is a boolean combination of regular length languages and suffix-testable languages and in(ii) logarithmic space if and only if L is a boolean combination of regular length languages and regular left ideals. It will give a proof of the complexity dichotomy for CSPs of first-order expansions of T by injective relations. * This briefing is right after the lecture on Tuesday. The talk gives an introduction to geometric complexity theory, which is an approach towards complexity lower bounds using algebraic geometry and representation theory. Current research on invariant generation employs an eclectic array of techniques, including abductive inference, abstract interpretation, constraint solving, interpolation, and machine learning. : all participate : Doctoral students participate : next seminar. TU Dresden Institut für Technische Informatik. DTS_Praktikum 22.10.19 Polygonal Meshes (slidesupdated 29.10.19) Instead of developing historical models for existing OCR, it can be prudent to first build complementary tools for post-correction, which feed from all visual and contextual cues of OCR itself, but maintain their own comprehensive models.
When one changes the logical deduction system, the algebraic structures become less simple, and more interesting; this is where one enters the world of Heyting algebras, modal algebras, and generalizations of such. Please find the abstracts below the schedule and note that some of the slides are made available here, internally. TU Dresden, WS 2019/20 Introduction to Nonmonotonic Reasoning Slide 172. good book for first part: Polygonal Mesh Processing We explain the three basic concepts of the Abstract State Machines (ASM) Method for a rigorous development of software intensive systems. Decidability results for model-checking and synthesising transductions are also presented. Our results also show that many naive generalisations of the equivalent conditions in the finite fail to capture expressibility in least fixed point logic already for temporal CSPs. We will prove that, surprisingly, adding just the simple percentage constraints already make the logic undecidable. 29.10.19 Halfedge Data Structure (slidesupdated 29.10.19) Second, the most interesting computational problems concerning FO2[<] are decidable and have elementary complexity. We show that model completeness also has an important role to play in logical algebra. Passing Criteria: At least 50 % of the achievable score AND at least 1 point per theory assignment AND at least 2 points per practical assignment. Non-deterministic semantics is a generalization of many-valued logics and has some applications interesting in linguistic, circuit design and philosophical logic. In this talk, I will discuss the basics and challenges of OCR post-correction using WFST in the context of the joint coordinated research effort OCR-D, which is aimed at developing OCR methods for printed historic material in preparation of automated mass-digitisation of all German-speaking prints from the 16th to 19th century. This talk is based on joint work with Shaull Almagor, Dmitry Chistikov, Ehud Hrushovski, Amaury Pouly, and Joël Ouaknine. Although optical character recognition (OCR) quality has improved substantially over the last decade, it still struggles on historic material. The release date is usually also the debriefing date of the previous exercise, where the supervisors will walk through the theoretical assignments and explain the solution (Friday, 09:20, APB E023). However, in an important particular case where the lattice is distributive, a subexponential algorithm can be proposed. The Valued Constraint Satisfaction Problem, From Linear Temporal Logic to Unambiguous Büchi Automata, Finite Sequentiality of Unambiguous Max-Plus Tree Automata, Weighted Finite-State Transducers for OCR Post-Correction, A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. However, rank-based semantics are generally not applicable for cyclic graphs and therefore, a second approach to ranking sets of arguments is being introduced, as well.
For this, they introduce and investigate new automata classes and obtain a number of decidability results for these. The VCSP captures both Max CSP-type problems, where one wants to optimise the number of satisfied constraints and integer programming-type problems, where one adds an objective function to an ordinary CSP to indicate the desirability of each assignment.As the VCSP is hard in general, any meaningful study of its complexity requires restricting the problem in some way. This work suggests an intermediate approach by ranking sets of arguments using existing rank-based semantics.
(a) in written form on A4 paper by 16:00 to chair staff - we recommend handing in solutions on physical paper at the end of the previous lecture. In the former, model completeness can be seen to be closely related to a certain interpolation property of the logic, originally established by Pitts. Translations from Linear Temporal Logic (LTL) to various types of automata on infinite words have been studied extensively. The university’s origins can be traced as far back as 1828, when it was founded as the Royal Saxon Technical School.
The logic we employ for our weighted extension is based on the weighted MSO logic introduced by Droste and Gastin to obtain a Büchi-type result for weighted automata.
For exercise, see below, realtime rendering, geometry processing, acceleration data structures, optimization for CG, 15.10.19 Introduction and Math Basics (slides)