The resolution-based grounded semantics constitutes one of the most interesting approaches for the evaluation of abstract argumentation frameworks. This particular semantics satisfies a large number of desired properties, among them all properties proposed by Baroni and Giacomin. In recent years, the analysis of argumentation semantics has been extended by further topics, among them characteriz...

Although the traditional entity relationship approach is still the most widely applied technique for modeling database applications, object-oriented approaches and fact-oriented approaches are being increasingly used for data modeling in general. The most popular exemplars of the latter two approaches are respectively the Unified Modeling Language (UML) and Object-Role Modeling (ORM). An initia...

We show how to improve one of the constructors of separation algebras to increase modularity and expressibility. Our technique has advantages for both paper and mechanized proofs. Our results are implemented in Coq.

The parametric expressibility of functions is a generalization of the expressibility via composition. All parametrically closed classes of functions (p-clones) form a lattice. For finite domains the lattice is shown to be finite, however straight-forward iteration over all functions is infeasible, and so far the p-indecomposable functions are only known for domains with two and three elements. ...

We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite λ-terms that are λletrec-expressible in the sense that they arise as infinite unfoldings of terms in λletrec, the λ-calculus with letrec. We provide two characterizations, using concepts we introduce for infinite λ-terms: regularity, strong regularity, ...

We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite λ-terms that are λletrec-expressible in the sense that they arise as infinite unfoldings of terms in λletrec, the λ-calculus with letrec. We provide two characterizations, using concepts we introduce for infinite λ-terms: regularity, strong regularity, ...

Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class NP . Moreover, we do this in a uniform way as defined in (MT99). Specifically, we show that there is a single DATALOG¬ program PTrg such that given any Turing machine M , any polynomial p with non-negative integer coeffi...

SPARQL, a query language for RDF graphs, is one of the key technologies for the Semantic Web. The expressivity and complexity of various fragments of SPARQL have been studied extensively. It is usually assumed that the optional matching operator OPTIONAL has only two graph patterns as arguments. The specification of SPARQL, however, defines it as a ternary operator, with an additional filter co...

Fault-tolerant quantum computers offer the promise of dramatically improving machine learning through speed-ups in computation or improved model scalability. In near-term, however, benefits are not so clear. Understanding expressibility and trainability models-and neural networks particular-requires further investigation. this work, we use tools from information geometry to define a notion for ...