classical setting
Recently Published Documents


TOTAL DOCUMENTS

75
(FIVE YEARS 37)

H-INDEX

9
(FIVE YEARS 3)

Author(s):  
KYLIAN VAN DESSEL ◽  
JO DEVRIENDT ◽  
JOOST VENNEKENS

Abstract Technological progress in Answer Set Programming (ASP) has been stimulated by the use of common standards, such as the ASP-Core-2 language. While ASP has its roots in nonmonotonic reasoning, efforts have also been made to reconcile ASP with classical first-order (FO) logic. This has resulted in the development of FO(·), an expressive extension of FO, which allows ASP-like problem solving in a purely classical setting. This language may be more accessible to domain experts already familiar with FO and may be easier to combine with other formalisms that are based on classical logic. It is supported by the IDP inference system, which has successfully competed in a number of ASP competitions. Here, however, technological progress has been hampered by the limited number of systems that are available for FO(·). In this paper, we aim to address this gap by means of a translation tool that transforms an FO(·) specification into ASP-Core-2, thereby allowing ASP-Core-2 solvers to be used as solvers for FO(·) as well. We present experimental results to show that the resulting combination of our translation with an off-the-shelf ASP solver is competitive with the IDP system as a way of solving problems formulated in FO(·).


Author(s):  
Songsong Dai

In this paper, we give a definition for quantum information distance. In the classical setting, information distance between two classical strings is developed based on classical Kolmogorov complexity. It is defined as the length of a shortest transition program between these two strings in a universal Turing machine. We define the quantum information distance based on Berthiaume et al.’s quantum Kolmogorov complexity. The quantum information distance between qubit strings is defined as the length of the shortest quantum transition program between these two qubit strings in a universal quantum Turing machine. We show that our definition of quantum information distance is invariant under the choice of the underlying quantum Turing machine.


2021 ◽  
pp. 7-24
Author(s):  
Ethel Junco ◽  
Olivia Cáttedra

A partir de dos tragedias de Eurípides, revisamos la figura de madre mítica en función de paradigma cultural en orden a establecer relaciones históricas. Vinculamos la perspectiva del helenismo del siglo IV y los fenómenos contemporáneos sobre tres claves: el distanciamiento de lo divino y su intento de resignificación a través de una ética horizontal, la generalización de la violencia como estadio de convivencia normalizado, la necesidad de referentes a nivel individual y social. En los textos elegidos, el motivo del destino enfocado desde las consecuencias de la guerra desarrolla tipos contrastantes de heroicidad; entre ellos, Hécuba, la reina madre convertida en viuda y testigo del fin de su descendencia, hace la propuesta distintiva, por medio de la renovación de la idea de justicia y de la revalorización del sufrimiento con sentido trascendente. Eurípides ofrece una alternativa, que cuestiona la idea de civilización ante la crisis de su mundo tradicional -abandono de los dioses, arbitrariedad de los hombres, sojuzgamiento de los inocentes. Si la tragedia propone una actualización del mito de Troya en sede clásica –Atenas de la democracia- su relectura ofrece herramientas de análisis para una contemporaneidad debilitada en su fe trascendente y vulnerada en sus relaciones interpersonales. Abstract Based on two tragedies by Euripides, we review the mythical mother figure as a cultural paradigm in order to establish historical relationships. We link the perspective of 4th century Hellenism and contemporary phenomena on three keys: the distancing from the divine and its attempt of resignification through a horizontal ethics, the generalization of violence as a normalized stage of coexistence, the need of referents at individual and social level. In the chosen texts, the motif of destiny focused from the consequences of war develops contrasting types of heroism; among them, Hecuba, the queen mother turned widow and witness of the end of her offspring, makes the distinctive proposal, through the renewal of the idea of justice and the revaluation of suffering with a transcendent sense. Euripides offers an alternative, which questions the idea of civilization in the face of the crisis of its traditional world -abandonment of the gods, arbitrariness of men, subjugation of the innocent. If the tragedy proposes an update of the myth of Troy in a classical setting -Athens of democracy- its re-reading offers analytical tools for a contemporaneity weakened in its transcendent faith and violated in its interpersonal relationships. Keywords: tragedy, Euripides, Hellenism, Hecuba, heroism.


2021 ◽  
Author(s):  
Christel Baier ◽  
Martin Diller ◽  
Clemens Dubslaff ◽  
Sarah Alice Gaggl ◽  
Holger Hermanns ◽  
...  

Abstract argumentation is a prominent reasoning framework. It comes with a variety of semantics, and has lately been enhanced by probabilities to enable a quantitative treatment of argumentation. While admissibility is a fundamental notion in the classical setting, it has been merely reflected so far in the probabilistic setting. In this paper, we address the quantitative treatment of argumentation based on probabilistic notions of admissibility in a way that they form fully conservative extensions of classical notions. In particular, our building blocks are not the beliefs regarding single arguments. Instead we start from the fairly natural idea that whatever argumentation semantics is to be considered, semantics systematically induces constraints on the joint probability distribution on the sets of arguments. In some cases there might be many such distributions, even infinitely many ones, in other cases there may be one or none. Standard semantic notions are shown to induce such sets of constraints, and so do their probabilistic extensions. This allows them to be tackled by SMT solvers, as we demonstrate by a proof-of-concept implementation. We present a taxonomy of semantic notions, also in relation to published work, together with a running example illustrating our achievements.


Mathematics ◽  
2021 ◽  
Vol 9 (14) ◽  
pp. 1654
Author(s):  
Iulia-Elena Hirica ◽  
Cristina-Liliana Pripoae ◽  
Gabriel-Teodor Pripoae ◽  
Vasile Preda

The paper generalizes and extends the notions of dual connections and of statistical manifold, with and without torsion. Links with the deformation algebras and with the Riemannian Rinehart algebras are established. The semi-Riemannian manifolds admitting flat dual connections with torsion are characterized, thus solving a problem suggested in 2000 by S. Amari and H. Nagaoka. New examples of statistical manifolds are constructed, within and beyond the classical setting. The invariant statistical structures on Lie groups are characterized and the dimension of their set is determined. Examples for the new defined geometrical objects are found in the theory of Information Geometry.


2021 ◽  
Vol 27 (3) ◽  
Author(s):  
Martin Schäfer ◽  
Tino Ullrich ◽  
Béatrice Vedel

AbstractIn this paper we introduce new function spaces which we call anisotropic hyperbolic Besov and Triebel-Lizorkin spaces. Their definition is based on a hyperbolic Littlewood-Paley analysis involving an anisotropy vector only occurring in the smoothness weights. Such spaces provide a general and natural setting in order to understand what kind of anisotropic smoothness can be described using hyperbolic wavelets (in the literature also sometimes called tensor-product wavelets), a wavelet class which hitherto has been mainly used to characterize spaces of dominating mixed smoothness. A centerpiece of our present work are characterizations of these new spaces based on the hyperbolic wavelet transform. Hereby we treat both, the standard approach using wavelet systems equipped with sufficient smoothness, decay, and vanishing moments, but also the very simple and basic hyperbolic Haar system. The second major question we pursue is the relationship between the novel hyperbolic spaces and the classical anisotropic Besov–Lizorkin-Triebel scales. As our results show, in general, both approaches to resolve an anisotropy do not coincide. However, in the Sobolev range this is the case, providing a link to apply the newly obtained hyperbolic wavelet characterizations to the classical setting. In particular, this allows for detecting classical anisotropies via the coefficients of a universal hyperbolic wavelet basis, without the need of adaption of the basis or a-priori knowledge on the anisotropy.


2021 ◽  
Vol 20 (2) ◽  
Author(s):  
Andrzej Biś ◽  
Dikran Dikranjan ◽  
Anna Giordano Bruno ◽  
Luchezar Stoyanov

AbstractWe study the receptive metric entropy for semigroup actions on probability spaces, inspired by a similar notion of topological entropy introduced by Hofmann and Stoyanov (Adv Math 115:54–98, 1995). We analyze its basic properties and its relation with the classical metric entropy. In the case of semigroup actions on compact metric spaces we compare the receptive metric entropy with the receptive topological entropy looking for a Variational Principle. With this aim we propose several characterizations of the receptive topological entropy. Finally we introduce a receptive local metric entropy inspired by a notion by Bowen generalized in the classical setting of amenable group actions by Zheng and Chen, and we prove partial versions of the Brin–Katok Formula and the local Variational Principle.


Author(s):  
Tomasz Adamowicz ◽  
María J. González

AbstractWe define Hardy spaces $${\mathcal {H}}^p$$ H p for quasiregular mappings in the plane, and show that for a particular class of these mappings many of the classical properties that hold in the classical setting of analytic mappings still hold. This particular class of quasiregular mappings can be characterised in terms of composition operators when the symbol is quasiconformal. Relations between Carleson measures and Hardy spaces play an important role in the discussion. This program was initiated and developed for Hardy spaces of quasiconformal mappings by Astala and Koskela in 2011 in their paper $${\mathcal {H}}^p$$ H p -theory for Quasiconformal Mappings (Pure Appl Math Q 7(1):19–50, 2011).


Author(s):  
Jiaming Chen

Abstract Let 𝕍 {{\mathbb{V}}} be a polarized variation of integral Hodge structure on a smooth complex quasi-projective variety S. In this paper, we show that the union of the non-factor special subvarieties for ( S , 𝕍 ) {(S,{\mathbb{V}})} , which are of Shimura type with dominant period maps, is a finite union of special subvarieties of S. This generalizes previous results of Clozel and Ullmo (2005) and Ullmo (2007) on the distribution of the non-factor (in particular, strongly) special subvarieties in a Shimura variety to the non-classical setting and also answers positively the geometric part of a conjecture of Klingler on the André–Oort conjecture for variations of Hodge structures.


Author(s):  
Akinori Hosoyamada ◽  
Tetsu Iwata

Recent results on quantum cryptanalysis show that some symmetric key schemes can be broken in polynomial time even if they are proven to be secure in the classical setting. Liskov, Rivest, and Wagner showed that secure tweakable block ciphers can be constructed from secure block ciphers in the classical setting. However, Kaplan et al. showed that their scheme can be broken by polynomial time quantum superposition attacks, even if underlying block ciphers are quantum-secure. Since then, it remains open if there exists a mode of block ciphers to build quantum-secure tweakable block ciphers. This paper settles the problem in the reduction-based provable security paradigm. We show the first design of quantum-secure tweakable block ciphers based on quantum-secure block ciphers, and present a provable security bound. Our construction is simple, and when instantiated with a quantum-secure n-bit block cipher, it is secure against attacks that query arbitrary quantum superpositions of plaintexts and tweaks up to O(2n/6) quantum queries. Our security proofs use the compressed oracle technique introduced by Zhandry. More precisely, we use an alternative formalization of the technique introduced by Hosoyamada and Iwata.


Sign in / Sign up

Export Citation Format

Share Document