global assumptions in coalgebraic modal logics. Unlike earlier

results of this kind, we do not require a tractable set of tableau

rules for the instance logics, so that the result applies to wider

classes of logics. Examples are Presburger modal logic,

which extends graded modal logic with linear inequalities over

numbers of successors, and probabilistic modal logic with polynomial

inequalities over probabilities. We establish the theoretical upper

bound using a type elimination algorithm. We also provide a global

caching algorithm that offers potential for practical reasoning.

}, address = {Berlin}, author = {Kupke, Clemens and Pattinson, Dirk and Schröder, Lutz}, booktitle = {Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Proceedings}, date = {2015-08-17/2015-08-19}, doi = {10.1007/978-3-319-22177-9_28}, faupublication = {yes}, keywords = {Modal logic; tableaux; global caching; Presburger modalities; coalgebraic logic}, pages = {367--380}, peerreviewed = {Yes}, publisher = {Springer}, title = {{Reasoning} with {Global} {Assumptions} in {Arithmetic} {Modal} {Logics}}, venue = {Gdansk}, year = {2015} } @inproceedings{faucris.121783024, abstract = {In epistemic logic, dynamic operators describe the evolution of the knowledge of participating agents through communication, one of the most basic forms of communication being public announcement. Semantically, dynamic operators correspond to transformations of the underlying model. While metatheoretic results on dynamic epistemic logic so far are largely limited to the setting of Kripke models, there is evident interest in extending its scope to non-relational modalities capturing, e.g., uncertainty or collaboration. We develop a generic framework for non-relational dynamic logic by adding dynamic operators to coalgebraic logic. We discuss a range of examples and establish basic results including bisimulation invariance, complexity, and a small model property. © 2013 Springer-Verlag.}, address = {Berlin}, author = {Gorin, Daniel and Schröder, Lutz and Carreiro, Facundo}, booktitle = {Proc. 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013, Part II}, date = {2013-07-08/2013-07-12}, doi = {10.1007/978-3-642-39212-2_12}, faupublication = {yes}, isbn = {978-3-642-39211-5}, note = {UnivIS-Import:2015-04-16:Pub.2013.tech.IMMD.profes_1.coalge_9}, pages = {101-112}, peerreviewed = {Yes}, publisher = {Springer-verlag}, series = {Lecture Notes in Computer Science}, title = {{Coalgebraic} {Announcement} {Logics}}, venue = {Riga}, volume = {7966}, year = {2013} } @inproceedings{faucris.118780904, author = {Breitsprecher, Thilo and Codescu, Silvestru Mihai and Schröder, Lutz and Wartzack, Sandro and jucovschi, Constantin and Kohlhase, Michael}, booktitle = {In Proc. 13th International Design Conference, DESIGN 2014}, faupublication = {yes}, keywords = {design knowledge;ontology;semantics in product development}, note = {UnivIS-Import:2015-04-17:Pub.2014.tech.IMMD.profes_1.semant}, pages = {1723-1732}, peerreviewed = {Yes}, publisher = {Faculty of Mechanical Engineering and Naval Architecture}, series = {DESIGN}, title = {{Semantic} {Support} for {Engineering} {Design} {Processes}}, url = {https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84924387161&origin=inward}, venue = {Dubrovnik}, year = {2014} } @article{faucris.123887104, author = {Pattinson, Dirk and Schröder, Lutz}, doi = {10.1016/j.jcss.2015.02.004}, faupublication = {yes}, journal = {Journal of Computer and System Sciences}, pages = {797--798}, peerreviewed = {Yes}, title = {{From} the {Editors}}, volume = {81}, year = {2015} } @inproceedings{faucris.106939184, author = {Wild, Paul and Schröder, Lutz}, booktitle = {Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017}, doi = {10.24963/ijcai.2017/181}, faupublication = {yes}, pages = {1304--1310}, peerreviewed = {Yes}, title = {{A} {Characterization} {Theorem} for a {Modal} {Description} {Logic}}, year = {2017} } @inproceedings{faucris.210162154, author = {Goncharov, Sergey and Rauch, Christoph and Schröder, Lutz}, booktitle = {Theoretical Aspects of Computing - ICTAC 2018 (LNCS 11187)}, doi = {10.1007/978-3-030-02508-3}, editor = {Bernd Fischer Tarmo Uustalu}, faupublication = {yes}, isbn = {978-3-030-02507-6}, pages = {191--210}, peerreviewed = {Yes}, publisher = {Springer International Publishing}, title = {{A} {Metalanguage} for {Guarded} {Iteration}}, venue = {Stellenbosch, South Africa}, year = {2018} } @article{faucris.210162625, abstract = {We study a model of side-effecting processes obtained by starting from a monad modelling base effects and adjoining free operations using a cofree coalgebra construction; one thus arrives at what one may think of as types of non-wellfounded side-effecting trees, generalizing the infinite resumption monad. Correspondingly, the arising monad transformer has been termed the coinductive generalized resumption transformer. Monads of this kind have received some attention in the recent literature; in particular, it has been shown that they admit guarded iteration. Here, we show that they also admit unguarded iteration, i.e. form complete Elgot monads, provided that the underlying base effect supports unguarded iteration. Moreover, we provide a universal characterization of the coinductive resumption monad transformer in terms of coproducts of complete Elgot monad}, author = {Goncharov, Sergey and Schröder, Lutz and Rauch, Christoph and Jakob, Julian}, doi = {10.23638/LMCS-14(3:10)2018}, faupublication = {yes}, journal = {Logical Methods in Computer Science}, keywords = {recursion; coalgebra; coinduction; complete Elgot monad; resumptions}, peerreviewed = {Yes}, title = {{Unguarded} {Recursion} on {Coinductive} {Resumptions}}, volume = {14}, year = {2018} } @book{faucris.123526524, address = {Berlin}, doi = {10.1007/978-3-642-32784-1}, editor = {Pattinson, Dirk and Schröder, Lutz}, faupublication = {yes}, isbn = {9783642327834}, keywords = {Coalgebra modal logic concurrency security automata}, note = {UnivIS-Import:2015-07-08:Pub.2012.tech.IMMD.profes_1.procee}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {{Proceedings} of the 11th {International} {Workshop} on {Coalgebraic} {Methods} in {Computer} {Science} ({CMCS} 2012)}, url = {http://link.springer.com/book/10.1007%2F978-3-642-32784-1}, volume = {7399}, year = {2012} } @inproceedings{faucris.118716224, abstract = {Simulations serve as a proof tool to compare the behaviour of reactive systems. We define a notion of Λ-simulation for coalgebraic modal logics, parametric in the choice of a set Λ of monotone predicate liftings for a functor T. That is, we obtain a generic notion of simulation that can be flexibly instantiated to a large variety of systems and logics, in particular in settings that semantically go beyond the classical relational setup, such as probabilistic, game-based, or neighbourhood-based systems. We show that this notion is adequate in several ways: i) Λ-simulations preserve truth of positive formulas, ii) for Λ a separating set of monotone predicate liftings, the associated notion of Λ-bisimulation corresponds to T-behavioural equivalence (moreover, this correspondence extends to the respective finite-lookahead counterparts), and iii) Λ-bisimulations remain sound when taken up to difunctional closure. In essence, we arrive at a modular notion of equivalence that, when used with a separating set of monotone predicate liftings, coincides with T-behavioural equivalence regardless of whether T preserves weak pullbacks. That is, for finitary set-based coalgebras, Λ-bisimulation works under strictly more general assumptions than T-bisimulation in the sense of Aczel and Mendler. © 2013 Springer-Verlag Berlin Heidelberg.}, address = {Berlin}, author = {Gorin, Daniel and Schröder, Lutz}, booktitle = {5th Conference on Algebra and Coalgebra in Computer Science, CALCO 2013}, date = {2013-09-03/2013-09-06}, doi = {10.1007/978-3-642-40206-7_19}, faupublication = {yes}, note = {UnivIS-Import:2015-04-16:Pub.2013.tech.IMMD.profes_1.simula}, pages = {253-266}, peerreviewed = {Yes}, publisher = {Springer-verlag}, title = {{Simulations} and {Bisimulations} {For} {Coalgebraic} {Modal} {Logics}}, url = {http://link.springer.com/chapter/10.1007%2F978-3-642-40206-7_19}, venue = {Warsaw}, volume = {8089}, year = {2013} } @article{faucris.122998524, author = {Schröder, Lutz and Litak, Tadeusz Michal and Pattinson, Dirk}, doi = {10.1093/logcom/exv043}, faupublication = {yes}, journal = {Journal of Logic and Computation}, keywords = {Correspondence theory; coalgebraic logic; modal characterization theorems;}, note = {UnivIS-Import:2016-06-01:Pub.2016.tech.IMMD.profes_1.avanbe}, pages = {-}, peerreviewed = {Yes}, title = {{A} van {Benthem}/{Rosen} {Theorem} for {Coalgebraic} {Predicate} {Logic}}, url = {http://www8.cs.fau.de/_media/research:papers:cpl-benthem-rosen.pdf}, year = {2015} } @inproceedings{faucris.121785224, abstract = {Among the standard stages of the engineering design process, the principle solution can be regarded as an analogue of the design specification, fixing the way the final product works. It is usually constructed as an abstract sketch where the functional parts of the product are identified, and geometric and topological constraints are formulated. Here, we outline a semantic approach where the principle solution is annotated with ontological assertions, thus making the intended requirements explicit and available for further machine processing; this includes the automated detection of design errors in the final CAD model, making additional use of a background ontology of engineering knowledg}, author = {Breitsprecher, Thilo and Codesci, Mihai and Jucovaschi, Constantin and Kohlhase, Michael and Schröder, Lutz and Wartzack, Sandro}, booktitle = {8th International Conference on Formal Ontology in Information Systems}, doi = {10.3233/978-1-61499-438-1-427}, faupublication = {yes}, keywords = {document-oriented processes; Knowledge-based engineering}, note = {UnivIS-Import:2015-04-16:Pub.2014.tech.FT.FT-KLMEFK.toward_5}, pages = {427-432}, peerreviewed = {Yes}, publisher = {IOS Press}, title = {{Towards} {Ontological} {Support} for {Principle} {Solutions} in {Mechanical} {Engineering}}, venue = {Rio de Janeiro}, year = {2014} } @inproceedings{faucris.115809144, abstract = {Models of concurrent systems employ a wide variety of semantics

inducing various notions of process equivalence, ranging from

linear-time semantics such as trace equivalence to branching-time

semantics such as strong bisimilarity. Many of these generalize to

system types beyond standard transition systems, featuring, for

example, weighted, probabilistic, or game-based transitions; this

motivates the search for suitable coalgebraic abstractions of

process equivalence that cover these orthogonal dimensions of

generality, i.e.~are generic both in the system type and in the

notion of system equivalence. In recent joint work with Kurz, we

have proposed a parametrization of system equivalence over an

embedding of the coalgebraic type functor into a monad. In the

present paper, we refine this abstraction to use graded

monads, which come with a notion of depth that corresponds, e.g.,

to trace length or bisimulation depth. We introduce a notion of

graded algebras and show how they play the role of formulas in trace

logics.

}, address = {Dagstuhl}, author = {Milius, Stefan and Pattinson, Dirk and Schröder, Lutz}, booktitle = {6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015}, date = {2015-06-24/2015-06-26}, doi = {10.4230/LIPIcs.CALCO.2015.253}, faupublication = {yes}, keywords = {Graded monad; traces; concurrent systems; bisimilarity; graded algebra; trace logic;}, pages = {253--269}, peerreviewed = {Yes}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Generic} {Trace} {Semantics} and {Graded} {Monads}}, venue = {Nijmegen}, year = {2015} } @inproceedings{faucris.106397764, author = {Dorsch, Ulrich and Milius, Stefan and Schröder, Lutz and Wißmann, Thorsten}, booktitle = {Proc. 28th International Conference on Concurrency Theory (CONCUR 2017)}, editor = {Meyer R, Nestmann U}, faupublication = {yes}, pages = {28:1--28:16}, peerreviewed = {Yes}, publisher = {Schloss Dagstuhl}, title = {{Efficient} {Coalgebraic} {Partition} {Refinement}}, volume = {85}, year = {2017} } @article{faucris.203762658, abstract = {We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and completeness results for several natural classes of such logics. Moreover, we show that an entirely general completeness result is not possible. We study the expressive power of our language, both in comparison with coalgebraic hybrid logics and with existing first-order proposals for special classes of Set-coalgebras (apart from relational structures, also neighbourhood frames and topological spaces). Basic model-theoretic constructions and results, in particular ultraproducts, obtain for the two classes that allow completeness-and in some cases beyond that. Finally, we discuss a basic sequent system, for which we establish a syntactic cut-elimination result.}, author = {Litak, Tadeusz Michal and Pattinson, Dirk and Sano, Katsuhiko and Schröder, Lutz}, doi = {10.23638/LMCS-14(1:22)2018}, faupublication = {yes}, journal = {Logical Methods in Computer Science}, keywords = {coalgebraic predicate logic;coalgebraic model theory;coalgebraic proof theory}, month = {Jan}, peerreviewed = {Yes}, title = {{Model} {Theory} and {Proof} {Theory} of {Coalgebraic} {Predicate} {Logic}}, volume = {14}, year = {2018} } @inproceedings{faucris.106939624, author = {Deifel, Hans-Peter and Göttlinger, Merlin and Milius, Stefan and Schröder, Lutz and Dietrich, Christian and Lohmann, Daniel}, booktitle = {2017 Formal Methods in Computer Aided Design, FMCAD 2017, Vienna, Austria, October 2-6, 2017}, doi = {10.23919/FMCAD.2017.8102260}, faupublication = {yes}, pages = {196--203}, peerreviewed = {Yes}, publisher = {IEEE}, title = {{Automatic} verification of application-tailored {OSEK} kernels}, year = {2017} } @inproceedings{faucris.106939404, author = {Gorin, Daniel and Meyn, Malte and Naumann, Alexander and Polzer, Miriam and Rabenstein, Ulrich and Schröder, Lutz}, booktitle = {KI 2017: Advances in Artificial Intelligence - 40th Annual German Conference on AI, Dortmund, Germany, September 25-29, 2017, Proceedings}, doi = {10.1007/978-3-319-67190-1_24}, faupublication = {yes}, pages = {300--308}, peerreviewed = {Yes}, title = {{Ontological} {Modelling} of a {Psychiatric} {Clinical} {Practice} {Guideline}}, year = {2017} } @inproceedings{faucris.107669584, abstract = {Branching-time temporal logics generalizing relational temporal logics such as CTL have been proposed for various system types beyond the purely relational world. This includes, e.g., alternating-time logics, which talk about winning strategies over concurrent game structures, and Parikh’s game logic, which is interpreted over monotone neighbourhood frames, as well as probabilistic fixpoint logics. Coalgebraic logic has emerged as a unifying semantic and algorithmic framework for logics featuring generalized modalities of this type. Here, we present a generic global caching algorithm for satisfiability checking in the flat coalgebraic mu-calculus, which realizes known tight exponential-time upper complexity bounds but offers potential for heuristic optimization. It is based on a tableau system that makes do without additional labelling of nodes beyond formulas from the standard Fischer-Ladner closure, such as foci or termination counters for eventualities. Moreover, the tableau system is singlepass, i.e. avoids building an exponential-sized structure in a first pass; to our best knowledge, optimal single-pass systems without numeric time-outs were not previously available even for CTL.}, address = {Berlin}, author = {Hausmann, Daniel and Schröder, Lutz}, booktitle = {Proceedings, 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015}, date = {2015-09-23/2015-09-25}, doi = {10.1109/TIME.2015.15}, editor = {Grandi F, Lange M, Lomuscio A}, faupublication = {yes}, isbn = {978-1-4673-9317-1}, keywords = {Fixpoint logic; coalgebraic logic; global caching; fixpoint logic}, pages = {121-130}, peerreviewed = {Yes}, publisher = {Springer}, title = {{Global} {Caching} for the {Flat} {Coalgebraic} μ-{Calculus}}, venue = {Kassel}, year = {2015} } @inproceedings{faucris.118582684, abstract = {Modal languages are well-known for their robust decidability and relatively low complexity. However, as soon as one adds a self-referencing construct, like hybrid logic's down-arrow binder, to the basic modal language, decidability is lost, even if one restricts binding to a single variable. Here, we concentrate on the latter case and investigate the logics obtained by restricting the nesting depth of modalities between binding and use. In particular, for distances strictly below 3 we obtain well-behaved logics with a relatively high descriptive power. We investigate the fragment with distance 1 in the framework of coalgebraic modal logic, for which we provide very general decidability and complexity results. For the fragment with distance 2 we focus on the case of Kripke semantics and obtain optimum complexity bounds (no harder than the base logic). We show that this fragment is expressive enough to accommodate the guarded fragment over the correspondence language. © 2012 Springer-Verlag Berlin Heidelberg.}, address = {Berlin}, author = {Gorin, Daniel and Schröder, Lutz}, booktitle = {Foundations of Software Science and Computational Structures Foundations of Software Science and Computational Structures}, date = {2012-03-24/2012-04-01}, doi = {10.1007/978-3-642-28729-9_16}, faupublication = {yes}, isbn = {978-3-642-28728-2}, note = {UnivIS-Import:2015-04-16:Pub.2012.tech.IMMD.profes_1.narcis}, pages = {240-254}, peerreviewed = {Yes}, publisher = {Springer-verlag}, series = {Lecture Notes in Computer Science}, title = {{Narcissists} {Are} {Easy}, {Stepmothers} {Are} {Hard}}, venue = {Tallinn}, volume = {7213}, year = {2012} } @inproceedings{faucris.118716444, abstract = {Fuzzy description logics (DLs) serve as a tool to handle vagueness in real-world knowledge. There is particular interest in logics implementing Łukasiewicz semantics, which has a number of favourable properties. Current decision procedures for Łukasiewicz fuzzy DLs work by reduction to exponentially large mixed integer programming problems. Here, we present a decision method that stays closer to logical syntax, a labelled tableau algorithm for Łukasiewicz Fuzzy ALC that calls only on (pure) linear programming, and this only to decide atomic clashes. The algorithm realizes the best known complexity bound, NEXPTIME. Our language features a novel style of fuzzy ABoxes that work with comparisons of truth degrees rather than explicit numerical bounds.}, address = {Palo Alto}, author = {Kulacka, Agnieszka and Pattinson, Dirk and Schröder, Lutz}, booktitle = {Proc. 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013}, date = {2013-08-03/2013-08-09}, faupublication = {yes}, keywords = {Fuzzy description logics; tableaux; completeness; complexity}, note = {UnivIS-Import:2015-04-16:Pub.2013.tech.IMMD.profes_1.syntac}, pages = {962-969}, peerreviewed = {Yes}, publisher = {IJCAI/AAAI}, title = {{Syntactic} {Labelled} {Tableaux} for {Lukasiewicz} {Fuzzy} {ALC}}, venue = {Beijing}, year = {2013} } @article{faucris.107508984, author = {Gutierreiz-Basulto, Victor and Jung, Jean Christoph and Lutz, Carsten and Schröder, Lutz}, doi = {10.1613/jair.5222}, faupublication = {yes}, journal = {Journal of Artificial Intelligence Research}, keywords = {Description logics; automated reasoning; subjective probability}, month = {Jan}, pages = {1--66}, peerreviewed = {Yes}, title = {{Probabilistic} {Description} {Logics} for {Subjective} {Uncertainty}}, volume = {58}, year = {2017} } @inproceedings{faucris.118714024, abstract = {Monads are the basis of a well-established method of encapsulating side-effects in semantics and programming. There have been a number of proposals for monadic program logics in the setting of plain monads, while much of the recent work on monadic semantics is concerned with monads on enriched categories, in particular in domain-theoretic settings, which allow for recursive monadic programs. Here, we lay out a definition of order-enriched monad which imposes cpo structure on the monad itself rather than on base category. Starting from the observation that order-enrichment of a monad induces a weak truth-value object, we develop a generic Hoare calculus for monadic side-effecting programs. For this calculus, we prove relative completeness via a calculus of weakest preconditions, which we also relate to strongest post conditions. © 2013 IEEE.}, address = {Los Alamitos}, author = {Goncharov, Sergey and Schröder, Lutz}, booktitle = {Proc. 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013}, date = {2013-06-25/2013-06-28}, doi = {10.1109/LICS.2013.33}, faupublication = {yes}, isbn = {978-1-4799-0413-6}, keywords = {computational effects; Hoare logic; monads; strongest postconditions; weakest preconditions}, note = {UnivIS-Import:2015-04-16:Pub.2013.tech.IMMD.profes_1.arelat}, pages = {273-282}, peerreviewed = {Yes}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{A} {Relatively} {Complete} {Generic} {Hoare} {Logic} for {Order}-{Enriched} {Effects}}, venue = {New Orleans, LA}, year = {2013} } @article{faucris.107510524, author = {Schröder, Lutz and Mossakowski, Till}, faupublication = {yes}, journal = {International Journal of Software and Informatics}, keywords = {Inconsistency; Unsatisfiability}, pages = {141--152}, peerreviewed = {Yes}, title = {{On} {Inconsistency} and {Unsatisfiability}}, url = {http://www.ijsi.org/ch/reader/view_abstract.aspx?file_no=i212}, volume = {9}, year = {2015} } @article{faucris.106353324, author = {Mossakowski, Till and Roggenbach, Markus and Schröder, Lutz}, faupublication = {yes}, journal = {Electronic Communications of the EASST}, peerreviewed = {unknown}, title = {{Preface}}, url = {http://journal.ub.tu-berlin.de/eceasst/article/view/874/860}, volume = {62}, year = {2013} } @inproceedings{faucris.107509644, address = {Dagstuhl}, author = {Hausmann, Daniel and Schröder, Lutz and Egger, Christoph}, booktitle = {27th International Conference on Concurrency Theory, CONCUR 2016, August 23-26, 2016, Québec City, Canada}, date = {2016-08-23/2016-08-26}, doi = {10.4230/LIPIcs.CONCUR.2016.34}, editor = {Josée Desharnais, Radha Jagadeesan}, faupublication = {yes}, isbn = {978-3-95977-017-0}, keywords = {Fixpoint logics; temporal logics; automated reasoning; coalgebraic logic; mu-calculus}, pages = {34:1--34:15}, peerreviewed = {Yes}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, series = {LIPIcs}, title = {{Global} {Caching} for the {Alternation}-free mu-{Calculus}}, url = {http://www.dagstuhl.de/dagpub/978-3-95977-017-0}, venue = {Québec City}, volume = {59}, year = {2016} } @inproceedings{faucris.106938964, author = {Seifan, Fatemeh and Schröder, Lutz and Pattinson, Dirk}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science, CALCO 2017, June 12-16, 2017, Ljubljana, Slovenia}, doi = {10.4230/LIPIcs.CALCO.2017.21}, faupublication = {yes}, pages = {21:1--21:16}, peerreviewed = {Yes}, title = {{Uniform} {Interpolation} in {Coalgebraic} {Modal} {Logic}}, year = {2017} } @inproceedings{faucris.203763967, author = {Goncharov, Sergey and Schröder, Lutz}, booktitle = {21st International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2018 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018}, doi = {10.1007/978-3-319-89366-2_17}, faupublication = {yes}, isbn = {9783319893655}, pages = {313-330}, peerreviewed = {Yes}, publisher = {Springer Verlag}, series = {Lecture Notes in Computer Science}, title = {{Guarded} {Traced} {Categories}}, year = {2018} } @article{faucris.218988047, abstract = {We investigate an approach to improving statistical text classification by combining machine learners with an ontology-based identification of domain-specific topic categories. We apply this approach to ad hoc disclosures by public companies. This form of obligatory publicity concerns all information that might affect the stock price; relevant topic categories are governed by stringent regulations. Our goal is to classify disclosures according to their effect on stock prices (negative, neutral, positive). In the study reported here, we combine natural language parsing with a formal background ontology to recognize disclosures concerning particular topics from a prescribed list. The semantic analysis identifies some of these topics with reasonable accuracy. We then demonstrate that machine learners benefit from the additional ontology-based information when predicting the cumulative abnormal return attributed to the disclosure at hand.}, author = {Evert, Stefan and Heinrich, Philipp and Henselmann, Klaus and Rabenstein, Ulrich and Scherr, Elisabeth and Schmitt, Martin and Schröder, Lutz}, doi = {10.1007/s10849-019-09283-6}, faupublication = {yes}, journal = {Journal of Logic, Language and Information}, keywords = {Corporate disclosures; Machine learning; NLP; Ontology}, note = {CRIS-Team Scopus Importer:2019-05-28}, peerreviewed = {unknown}, title = {{Combining} {Machine} {Learning} and {Semantic} {Features} in the {Classification} of {Corporate} {Disclosures}}, year = {2019} } @article{faucris.113624324, abstract = {Common estimation algorithms, such as least squares estimation or the Kalman filter, operate on a state in a state space S that is represented as a real-valued vector. However, for many quantities, most notably orientations in 3D, S is not a vector space, but a so-called manifold, i.e. it behaves like a vector space locally but has a more complex global topological structure. For integrating these quantities, several ad hoc approaches have been proposed. Here, we present a principled solution to this problem where the structure of the manifold S is encapsulated by two operators, state displacement: S×