32,438 research outputs found

    Reasoning with Justifiable Exceptions in Contextual Hierarchies (Appendix)

    No full text
    This paper is an appendix to the paper "Reasoning with Justifiable Exceptions in Contextual Hierarchies" by Bozzato, Serafini and Eiter, 2018. It provides further details on the language, the complexity results and the datalog translation introduced in the main paper

    Existence and Spatial Decay of Periodic Navier-Stokes Flows in Exterior Domains

    Get PDF
    A classical problem in the field of mathematical fluid mechanics is the flow of a viscous incompressible fluid past a rigid body. In his doctoral thesis, Thomas Walter Eiter investigates time-periodic solutions to the associated Navier--Stokes equations when the body performs a non-trivial translation. The first part of the thesis is concerned with the question of existence of time-periodic solutions in the case of a non-rotating and of a rotating obstacle. Based on an investigation of the corresponding Oseen linearizations, new existence results in suitable function spaces are established. The second part deals with the study of spatially asymptotic properties of time-periodic solutions. For this purpose, time-periodic fundamental solutions to the Stokes and Oseen linearizations are introduced and investigated, and the concept of a time-periodic fundamental solution for the vorticity field is developed. With these results, new pointwise estimates of the velocity and the vorticity field associated to a time-periodic fluid flow are derived

    Default Logic as a Query Language

    No full text
    Research in nonmonotonic reasoning has focused largely on the idea of representing knowledge about the world via rules that are generally true but can be defeated. Even if relational databases are nowadays the main tool for storing very large sets of data, the approach of using nonmonotonic Al formalisms as relational database query languages has been investigated to a much smaller extent. In this work, we propose a novel application of Reiter's default logic by introducing a default query language (DQL) for finite relational databases, which is based on default rules. The main result of this paper is that DQL is as expressive as SO There Exists For All, the existential-universal fragment of second-order logic. This result is not only of theoretical importance: We exhibit queries-which are useful in practice--that can be expressed with DQL and cannot with other query languages based on nonmonotonic logics such as DATALOG with negation under the stable model semantics. In particular, we show that DQL is well-suited for diagnostic reasoning

    Thomas Grisell letter to Thomas Rotch, 2nd mo 19th 1823

    No full text
    Thomas Grisell's letter reached the Rotch household several months before the unexpected death of Thomas Rotch in August, 1823. This is the last letter of the series and presumably the author learned of his friend's death before another letter was penned. 7.95" x 10" (20.2 by 25.5 cm

    Foundations of Composite Event Recognition (Dagstuhl Seminar 20071)

    No full text
    Composite Event Recognition (CER) refers to the activity of detecting patterns in streams of continuously arriving "event" data over, possibly geographically, distributed sources. CER is key in Big Data applications that require the processing of such event streams to obtain timely insights and to implement reactive and proactive measures. Examples include the recognition of emerging stories and trends on the Social Web, traffic and transport incidents in smart cities, and epidemic spread. Numerous CER languages have been proposed in the literature. While these systems have a common goal, they differ in their data models, pattern languages and processing mechanisms, resulting in heterogeneous implementations with fundamentally different capabilities. Moreover, we lack a common understanding of the trade-offs between expressiveness and complexity, and a theory for comparing the fundamental capabilities of CER systems. As such, CER frameworks are difficult to understand, extend and generalise. It is unclear which of the proposed approaches better meets the requirements of a given application. Furthermore, the lack of foundations makes it hard to leverage established results - from automata theory, temporal logics, etc - thus hindering scientific and technological progress in CER. The objective of the seminar was to bring together researchers and practitioners working in Databases, Distributed Systems, Automata Theory, Logic and Stream Reasoning; disseminate the recent foundational results across these fields; establish new research collaborations among these fields; thereby start making progress towards formulating such foundations

    04171 Abstracts Collection – Logic Based Information Agents

    Get PDF
    From 18.04.04 to 23.04.04, the Dagstuhl Seminar 04171 ``Logic Based Information Agents'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available
    corecore