English
Related papers

Related papers: Incoherent coherences

200 papers

This paper presents a new axis-based shape representation scheme along with a matching framework to address the problem of generic shape recognition. The main idea is to define the relative spatial arrangement of local symmetry axes and…

Computer Vision and Pattern Recognition · Computer Science 2011-04-15 Cagri Aslan , Sibel Tari

After exhaustive inspection of bosonic coherent states appearing in physical literature two of us, Horzela and Szafraniec, came in 2012 to the reasonably general definition which relies exclusively on reproducing kernels. The basic feature…

Mathematical Physics · Physics 2018-06-26 K. Górska , A. Horzela , F. H. Szafraniec

The article introduces the concept of uniformity, which is formulated as a scheme of axioms. The connection of this concept with ordered sets is studied. The effectiveness of using axiom schemes as a convenient and short way of replacing…

Logic · Mathematics 2023-07-04 V. M. Zhuravlov

At its core, abstraction is the process of generalizing from specific instances to broader concepts or models, with the primary objective of reducing complexity while preserving properties essential to the intended purpose. It is…

Logic in Computer Science · Computer Science 2026-01-06 Andrzej Szalas

When using interactive theorem provers based on dependent type theory to define and reason about languages involving binding constructs, we advocate the use of a well-scoped version of the locally nameless method of representing syntax.…

Logic in Computer Science · Computer Science 2026-05-12 Andrew M. Pitts

An abstract argumentation framework can be used to model the argumentative stance of an agent at a high level of abstraction, by indicating for every pair of arguments that is being considered in a debate whether the first attacks the…

Artificial Intelligence · Computer Science 2017-07-28 Weiwei Chen , Ulle Endriss

We demonstrate the simple and deep equivalence between quantum coherence and nonclassicality and the definite way in which they determine metrological resolution. Moreover, we define a coherence observable consistent with a classical…

Quantum Physics · Physics 2021-09-10 Laura Ares , Alfredo Luis

Complex reasoning problems are most clearly and easily specified using logical rules, but require recursive rules with aggregation such as count and sum for practical applications. Unfortunately, the meaning of such rules has been a…

Databases · Computer Science 2023-08-29 Yanhong A. Liu , Scott D. Stoller

In this work, we describe a framework that unifies many different interactive learning tasks. We present a generalization of the {\it query-by-committee} active learning algorithm for this setting, and we study its consistency and rate of…

Machine Learning · Computer Science 2018-03-20 Christopher Tosh , Sanjoy Dasgupta

We consider the problem of modularizing control flow in a generic abstract interpretation framework. A generic abstract interpretation framework is not truly flexible if it does not allow interpreting with different path- and…

Programming Languages · Computer Science 2026-02-19 Cade Lueker , Andrew Fox , Bor-Yuh Evan Chang

This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space,…

Artificial Intelligence · Computer Science 2025-08-05 Saleh Nikooroo , Thomas Engel

We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational…

Logic in Computer Science · Computer Science 2007-07-10 Yves Bertot

In this article, we present a novel approach for parsing argumentation structures. We identify argument components using sequence labeling at the token level and apply a new joint model for detecting argumentation structures. The proposed…

Computation and Language · Computer Science 2016-07-25 Christian Stab , Iryna Gurevych

Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour. However, the standard operational semantics defined over such models implicitly assume perfect knowledge of the…

Systems and Control · Computer Science 2013-08-27 Alberto Casagrande , Tommaso Dreossi , Carla Piazza

In this work we present a definition for coherence and compatibility of multilinear mappings and homogenous polynomial classes. These definitions are more restricted than the ones proposed before. We began analyzing this new definition in a…

Functional Analysis · Mathematics 2018-10-24 Joilson Ribeiro , Fabrício Santos , Ewerton Torres

We present a syntactic abstraction method to reason about first-order modal logics by using theorem provers for standard first-order logic and for propositional modal logic.

Logic in Computer Science · Computer Science 2014-09-15 Damien Doligez , Jael Kriener , Leslie Lamport , Tomer Libal , Stephan Merz

We make explicit the correspondence between syntax and syntactic categories for coherent first-order logic, providing a categorical characterization of bi-interpretability. This is done by creating a biequivalence between a bicategory of…

Logic · Mathematics 2023-07-11 Anthony D'Arienzo , Vinny Pagano , Ian M. J. McInnis

A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel compositions. Since different syntactic terms may represent the…

Logic in Computer Science · Computer Science 2026-02-12 Julie Cailler , Noé Delorme , Simon Perdrix , Sophie Tourret

The theory of decoherent histories allows one to talk of the behavior of quantum systems in the absence of measurement. This paper generalizes the idea of decoherent histories to arbitrary open system operations and proposes experimentally…

Quantum Physics · Physics 2007-05-23 Seth Lloyd

We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…

Logic · Mathematics 2019-05-10 Will Boney , Sebastien Vasey