Related papers: Further Comments on Yablo's Construction
We present IBR, an Iterative Backward Reasoning model to solve the proof generation tasks on rule-based Question Answering (QA), where models are required to reason over a series of textual rules and facts to find out the related proof path…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…
We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…
Learning the structure of a causal graphical model using both observational and interventional data is a fundamental problem in many scientific fields. A promising direction is continuous optimization for score-based methods, which,…
In this paper, author uses set theory to construct a logic model of abstract figure from binary relation. Based on the uniform quantified structure, author gives two logic system for graph traversal and graph coloring respectively, moreover…
The Yangian of the strange Lie superalgebras in Drinfel'd realization is defined. The current system generators and defining relations are described.
We develop a sound and complete graphical theory for discrete linear time-invariant dynamical systems. The graphical syntax, as in previous work, is closely related to the classical notion of signal flow diagrams, differently from previous…
We develop a new, intrinsic, computationally friendly approach to Lie coalgebras through graph coalgebras, which are new and likely to be of independent interest. Our graph coalgebraic approach has advantages both in finding relations…
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…
Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we…
We consider a method popular in the literature of associating a two-step nilpotent Lie algebra with a finite simple graph. We prove that the two-step nilpotent Lie algebras associated with two graphs are Lie isomorphic if and only if the…
The consistent histories approach to quantum mechanics is traditionally based on linearly ordered sequences of events. We extend the histories formalism to sets of events whose causal ordering is described by directed acyclic graphs. The…
We study twisted Jacobi manifolds, a concept that we had introduced in a previous Note. Twisted Jacobi manifolds can be characterized using twisted Dirac-Jacobi, which are sub-bundles of Courant-Jacobi algebroids. We show that each twisted…
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can…
One of the main claims of the paper is that Dirac's calculus and broader theories of physics can be treated as theories written in the language of Continuous Logic. Establishing its true interpretation (model) is a model theory problem. The…
Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.
The paper presents a method for obtaining problems whose conclusions contain disjunctive propositions. These problems constitute a version of inverse problems with a given logical structure. The logical models in the groups of problems…
Comprehensible neural network explanations are foundations for a better understanding of decisions, especially when the input data are infused with malicious perturbations. Existing solutions generally mitigate the impact of perturbations…