Searcharxiv⌕ Search

arXiv subjects

Thomas Eiter

Publications and source records attributed to Thomas Eiter.

At least 55 records · Page 3Linked to original sources
arXiv2021

Reasoning on $\textit{DL-Lite}_{\cal R}$ with Defeasibility in ASP

Reasoning on defeasible knowledge is a topic of interest in the area of description logics, as it is related to the need of representing exceptional instances in knowledge bases. In this direction, in our previous works we presented a framework for representing (contextualized) OWL RL knowledge bases with a notion of justified exceptions on defeasible axioms: reasoning in such framework is realized by a translation into ASP programs. The resulting reasoning process for OWL RL, however, introduces a complex encoding in order to capture reasoning on the negative information needed for reasoning on exceptions. In this paper, we apply the justified exception approach to knowledge bases in $\textit{DL-Lite}_{\cal R}$, i.e., the language underlying OWL QL. We provide a definition for $\textit{DL-Lite}_{\cal R}$ knowledge bases with defeasible axioms and study their semantic and computational properties. In particular, we study the effects of exceptions over unnamed individuals. The limited form of $\textit{DL-Lite}_{\cal R}$ axioms allows us to formulate a simpler ASP encoding, where reasoning on negative information is managed by direct rules. The resulting materialization method gives rise to a complete reasoning procedure for instance checking in $\textit{DL-Lite}_{\cal R}$ with defeasible axioms. Under consideration in Theory and Practice of Logic Programming (TPLP).

cs.AI↗
arXiv2020

Spatial decay of the vorticity field of time-periodic viscous flow past a body

We study the asymptotic spatial behavior of the vorticity field, $ω(x,t)$, associated to a time-periodic Navier-Stokes flow past a body, $\mathscr B$, in the class of weak solutions satisfying a Serrin-like condition. We show that, outside the wake region, $\mathcal R$, $ω$ decays pointwise at an exponential rate, uniformly in time. Moreover, denoting by $\barω$ its time-average over a period and by $ω_P:=ω-\barω$ its purely periodic component, we prove that inside $\mathcal R$, $\barω$ has the same algebraic decay as that known for the associated steady-state problem, whereas $ω_P$ decays even faster, uniformly in time. This implies, in particular, that "sufficiently far" from $\mathscr B$, $ω(x,t)$ behaves like the vorticity field of the corresponding steady-state problem.

math.AP↗
arXiv2020

Constraint Monotonicity, Epistemic Splitting and Foundedness Could in General Be Too Strong in Answer Set Programming

Recently, the notions of subjective constraint monotonicity, epistemic splitting, and foundedness have been introduced for epistemic logic programs, with the aim to use them as main criteria respectively intuitions to compare different answer set semantics proposed in the literature on how they comply with these intuitions. In this note, we consider these three notions and demonstrate on some examples that they may be too strong in general and may exclude some desired answer sets respectively world views. In conclusion, these properties should not be regarded as mandatory properties that every answer set semantics must satisfy in general.

cs.AI↗
arXiv2020

ASP(AC): Answer Set Programming with Algebraic Constraints

Weighted Logic is a powerful tool for the specification of calculations over semirings that depend on qualitative information. Using a novel combination of Weighted Logic and Here-and-There (HT) Logic, in which this dependence is based on intuitionistic grounds, we introduce Answer Set Programming with Algebraic Constraints (ASP(AC)), where rules may contain constraints that compare semiring values to weighted formula evaluations. Such constraints provide streamlined access to a manifold of constructs available in ASP, like aggregates, choice constraints, and arithmetic operators. They extend some of them and provide a generic framework for defining programs with algebraic computation, which can be fruitfully used e.g. for provenance semantics of datalog programs. While undecidable in general, expressive fragments of ASP(AC) can be exploited for effective problem-solving in a rich framework. This work is under consideration for acceptance in Theory and Practice of Logic Programming.

cs.AI↗
arXiv2020

Managing caching strategies for stream reasoning with reinforcement learning

Efficient decision-making over continuously changing data is essential for many application domains such as cyber-physical systems, industry digitalization, etc. Modern stream reasoning frameworks allow one to model and solve various real-world problems using incremental and continuous evaluation of programs as new data arrives in the stream. Applied techniques use, e.g., Datalog-like materialization or truth maintenance algorithms to avoid costly re-computations, thus ensuring low latency and high throughput of a stream reasoner. However, the expressiveness of existing approaches is quite limited and, e.g., they cannot be used to encode problems with constraints, which often appear in practice. In this paper, we suggest a novel approach that uses the Conflict-Driven Constraint Learning (CDCL) to efficiently update legacy solutions by using intelligent management of learned constraints. In particular, we study the applicability of reinforcement learning to continuously assess the utility of learned constraints computed in previous invocations of the solving algorithm for the current one. Evaluations conducted on real-world reconfiguration problems show that providing a CDCL algorithm with relevant learned constraints from previous iterations results in significant performance improvements of the algorithm in stream reasoning scenarios. Under consideration for acceptance in TPLP.

cs.AI↗
arXiv2020

On the spatially asymptotic structure of time-periodic solutions to the Navier-Stokes equations

The asymptotic behavior of weak time-periodic solutions to the Navier-Stokes equations with a drift term in the three-dimensional whole space is investigated. The velocity field is decomposed into a time-independent and a remaining part, and separate asymptotic expansions are derived for both parts and their gradients. One observes that the behavior at spatial infinity is determined by the corresponding Oseen fundamental solutions.

math.AP↗
arXiv2020

Omission-based Abstraction for Answer Set Programs

Abstraction is a well-known approach to simplify a complex problem by over-approximating it with a deliberate loss of information. It was not considered so far in Answer Set Programming (ASP), a convenient tool for problem solving. We introduce a method to automatically abstract ASP programs that preserves their structure by reducing the vocabulary while ensuring an over-approximation (i.e., each original answer set maps to some abstract answer set). This allows for generating partial answer set candidates that can help with approximation of reasoning. Computing the abstract answer sets is intuitively easier due to a smaller search space, at the cost of encountering spurious answer sets. Faithful (non-spurious) abstractions may be used to represent projected answer sets and to guide solvers in answer set construction. For dealing with spurious answer sets, we employ an ASP debugging approach to help with abstraction refinement, which determines atoms as badly omitted and adds them back in the abstraction. As a show case, we apply abstraction to explain unsatisfiability of ASP programs in terms of blocker sets, which are the sets of atoms such that abstraction to them preserves unsatisfiability. Their usefulness is demonstrated by experimental results.

cs.LO↗
arXiv2019

Falling drop in an unbounded liquid reservoir: Steady-state solutions

The equations governing the motion of a three-dimensional liquid drop moving freely in an unbounded liquid reservoir under the influence of a gravitational force are investigated. Provided the (constant) densities in the two liquids are sufficiently close, existence of a steady-state solution is shown. The proof is based on a suitable linearization of the equations. A setting of function spaces is introduced in which the corresponding linear operator acts as a homeomorphism.

math.AP↗
arXiv2019

Viscous flow around a rigid body performing a time-periodic motion

The equations governing the flow of a viscous incompressible fluid around a rigid body that performs a prescribed time-periodic motion with constant axes of translation and rotation are investigated. Under the assumption that the period and the angular velocity of the prescribed rigid-body motion are compatible, and that the mean translational velocity is non-zero, existence of a time-periodic solution is established. The proof is based on an appropriate linearization, which is examined within a setting of absolutely convergent Fourier series. Since the corresponding resolvent problem is ill-posed in classical Sobolev spaces, a linear theory is developed in a framework of homogeneous Sobolev spaces.

math.AP↗
arXiv2019

New results for the Oseen problem with applications to the Navier-Stokes equations in exterior domains

We prove new existence and uniqueness results in full Sobolev spaces for the steady-state Oseen problem in a smooth exterior domain of $\mathbb{R}^n$, $n\ge 2$. These results are then employed, on the one hand, in the study of analogous properties for the corresponding (linear) time-periodic case and, on the other hand and more significantly, to prove analogous properties for their nonlinear counterpart, at least for small data.

math.AP↗
arXiv2019

On periodic solutions for one-phase and two-phase problems of the Navier-Stokes equations

This paper is devoted to proving the existence of time-periodic solutions of one-phase or two-phase problems for the Navier-Stokes equations with small periodic external forces when the reference domain is close to a ball. Since our problems are formulated in time-dependent unknown domains, the problems are reduced to quasiliner systems of parabolic equations with non-homogeneous boundary conditions or transmission conditions in fixed domains by using the so-called Hanzawa transform. We separate solutions into the stationary part and the oscillatory part. The linearized equations for the stationary part have eigen-value $0$, which is avoided by changing the equations with the help of the necessary conditions for the existence of solutions to the original problems. To treat the oscillatory part, we establish the maximal $L_p$-$L_q$ regularity theorem of the periodic solutions for the system of parabolic equations with non-homogeneous boundary conditions or transmission conditions, which is obtained by the systematic use of $\mathcal{R}$-solvers to the resolvent problem for the linearized equations and the transference theorem for the $L_p$ boundedness of operator-valued Fourier multipliers. These approaches are the novelty of this paper.

math.AP↗
arXiv2019

Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems

Humans are capable of abstracting away irrelevant details when studying problems. This is especially noticeable for problems over grid-cells, as humans are able to disregard certain parts of the grid and focus on the key elements important for the problem. Recently, the notion of abstraction has been introduced for Answer Set Programming (ASP), a knowledge representation and reasoning paradigm widely used in problem solving, with the potential to understand the key elements of a program that play a role in finding a solution. The present paper takes this further and empowers abstraction to deal with structural aspects, and in particular with hierarchical abstraction over the domain. We focus on obtaining the reasons for unsolvability of problems on grids, and show the possibility to automatically achieve human-like abstractions that distinguish only the relevant part of the grid. A user study on abstract explanations confirms the similarity of the focus points in machine vs. human explanations and reaffirms the challenge of employing abstraction to obtain machine explanations.

cs.AI↗
arXiv2019

A Distributed Approach to LARS Stream Reasoning (System paper)

Stream reasoning systems are designed for complex decision-making from possibly infinite, dynamic streams of data. Modern approaches to stream reasoning are usually performing their computations using stand-alone solvers, which incrementally update their internal state and return results as the new portions of data streams are pushed. However, the performance of such approaches degrades quickly as the rates of the input data and the complexity of decision problems are growing. This problem was already recognized in the area of stream processing, where systems became distributed in order to allocate vast computing resources provided by clouds. In this paper we propose a distributed approach to stream reasoning that can efficiently split computations among different solvers communicating their results over data streams. Moreover, in order to increase the throughput of the distributed system, we suggest an interval-based semantics for the LARS language, which enables significant reductions of network traffic. Performed evaluations indicate that the distributed stream reasoning significantly outperforms existing stand-alone LARS solvers when the complexity of decision problems and the rate of incoming data are increasing. Under consideration for acceptance in Theory and Practice of Logic Programming.

cs.AI↗
arXiv2019

A Note on Reasoning on $\textit{DL-Lite}_{\cal R}$ with Defeasibility

Representation of defeasible information is of interest in description logics, as it is related to the need of accommodating exceptional instances in knowledge bases. In this direction, in our previous works we presented a datalog translation for reasoning on (contextualized) OWL RL knowledge bases with a notion of justified exceptions on defeasible axioms. While it covers a relevant fragment of OWL, the resulting reasoning process needs a complex encoding in order to capture reasoning on negative information. In this paper, we consider the case of knowledge bases in $\textit{DL-Lite}_{\cal R}$, i.e. the language underlying OWL QL. We provide a definition for $\textit{DL-Lite}_{\cal R}$ knowledge bases with defeasible axioms and study their properties. The limited form of $\textit{DL-Lite}_{\cal R}$ axioms allows us to formulate a simpler encoding into datalog (under answer set semantics) with direct rules for reasoning on negative information. The resulting materialization method gives rise to a complete reasoning procedure for instance checking in $\textit{DL-Lite}_{\cal R}$ with defeasible axioms.

cs.LO↗
arXiv2018

Towards Abstraction in ASP with an Application on Reasoning about Agent Policies

ASP programs are a convenient tool for problem solving, whereas with large problem instances the size of the state space can be prohibitive. We consider abstraction as a means of over-approximation and introduce a method to automatically abstract (possibly non-ground) ASP programs that preserves their structure, while reducing the size of the problem. One particular application case is the problem of defining declarative policies for reactive agents and reasoning about them, which we illustrate on examples.

cs.LO↗
arXiv2018

Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning

Meta-Interpretive Learning (MIL) learns logic programs from examples by instantiating meta-rules, which is implemented by the Metagol system based on Prolog. Viewing MIL-problems as combinatorial search problems, they can alternatively be solved by employing Answer Set Programming (ASP), which may result in performance gains as a result of efficient conflict propagation. However, a straightforward ASP-encoding of MIL results in a huge search space due to a lack of procedural bias and the need for grounding. To address these challenging issues, we encode MIL in the HEX-formalism, which is an extension of ASP that allows us to outsource the background knowledge, and we restrict the search space to compensate for a procedural bias in ASP. This way, the import of constants from the background knowledge can for a given type of meta-rules be limited to relevant ones. Moreover, by abstracting from term manipulations in the encoding and by exploiting the HEX interface mechanism, the import of such constants can be entirely avoided in order to mitigate the grounding bottleneck. An experimental evaluation shows promising results.

cs.LO↗
arXiv2017

Ticker: A System for Incremental ASP-based Stream Reasoning

In complex reasoning tasks, as expressible by Answer Set Programming (ASP), problems often permit for multiple solutions. In dynamic environments, where knowledge is continuously changing, the question arises how a given model can be incrementally adjusted relative to new and outdated information. This paper introduces Ticker, a prototypical engine for well-defined logical reasoning over streaming data. Ticker builds on a practical fragment of the recent rule-based language LARS which extends Answer Set Programming for streams by providing flexible expiration control and temporal modalities. We discuss Ticker's reasoning strategies: First, the repeated one-shot solving mode calls Clingo on an ASP encoding. We show how this translation can be incrementally updated when new data is streaming in or time passes by. Based on this, we build on Doyle's classic justification-based truth maintenance system (TMS) to update models of non-stratified programs. Finally, we empirically compare the obtained evaluation mechanisms. This paper is under consideration for acceptance in TPLP.

cs.LO↗