当前期刊: arXiv - CS - Logic in Computer Science Go to current issue    加入关注   
显示样式:        排序: 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Up-to Techniques for Branching Bisimilarity
    arXiv.cs.LO Pub Date : 2020-01-24
    Rick Erkens; Jurriaan Rot; Bas Luttik

    Ever since the introduction of behavioral equivalences on processes one has been searching for efficient proof techniques that accompany those equivalences. Both strong bisimilarity and weak bisimilarity are accompanied by an arsenal of up-to techniques: enhancements of their proof methods. For branching bisimilarity, these results have not been established yet. We show that a powerful proof technique is sound for branching bisimilarity by combining the three techniques of up to union, up to expansion and up to context for Bloom's BB cool format. We then make an initial proposal for casting the correctness proof of the up to context technique in an abstract coalgebraic setting, covering branching but also {\eta}, delay and weak bisimilarity.

    更新日期:2020-01-27
  • Policy Synthesis for Factored MDPs with Graph Temporal Logic Specifications
    arXiv.cs.LO Pub Date : 2020-01-24
    Murat Cubuktepe; Zhe Xu; Ufuk Topcu

    We study the synthesis of policies for multi-agent systems to implement spatial-temporal tasks. We formalize the problem as a factored Markov decision process subject to so-called graph temporal logic specifications. The transition function and the spatial-temporal task of each agent depend on the agent itself and its neighboring agents. The structure in the model and the specifications enable to develop a distributed algorithm that, given a factored Markov decision process and a graph temporal logic formula, decomposes the synthesis problem into a set of smaller synthesis problems, one for each agent. We prove that the algorithm runs in time linear in the total number of agents. The size of the synthesis problem for each agent is exponential only in the number of neighboring agents, which is typically much smaller than the number of agents. We demonstrate the algorithm in case studies on disease control and urban security. The numerical examples show that the algorithm can scale to hundreds of agents.

    更新日期:2020-01-27
  • Efficient and Modular Coalgebraic Partition Refinement
    arXiv.cs.LO Pub Date : 2018-06-14
    Thorsten Wißmann; Ulrich Dorsch; Stefan Milius; Lutz Schröder

    We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical relational systems but also, e.g. various forms of weighted systems and furthermore to flexibly combine existing system types. Under assumptions on the type functor that allow representing its finite coalgebras in terms of nodes and edges, our algorithm runs in time $\mathcal{O}(m\cdot \log n)$ where $n$ and $m$ are the numbers of nodes and edges, respectively. The generic complexity result and the possibility of combining system types yields a toolbox for efficient partition refinement algorithms. Instances of our generic algorithm match the run-time of the best known algorithms for unlabelled transition systems, Markov chains, deterministic automata (with fixed alphabets), Segala systems, and for color refinement.

    更新日期:2020-01-27
  • Probabilistic logics based on Riesz spaces
    arXiv.cs.LO Pub Date : 2019-03-22
    Robert Furber; Radu Mardare; Matteo Mio

    We introduce a novel real-valued endogenous logic for expressing properties of probabilistic transition systems called Riesz modal logic. The design of the syntax and semantics of this logic is directly inspired by the theory of Riesz spaces, a mature field of mathematics at the intersection of universal algebra and functional analysis. By using powerful results from this theory, we develop the duality theory of the Riesz modal logic in the form of an algebra-to-coalgebra correspondence. This has a number of consequences including: a sound and complete axiomatization, the proof that the logic characterizes probabilistic bisimulation and other convenient results such as completion theorems. This work is intended to be the basis for subsequent research on extensions of Riesz modal logic with fixed-point operators.

    更新日期:2020-01-27
  • Bunch theory: working notes on applications, axioms and models
    arXiv.cs.LO Pub Date : 2019-11-11
    Bill Stoddart; Frank Zeyda; Steve Dunne

    In his book "A practical theory of programming" Eric Hehner proposes and applies a remarkably radical reformulation of set theory, in which the collection and packaging of elements are seen as separate activities. This provides for unpackaged collections, referred to as "bunches". Bunches allow us to reason about non-determinism at the level of terms, and, very remarkably, allow us to reason about the conceptual entity "nothing", which is just an empty bunch (and very different from an empty set). This eliminates mathematical "gaps" caused by undefined terms. We compare the use of bunches with other approaches to this problem, and we illustrate the use of bunch theory in formulating program semantics which combines non-deterministic, preferential, and probabilistic choice. We show how an existing axiomatisation of set theory can be extended to incorporate bunches, and we provide and validate a model. Standard functions are lifted when applied to a bunch of values, but we also define a wholistic function application which allows whole bunches to be accepted as arguments, and we develop its associated fixed point theory.

    更新日期:2020-01-27
  • The Expressiveness of Looping Terms in the Semantic Programming
    arXiv.cs.LO Pub Date : 2019-12-05
    Sergey Goncharov; Sergey Ospichev; Denis Ponomaryov; Dmitri Sviridenko

    We consider the language of $\Delta_0$-formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the language of $\Delta_0$-formulas with non-standard list terms, which represent bounded list search, bounded iteration, and bounded recursion. We prove a number of results on the complexity of model checking and satisfiability for these formulas. In particular, we show that the set of $\Delta_0$-formulas with bounded recursive terms true in a given list superstructure $HW(\mathcal{M})$ is non-elementary (it contains the class kEXPTIME, for all $k\geqslant 1$). For $\Delta_0$-formulas with restrictions on the usage of iterative and recursive terms, we show lower complexity.

    更新日期:2020-01-27
  • Transitivity of Subtyping for Intersection Types
    arXiv.cs.LO Pub Date : 2019-06-24
    Jeremy G. Siek

    The subtyping relation for intersection type systems traditionally employs a transitivity rule (Barendregt et al. 1983), which means that the subtyping judgment does not enjoy the subformula property. Laurent develops a sequent-style subtyping judgment, without transitivity, and proves transitivity via a sequence of six lemmas that culminate in cut-elimination (2018). This article presents a subtyping judgment, in regular style, that satisfies the subformula property, and presents a direct proof of transitivity. Borrowing from Laurent's system, the rule for function types is essentially the $\beta$-soundness property. The main lemma required for the transitivity proof is one that has been used to prove the inversion principle for subtyping of function types. The choice of induction principle for the proof of transitivity is subtle: we use well-founded induction on the lexicographical ordering of the sum of the depths of the first and last type followed by the sum of the sizes of the middle and last type. The article concludes with a proof that the new subtyping judgment is equivalent to that of Barendregt, Coppo, and Dezani-Ciancaglini.

    更新日期:2020-01-27
  • Star Games and Hydras
    arXiv.cs.LO Pub Date : 2020-01-23
    Jörg Endrullis; Jan Willem Klop; Roy Overbeek

    The recursive path ordering is an established and crucial tool in term rewriting to prove termination. We revisit its presentation by means of some simple rules on trees equipped with a `star' as control symbol, signifying a command to make that tree (or term) smaller in the order being defined. This leads to star games that are very convenient for proving termination of many rewriting tasks. For instance, using already the simplest star game on finite unlabeled trees, we obtain a very direct proof of termination of the famous Hydra battle. We also include an alternative road to setting up the star games, using a proof method of Buchholz, and a quantitative version of the star as control symbol. We conclude with a number of questions and future research directions.

    更新日期:2020-01-24
  • Learning Distributional Programs for Relational Autocompletion
    arXiv.cs.LO Pub Date : 2020-01-23
    Kumar Nitesh; Kuzelka Ondrej; De Raedt Luc

    Relational autocompletion is the problem of automatically filling out some missing fields in a relational database. We tackle this problem within the probabilistic logic programming framework of Distributional Clauses (DC), which supports both discrete and continuous probability distributions. Within this framework, we introduce Dreaml -- an approach to learn both the structure and the parameters of DC programs from databases that may contain missing information. To realize this, Dreaml integrates statistical modeling, distributional clauses with rule learning. The distinguishing features of Dreaml are that it 1) tackles relational autocompletion, 2) learns distributional clauses extended with statistical models, 3) deals with both discrete and continuous distributions, 4) can exploit background knowledge, and 5) uses an expectation-maximization based algorithm to cope with missing data.

    更新日期:2020-01-24
  • Model-theoretic Characterizations of Existential Rule Languages
    arXiv.cs.LO Pub Date : 2020-01-23
    Heng Zhang; Yan Zhang; Guifei Jiang

    Existential rules, a.k.a. dependencies in databases, and Datalog+/- in knowledge representation and reasoning recently, are a family of important logical languages widely used in computer science and artificial intelligence. Towards a deep understanding of these languages in model theory, we establish model-theoretic characterizations for a number of existential rule languages such as (disjunctive) embedded dependencies, tuple-generating dependencies (TGDs), (frontier-)guarded TGDs and linear TGDs. All these characterizations hold for arbitrary structures, and most of them also work on the class of finite structures. As a natural application of these characterizations, complexity bounds for the rewritability of above languages are also identified.

    更新日期:2020-01-24
  • Benchmarking Symbolic Execution Using Constraint Problems -- Initial Results
    arXiv.cs.LO Pub Date : 2020-01-22
    Sahil Verma; Roland H. C. Yap

    Symbolic execution is a powerful technique for bug finding and program testing. It is successful in finding bugs in real-world code. The core reasoning techniques use constraint solving, path exploration, and search, which are also the same techniques used in solving combinatorial problems, e.g., finite-domain constraint satisfaction problems (CSPs). We propose CSP instances as more challenging benchmarks to evaluate the effectiveness of the core techniques in symbolic execution. We transform CSP benchmarks into C programs suitable for testing the reasoning capabilities of symbolic execution tools. From a single CSP P, we transform P depending on transformation choice into different C programs. Preliminary testing with the KLEE, Tracer-X, and LLBMC tools show substantial runtime differences from transformation and solver choice. Our C benchmarks are effective in showing the limitations of existing symbolic execution tools. The motivation for this work is we believe that benchmarks of this form can spur the development and engineering of improved core reasoning in symbolic execution engines.

    更新日期:2020-01-23
  • Soundness-preserving composition of synchronously and asynchronously interacting workflow net components
    arXiv.cs.LO Pub Date : 2020-01-15
    Luca Bernardinello; Irina Lomazova; Roman Nesterov; Lucia Pomello

    In this paper, we propose a compositional approach to construct formal models of complex distributed systems with several synchronously and asynchronously interacting components. A system model is obtained from a composition of individual component models according to requirements on their interaction. We represent component behavior using workflow nets - a class of Petri nets. We propose a general approach to model and compose synchronously and asynchronously interacting workflow nets. Through the use of Petri net morphisms and their properties, we prove that this composition of workflow nets preserves component correctness.

    更新日期:2020-01-23
  • Drawing Prolog Search Trees: A Manual for Teachers and Students of Logic Programming
    arXiv.cs.LO Pub Date : 2020-01-22
    Johan Bos

    Programming in Prolog is hard for programmers that are used to procedural coding. In this manual the method of drawing search trees is introduced with the aim to get a better understanding of how Prolog works. After giving a first example of a Prolog database, query and search tree, the art of drawing search trees is systematically introduced giving guidelines for queries with variables, conjunction, disjunction, and negation. Further examples are provided by giving the complete search trees that are shown in Learn Prolog Now!

    更新日期:2020-01-23
  • AMSNP: a tame fragment of existential second-order logic
    arXiv.cs.LO Pub Date : 2020-01-22
    Manuel Bodirsky; Simon Knäuer; Florian Starke

    Amalgamation monotone SNP (AMSNP) is a fragment of existential second-order logic that strictly contains the logics (connected) MMSNP of Feder and Vardi and guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate for an expressive subclass of NP that exhibits a complexity dichotomy. We show that AMSNP has a complexity dichotomy if and only if Constraint Satisfaction Problems for reducts of finitely bounded homogeneous structures have a complexity dichotomy. For such CSPs, powerful universal-algebraic hardness conditions are known that are conjectured to describe the border between NP-hard and polynomial-time tractable CSPs. The connection to CSPs also implies that every AMSNP sentence can be evaluated in polynomial time on classes of finite structures of bounded treewidth. We show that the syntax of AMSNP is decidable. The proof relies on the following fact, which we believe is of independent interest in model theory: for classes of finite structures given by finitely many forbidden substructures, the amalgamation property is decidable.

    更新日期:2020-01-23
  • The $π$-Calculus is Behaviourally Complete and Orbit-Finitely Executable
    arXiv.cs.LO Pub Date : 2014-10-14
    Bas Luttik; Fei Yang

    Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour (finitely) executable if, and only if, it is behaviourally equivalent to the behaviour of a (finite) reactive Turing machine. In this paper, we study the relationship between executable behaviour and behaviour that can be specified in the $\pi$-calculus. We establish that every finitely executable behaviour can be specified in the $\pi$-calculus up to divergence-preserving branching bisimilarity. The converse, however, is not true due to (intended) limitations of the model of reactive Turing machines. That is, the $\pi$-calculus allows the specification of behaviour that is not finitely executable up to divergence-preserving branching bisimilarity. We shall prove, however, that if the finiteness requirement on reactive Turing machines and the associated notion of executability is relaxed to orbit-finiteness, then the $\pi$-calculus is executable up to (divergence-insensitive) branching bisimilarity.

    更新日期:2020-01-23
  • Equivariant ZFA and the foundations of nominal techniques
    arXiv.cs.LO Pub Date : 2018-01-29
    Murdoch J. Gabbay

    We give an accessible presentation to the foundations of nominal techniques, lying between Zermelo-Fraenkel set theory and Fraenkel-Mostowski set theory, and which has several nice properties including being consistent with the Axiom of Choice. We give two presentations of equivariance, accompanied by detailed yet user-friendly discussions of its theoretical significance and practical application.

    更新日期:2020-01-23
  • Weihrauch goes Brouwerian
    arXiv.cs.LO Pub Date : 2018-09-02
    Vasco Brattka; Guido Gherardi

    We prove that the Weihrauch lattice can be transformed into a Brouwer algebra by the consecutive application of two closure operators in the appropriate order: first completion and then parallelization. The closure operator of completion is a new closure operator that we introduce. It transforms any problem into a total problem on the completion of the respective types, where we allow any value outside of the original domain of the problem. This closure operator is of interest by itself, as it generates a total version of Weihrauch reducibility that is defined like the usual version of Weihrauch reducibility, but in terms of total realizers. From a logical perspective completion can be seen as a way to make problems independent of their premises. Alongside with the completion operator and total Weihrauch reducibility we need to study precomplete representations that are required to describe these concepts. In order to show that the parallelized total Weihrauch lattice forms a Brouwer algebra, we introduce a new multiplicative version of an implication. While the parallelized total Weihrauch lattice forms a Brouwer algebra with this implication, the total Weihrauch lattice fails to be a model of intuitionistic linear logic in two different ways. In order to pinpoint the algebraic reasons for this failure, we introduce the concept of a Weihrauch algebra that allows us to formulate the failure in precise and neat terms. Finally, we show that the Medvedev Brouwer algebra can be embedded into our Brouwer algebra, which also implies that the theory of our Brouwer algebra is Jankov logic.

    更新日期:2020-01-23
  • Non-computability of human intelligence
    arXiv.cs.LO Pub Date : 2018-10-12
    Yasha Savelyev

    We revisit the question (most famously) initiated by Turing: can human intelligence be completely modeled by a Turing machine? We show that the answer is \emph{no}, assuming a certain weak soundness hypothesis. More specifically we show that at least some meaningful thought processes of the brain cannot be Turing computable. In particular some physical processes are not Turing computable, which is not entirely expected. There are some similarities of our argument with the well known Lucas-Penrose argument, but we work purely on the level of Turing machines, and do not use G\"odel's incompleteness theorem or any direct analogue. Instead we construct directly and use a weak analogue of a G\"odel statement for a certain system which involves our human, this allows us to side-step some (possible) meta-logical issues with their argument.

    更新日期:2020-01-23
  • Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width
    arXiv.cs.LO Pub Date : 2020-01-18
    Michał Wrona

    Solving the algebraic dichotomy conjecture for constraint satisfaction problems over structures first-order definable in countably infinite finitely bounded homogeneous structures requires understanding the applicability of local-consistency methods in this setting. We study the amount of consistency (measured by relational width) needed to solve CSP for first-order expansions S of countably infinite homogeneous graphs that additionally have bounded strict width, i.e., for which establishing local consistency of an instance of the CSP not only decides if there is a solution but also ensures that every solution may be obtained from a locally consistent instance by greedily assigning values to variables, without backtracking. Our main result is that the structures S under consideration have relational width exactly (2, L) where L is the maximal size of a forbidden subgraph of a homogeneous graph under consideration, but not smaller than 3. It beats the upper bound (2m, 3m) where m = max(arity(S)+1, L, 3) and arity(S) is the largest arity of a relation in S, which follows from a sufficient condition implying bounded relational width from the literature. Since L may be arbitrarily large, our result contrasts the collapse of the relational bounded width hierarchy for finite structures , whose relational width, if finite, is always at most (2,3).

    更新日期:2020-01-22
  • FASiM: A Framework for Automatic Formal Analysis of Simulink Models of Linear Analog Circuits
    arXiv.cs.LO Pub Date : 2020-01-18
    Adnan Rashid; Ayesha Gauhar; Osman Hasan

    Simulink is a graphical environment that is widely adapted for the modeling and the Laplace transform based analysis of linear analog circuits used in signal processing architectures. However, due to the involvement of the numerical algorithms of MATLAB in the analysis process, the analysis results cannot be termed as complete and accurate. Higher-order-logic theorem proving is a formal verification method that has been recently proposed to overcome these limitations for the modeling and the Laplace transform based analysis of linear analog circuits. However, the formal modeling of a system is not a straightforward task due to the lack of formal methods background for engineers working in the industry. Moreover, due to the undecidable nature of higher-order logic, the analysis generally requires a significant amount of user guidance in the manual proof process. In order to facilitate industrial engineers to formally analyze the linear analog circuits based on the Laplace transform, we propose a framework, FASiM, which allows automatically conducting the formal analysis of the Simulink models of linear analog circuits using the HOL Light theorem prover. For illustration, we use FASiM to formally analyze Simulink models of some commonly used linear analog filters, such as Sallen-key filters.

    更新日期:2020-01-22
  • Infinitary Action Logic with Exponentiation
    arXiv.cs.LO Pub Date : 2020-01-19
    Stepan L. Kuznetsov; Stanislav O. Speranski

    We introduce infinitary action logic with exponentiation---that is, the multiplicative-additive Lambek calculus extended with Kleene star and with a family of subexponential modalities, which allows some of the structural rules (contraction, weakening, permutation). The logic is presented in the form of an infinitary sequent calculus. We prove cut elimination and, in the case where at least one subexponential allows non-local contraction, establish exact complexity boundaries in two senses. First, we show that the derivability problem for this logic is $\Pi_1^1$-complete. Second, we show that the closure ordinal of its derivability operator is $\omega_1^{\mathrm{CK}}$.

    更新日期:2020-01-22
  • Semantics for first-order affine inductive data types via slice categories
    arXiv.cs.LO Pub Date : 2020-01-19
    Vladimir Zamdzhiev

    Affine type systems are substructural type systems where copying of information is restricted, but discarding of information is permissible at all types. Such type systems are well-suited for describing quantum programming languages, because copying of quantum information violates the laws of quantum mechanics. In this paper, we consider a first-order affine type system with inductive data types and present a novel categorical semantics for it. The most challenging aspect of this interpretation comes from the requirement to construct appropriate discarding maps for our data types which might be defined by mutual/nested recursion. We show how to achieve this for all types by taking models of a first-order linear type system whose atomic types are discardable and then presenting an additional affine interpretation of types within the slice category of the model with the tensor unit. We present some concrete categorical models for the language ranging from classical to quantum. Finally, we discuss potential ways of dualising and extending our methods and using them for interpreting coalgebraic and lazy data types.

    更新日期:2020-01-22
  • Quantitative Aspects of Programming Languages and Systems over the past $2^4$ years and beyond
    arXiv.cs.LO Pub Date : 2020-01-20
    Alessandro AldiniUniversity of Urbino

    Quantitative aspects of computation are related to the use of both physical and mathematical quantities, including time, performance metrics, probability, and measures for reliability and security. They are essential in characterizing the behaviour of many critical systems and in estimating their properties. Hence, they need to be integrated both at the level of system modeling and within the verification methodologies and tools. Along the last two decades a variety of theoretical achievements and automated techniques have contributed to make quantitative modeling and verification mainstream in the research community. In the same period, they represented the central theme of the series of workshops entitled Quantitative Aspects of Programming Languages and Systems (QAPL) and born in 2001. The aim of this survey is to revisit such achievements and results from the standpoint of QAPL and its community.

    更新日期:2020-01-22
  • Streaming Transformations of Infinite Ordered-Data Words
    arXiv.cs.LO Pub Date : 2020-01-20
    Xiaokang Qiu

    In this paper, we define streaming register transducer (SRT), a one-way, letter-to-letter, transductional machine model for transformations of infinite data words whose data domain forms a linear group. Comparing with existing data word transducers, SRT are able to perform two extra operations on the registers: a linear-order-based comparison and an additive update. We consider the transformations that can be defined by SRT and several subclasses of SRT. We investigate the expressiveness of these languages and several decision problems. Our main results include: 1) SRT are closed under union and intersection, and add-free SRT are also closed under composition; 2) SRT-definable transformations can be defined in monadic second-order (MSO) logic, but are not comparable with first-order (FO) definable transformations; 3) the functionality problem is decidable for add-free SRT, the reactivity problem and inclusion problem are decidable for deterministic add-free SRT, but none of these problems is decidable in general for SRT.

    更新日期:2020-01-22
  • Modular coinduction up-to for higher-order languages via first-order transition systems
    arXiv.cs.LO Pub Date : 2020-01-20
    Jean-Marie Madiot; Damien Pous; Davide Sangiorgi

    The bisimulation proof method can be enhanced by employing `bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and bisimilarity, based on abstract fixed-point theory and compatible functions. We transport this theory onto languages whose bisimilarity and LTS go beyond those of first-order models. The approach consists in exhibiting fully abstract translations of the more sophisticated LTSs and bisimilarities onto the first-order ones. This allows us to reuse directly the large corpus of up-to techniques that are available on first-order LTSs. The only ingredient that has to be manually supplied is the compatibility of basic up-to techniques that are specific to the new languages. We investigate the method on the pi-calculus, the lambda-calculus, and a (call-by-value) lambda-calculus with references.

    更新日期:2020-01-22
  • Dynamic Epistemic Logic Games with Epistemic Temporal Goals
    arXiv.cs.LO Pub Date : 2020-01-20
    Bastien Maubert; Aniello Murano; Sophie Pinchinat; François Schwarzentruber; Silvia Stranieri

    Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games were recently introduced as a way to define classes of games with imperfect information where the actions available to the players are described very precisely. This framework makes it possible to define easily, for instance, classes of games where players can only use public actions or public announcements. These games have been studied for reachability objectives, where the aim is to reach a situation satisfying some epistemic property expressed in epistemic logic; several (un)decidability results have been established. In this work we show that the decidability results obtained for reachability objectives extend to a much more general class of winning conditions, namely those expressible in the epistemic temporal logic LTLK. To do so we establish that the infinite game structures generated by DEL public actions are regular, and we describe how to obtain finite representations on which we rely to solve them.

    更新日期:2020-01-22
  • A graph-based spatial temporal logic for knowledge representation and automated reasoning in cognitive robots
    arXiv.cs.LO Pub Date : 2020-01-20
    Zhiyu Liu; Meng Jiang; Hai Lin

    A new graph-based spatial temporal logic is proposed for knowledge representation and automated reasoning in this paper. The proposed logic achieves a balance between expressiveness and tractability in applications such as cognitive robots. The satisfiability of the proposed logic is decidable. A Hilbert style axiomatization for the proposed graph-based spatial temporal logic is given where Modus ponens and IRR are the inference rules. It has been shown that the corresponding deduction system is sound and complete and can be implemented through constraint programming.

    更新日期:2020-01-22
  • Sampling and Learning for Boolean Function
    arXiv.cs.LO Pub Date : 2020-01-21
    Chuyu Xiong

    In this article, we continue our study on universal learning machine by introducing new tools. We first discuss boolean function and boolean circuit, and we establish one set of tools, namely, fitting extremum and proper sampling set. We proved the fundamental relationship between proper sampling set and complexity of boolean circuit. Armed with this set of tools, we then introduce much more effective learning strategies. We show that with such learning strategies and learning dynamics, universal learning can be achieved, and requires much less data.

    更新日期:2020-01-22
  • Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory
    arXiv.cs.LO Pub Date : 2017-11-14
    Mathys Rennela; Sam Staton

    We describe categorical models of a circuit-based (quantum) functional programming language. We show that enriched categories play a crucial role. Following earlier work on QWire by Paykin et al., we consider both a simple first-order linear language for circuits, and a more powerful host language, such that the circuit language is embedded inside the host language. Our categorical semantics for the host language is standard, and involves cartesian closed categories and monads. We interpret the circuit language not in an ordinary category, but in a category that is enriched in the host category. We show that this structure is also related to linear/non-linear models. As an extended example, we recall an earlier result that the category of W*-algebras is dcpo-enriched, and we use this model to extend the circuit language with some recursive types.

    更新日期:2020-01-22
  • Language Preservation Problems in Parametric Timed Automata
    arXiv.cs.LO Pub Date : 2018-07-18
    Étienne André; Didier Lime; Nicolas Markey

    Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter valuation, does there exist another parameter valuation with the same untimed language, or with the same set of traces? We show that these problems are undecidable both for general PTA and for the restricted class of L/U-PTA, even for integer-valued parameters, or over bounded time. On the other hand, we exhibit decidable subclasses: 1-clock PTA, and 1-parameter deterministic L-PTA and U-PTA. We also consider robust versions of these problems, where we additionally require that the language be preserved for all valuations between the reference valuation and the new valuation.

    更新日期:2020-01-22
  • Continuous Ordinary Differential Equations and Transfinite Computations
    arXiv.cs.LO Pub Date : 2019-02-19
    Olivier Bournez; Sabrina Ouazzani

    We consider Continuous Ordinary Differential Equations (CODE) y'=f(y), where f is a continuous function. They are known to always have solutions for a given initial condition y(0)=y0, these solutions being possibly non unique. We restrict to our attention to a class of continuous functions, that we call greedy: they always admit unique greedy solutions, i.e. going in greedy way in some fixed direction. We prove that they can be seen as models of computation over the ordinals and conversely in a very strong sense. In particular, for such ODEs, to a greedy trajectory can be associated some ordinal corresponding to some time of computation, and conversely models of computation over the ordinals can be associated to some CODE. In particular, analyzing reachability for one or the other concept with respect to greedy trajectories has the same hardness. This also brings new perspectives on analysis in Mathematics, by providing ways to translate results for ITTMs to CODEs. This also extends some recent results about the relations between ordinary differential equations and Turing machines, and more widely with (generalized) computability theory.

    更新日期:2020-01-22
  • Axiomatizing first-order consequences in inclusion logic
    arXiv.cs.LO Pub Date : 2019-04-12
    Fan Yang

    Inclusion logic is a variant of dependence logic that was shown to have the same expressive power as positive greatest fixed-point logic. Inclusion logic is not axiomatizable in full, but its first-order consequences can be axiomatized. In this paper, we provide such an explicit partial axiomatization by introducing a system of natural deduction for inclusion logic that is sound and complete for first-order consequences in inclusion logic.

    更新日期:2020-01-22
  • A Formal Axiomatization of Computation
    arXiv.cs.LO Pub Date : 2019-07-04
    Rasoul Ramezanian

    We introduce an axiomatization for the notion of computation. Based on the idea of Brouwer choice sequences, we construct a model, denoted by $E$, which satisfies our axioms and $E \models \mathrm{ P \neq NP}$. In other words, regarding "effective computability" in Brouwer intuitionism viewpoint, we show $\mathrm{ P \neq NP}$.

    更新日期:2020-01-22
  • Toward a Dempster-Shafer theory of concepts
    arXiv.cs.LO Pub Date : 2019-08-14
    Sabine Frittella; Krishna Manoorkar; Alessandra Palmigiano; Apostolos Tzimoulis; Nachoem M. Wijnberg

    In this paper, we generalize the basic notions and results of Dempster-Shafer theory from predicates to formal concepts. Results include the representation of conceptual belief functions as inner measures of suitable probability functions, and a Dempster-Shafer rule of combination on belief functions on formal concepts.

    更新日期:2020-01-22
  • On Expert Behaviors and Question Types for Efficient Query-Based Ontology Fault Localization
    arXiv.cs.LO Pub Date : 2020-01-16
    Patrick Rodler

    We challenge existing query-based ontology fault localization methods wrt. assumptions they make, criteria they optimize, and interaction means they use. We find that their efficiency depends largely on the behavior of the interacting expert, that performed calculations can be inefficient or imprecise, and that used optimization criteria are often not fully realistic. As a remedy, we suggest a novel (and simpler) interaction approach which overcomes all identified problems and, in comprehensive experiments on faulty real-world ontologies, enables a successful fault localization while requiring fewer expert interactions in 66 % of the cases, and always at least 80 % less expert waiting time, compared to existing methods.

    更新日期:2020-01-17
  • Reward Shaping for Reinforcement Learning with Omega-Regular Objectives
    arXiv.cs.LO Pub Date : 2020-01-16
    E. M. Hahn; M. Perez; S. Schewe; F. Somenzi; A. Trivedi; D. Wojtczak

    Recently, successful approaches have been made to exploit good-for-MDPs automata (B\"uchi automata with a restricted form of nondeterminism) for model free reinforcement learning, a class of automata that subsumes good for games automata and the most widespread class of limit deterministic automata. The foundation of using these B\"uchi automata is that the B\"uchi condition can, for good-for-MDP automata, be translated to reachability. The drawback of this translation is that the rewards are, on average, reaped very late, which requires long episodes during the learning process. We devise a new reward shaping approach that overcomes this issue. We show that the resulting model is equivalent to a discounted payoff objective with a biased discount that simplifies and improves on prior work in this direction.

    更新日期:2020-01-17
  • A Categorical Reconstruction of Quantum Theory
    arXiv.cs.LO Pub Date : 2018-04-06
    Sean Tull

    We reconstruct finite-dimensional quantum theory from categorical principles. That is, we provide properties ensuring that a given physical theory described by a dagger compact category in which one may `discard' objects is equivalent to a generalised finite-dimensional quantum theory over a suitable ring $S$. The principles used resemble those due to Chiribella, D'Ariano and Perinotti. Unlike previous reconstructions, our axioms and proof are fully categorical in nature, in particular not requiring tomography assumptions. Specialising the result to probabilistic theories we obtain either traditional quantum theory with $S$ being the complex numbers, or that over real Hilbert spaces with $S$ being the reals.

    更新日期:2020-01-17
  • Advances in Symmetry Breaking for SAT Modulo Theories
    arXiv.cs.LO Pub Date : 2019-08-02
    Saket Dingliwal; Ronak Agarwal; Happy Mittal; Parag Singla

    Symmetry breaking is a popular technique to reduce the search space for SAT solving by exploiting the underlying symmetry over variables and clauses in a formula. The key idea is to first identify sets of assignments which fall in the same symmetry class, and then impose ordering constraints, called Symmetry Breaking Predicates (SBPs), such that only one (or a small subset) of these assignments is allowed to be a solution of the original SAT formula. While this technique has been exploited extensively in the SAT literature, there is little work on using symmetry breaking for SAT Modulo Theories (SMT). In SMT, logical constraints in SAT theories are combined with another set of theory operations defined over non-Boolean variables such as integers, reals, etc. SMT solvers typically use a combination of SAT solving techniques augmented with calls to the theory solver. In this work, we take up the advances in SAT symmetry breaking and apply them to the domain of SMT. Our key technical contribution is the formulation of symmetry breaking over the Boolean skeleton variables, which are placeholders for actual theory operations in SMT solving. These SBPs are then applied over the SAT solving part of the SMT solver. We implement our SBP ideas on top of CVC4, which is a state-of-the-art SMT solver. Our approach can result in significantly faster solutions on several benchmark problems compared to the state-of-the-art. Our final solver is a hybrid of the original CVC4 solver, and an SBP based solver, and can solve up to 3.8% and 3.1% more problems in the QF_NIA category of 2018 and 2019 SMT benchmarks, respectively, compared to CVC4, the top performer in this category.

    更新日期:2020-01-17
  • Gillian: Compositional Symbolic Execution for All
    arXiv.cs.LO Pub Date : 2020-01-14
    José Fragoso Santos; Petar Maksimović; Sacha-Élie Ayoun; Philippa Gardner

    We present Gillian, a language-independent framework for the development of compositional symbolic analysis tools. Gillian supports three flavours of analysis: whole-program symbolic testing, full verification, and bi-abduction. It comes with fully parametric meta-theoretical results and a modular implementation, designed to minimise the instantiation effort required of the user. We evaluate Gillian by instantiating it to JavaScript and C, and perform its analyses on a set of data-structure libraries, obtaining results that indicate that Gillian is robust enough to reason about real-world programming languages.

    更新日期:2020-01-16
  • Circular Proofs in First-Order Linear Logic with Least and Greatest Fixed Points
    arXiv.cs.LO Pub Date : 2020-01-15
    Farzaneh Derakhshan; Frank Pfenning

    Inductive and coinductive structures are everywhere in mathematics and computer science. The induction principle is well known and fully exploited to reason about inductive structures like natural numbers and finite lists. To prove theorems about coinductive structures such as infinite streams and infinite trees we can appeal to bisimulation or the coinduction principle. Pure inductive and coinductive types however are not the only data structures we are interested to reason about. In this paper we present a calculus to prove theorems about mutually defined inductive and coinductive data types. Derivations are carried out in an infinitary sequent calculus for first order intuitionistic multiplicative additive linear logic with fixed points. We enforce a condition on these derivations to ensure their cut elimination property and thus validity. Our calculus is designed to reason about linear properties but we also allow appealing to first order theories such as arithmetic, by adding an adjoint downgrade modality. We show the strength of our calculus by proving several theorems on (mutual) inductive and coinductive data types.

    更新日期:2020-01-16
  • Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry
    arXiv.cs.LO Pub Date : 2020-01-15
    Timothy van Bremen; Ondrej Kuzelka

    We study the symmetric weighted first-order model counting task and present ApproxWFOMC, a novel anytime method for efficiently bounding the weighted first-order model count in the presence of an unweighted first-order model counting oracle. The algorithm has applications to inference in a variety of first-order probabilistic representations, such as Markov logic networks and probabilistic logic programs. Crucially for many applications, we make no assumptions on the form of the input sentence. Instead, our algorithm makes use of the symmetry inherent in the problem by imposing cardinality constraints on the number of possible true groundings of a sentence's literals. Realising the first-order model counting oracle in practice using the approximate hashing-based model counter ApproxMC3, we show how our algorithm outperforms existing approximate and exact techniques for inference in first-order probabilistic models. We additionally provide PAC guarantees on the generated bounds.

    更新日期:2020-01-16
  • De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic
    arXiv.cs.LO Pub Date : 2016-02-19
    Ross Horne; Alwen Tiu; Bogdan Aman; Gabriel Ciobanu

    This paper explores the proof theory necessary for recommending an expressive but decidable first-order system, named MAV1, featuring a de Morgan dual pair of nominal quantifiers. These nominal quantifiers called `new' and `wen' are distinct from the self-dual Gabbay-Pitts and Miller-Tiu nominal quantifiers. The novelty of these nominal quantifiers is they are polarised in the sense that `new' distributes over positive operators while `wen' distributes over negative operators. This greater control of bookkeeping enables private names to be modelled in processes embedded as formulae in MAV1. The technical challenge is to establish a cut elimination result, from which essential properties including the transitivity of implication follow. Since the system is defined using the calculus of structures, a generalisation of the sequent calculus, novel techniques are employed. The proof relies on an intricately designed multiset-based measure of the size of a proof, which is used to guide a normalisation technique called splitting. The presence of equivariance, which swaps successive quantifiers, induces complex inter-dependencies between nominal quantifiers, additive conjunction and multiplicative operators in the proof of splitting. Every rule is justified by an example demonstrating why the rule is necessary for soundly embedding processes and ensuring that cut elimination holds.

    更新日期:2020-01-16
  • Reinforcement Learning of Control Policy for Linear Temporal Logic Specifications Using Limit-Deterministic Büchi Automata
    arXiv.cs.LO Pub Date : 2020-01-14
    Ryohei Oura; Ami Sakakibara; Toshimitsu Ushio

    This letter proposes a novel reinforcement learning method for the synthesis of a control policy satisfying a control specification described by a linear temporal logic formula. We assume that the controlled system is modeled by a Markov decision process (MDP). We transform the specification to a limit-deterministic B\"uchi automaton (LDBA) with several accepting sets that accepts all infinite sequences satisfying the formula. The LDBA is augmented so that it explicitly records the previous visits to accepting sets. We take a product of the augmented LDBA and the MDP, based on which we define a reward function. The agent gets rewards whenever state transitions are in an accepting set that has not been visited for a certain number of steps. Consequently, sparsity of rewards is relaxed and optimal circulations among the accepting sets are learned. We show that the proposed method can learn an optimal policy when the discount factor is sufficiently close to one.

    更新日期:2020-01-15
  • A (Simplified) Supreme Being Necessarily Exists -- Says the Computer!
    arXiv.cs.LO Pub Date : 2020-01-14
    Christoph Benzmüller

    A simplified variant of Kurt G\"odel's modal ontological argument is presented. Some of G\"odel's, resp. Scott's, premises are modified, others are dropped, and modal collapse is avoided. The emended argument is shown valid already in quantified modal logic K. The presented simplifications have been computationally explored utilising latest knowledge representation and reasoning technology based on higher-order logic. The paper thus illustrates how modern symbolic AI technology can contribute new knowledge to formal philosophy and theology.

    更新日期:2020-01-15
  • A circular proof system for the hybrid mu-calculus
    arXiv.cs.LO Pub Date : 2020-01-14
    Sebastian Enqvist

    We present a circular and cut-free proof system for the hybrid mu-calculus and prove its soundness and completeness. The system uses names for fixpoint unfoldings, like the circular proof system for the mu-calculus previously developed by Stirling.

    更新日期:2020-01-15
  • Characterizing Polynomial Ramsey Quantifiers
    arXiv.cs.LO Pub Date : 2016-01-10
    Ronald de Haan; Jakub Szymanik

    Ramsey quantifiers are a natural object of study not only for logic and computer science, but also for the formal semantics of natural language. Restricting attention to finite models leads to the natural question whether all Ramsey quantifiers are either polynomial-time computable or NP-hard, and whether we can give a natural characterization of the polynomial-time computable quantifiers. In this paper, we first show that there exist intermediate Ramsey quantifiers and then we prove a dichotomy result for a large and natural class of Ramsey quantifiers, based on a reasonable and widely-believed complexity assumption. We show that the polynomial-time computable quantifiers in this class are exactly the constant-log-bounded Ramsey quantifiers.

    更新日期:2020-01-15
  • Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems
    arXiv.cs.LO Pub Date : 2019-04-15
    Nicolas Behr; Vincent Danos; Ilias Garnier

    We develop a novel method to analyze the dynamics of stochastic rewriting systems evolving over finitary adhesive, extensive categories. Our formalism is based on the so-called rule algebra framework and exhibits an intimate relationship between the combinatorics of the rewriting rules (as encoded in the rule algebra) and the dynamics which these rules generate on observables (as encoded in the stochastic mechanics formalism). We introduce the concept of combinatorial conversion, whereby under certain technical conditions the evolution equation for (the exponential generating function of) the statistical moments of observables can be expressed as the action of certain differential operators on formal power series. This permits us to formulate the novel concept of moment-bisimulation, whereby two dynamical systems are compared in terms of their evolution of sets of observables that are in bijection. In particular, we exhibit non-trivial examples of graphical rewriting systems that are moment-bisimilar to certain discrete rewriting systems (such as branching processes or the larger class of stochastic chemical reaction systems). Our results point towards applications of a vast number of existing well-established exact and approximate analysis techniques developed for chemical reaction systems to the far richer class of general stochastic rewriting systems.

    更新日期:2020-01-15
  • Complexity of controlled bad sequences over finite sets of $\mathbb{N}^d$
    arXiv.cs.LO Pub Date : 2019-09-04
    A. R. Balasubramanian

    We provide upper and lower bounds for the length of controlled bad sequences over the majoring and the minoring orderings of finite sets of $\mathbb{N}^d$. The results are obtained by bounding the length of such sequences by functions from the Cichon hierarchy. This allows us to translate these results to bounds over the fast-growing complexity classes. The obtained bounds are proven to be tight for the majoring ordering, which solves a problem left open by Abriola, Figueira and Senno (Theor. Comp. Sci, Vol. 603). Finally, we use the results on controlled bad sequences to prove upper bounds for the emptiness problem of some classes of automata.

    更新日期:2020-01-15
  • Predicate Transformer Semantics for Hybrid Systems: Verification Components for Isabelle/HOL
    arXiv.cs.LO Pub Date : 2019-09-12
    Jonathan Julián Huerta y Munive; Georg Struth

    We present a semantic framework for the deductive verification of hybrid systems with Isabelle/HOL. It supports reasoning about the temporal evolutions of hybrid programs in the style of differential dynamic logic modelled by flows or invariant sets for vector fields. We introduce the semantic foundations of our approach and summarise their Isabelle formalisation as well as the resulting verification components. A series of examples shows our approach at work.

    更新日期:2020-01-15
  • Smarter Features, Simpler Learning?
    arXiv.cs.LO Pub Date : 2019-11-15
    Sarah WinklerUniversity of Verona; Georg MoserUniversity of Innsbruck

    Earlier work on machine learning for automated reasoning mostly relied on simple, syntactic features combined with sophisticated learning techniques. Using ideas adopted in the software verification community, we propose the investigation of more complex, structural features to learn from. These may be exploited to either learn beneficial strategies for tools, or build a portfolio solver that chooses the most suitable tool for a given problem. We present some ideas for features of term rewrite systems and theorem proving problems.

    更新日期:2020-01-15
  • ReluDiff: Differential Verification of Deep Neural Networks
    arXiv.cs.LO Pub Date : 2020-01-10
    Brandon Paulsen; Jingbo Wang; Chao Wang

    As deep neural networks are increasingly being deployed in practice, their efficiency has become an important issue. While there are compression techniques for reducing the network's size, energy consumption and computational requirement, they only demonstrate empirically that there is no loss of accuracy, but lack formal guarantees of the compressed network, e.g., in the presence of adversarial examples. Existing verification techniques such as Reluplex, ReluVal, and DeepPoly provide formal guarantees, but they are designed for analyzing a single network instead of the relationship between two networks. To fill the gap, we develop a new method for differential verification of two closely related networks. Our method consists of a fast but approximate forward interval analysis pass followed by a backward pass that iteratively refines the approximation until the desired property is verified. We have two main innovations. During the forward pass, we exploit structural and behavioral similarities of the two networks to more accurately bound the difference between the output neurons of the two networks. Then in the backward pass, we leverage the gradient differences to more accurately compute the most beneficial refinement. Our experiments show that, compared to state-of-the-art verification tools, our method can achieve orders-of-magnitude speedup and prove many more properties than existing tools.

    更新日期:2020-01-14
  • Deciding the Loosely Guarded Fragment and Querying Its Horn Fragment Using Resolution
    arXiv.cs.LO Pub Date : 2020-01-12
    Sen Zheng; Renate A. Schmidt

    We consider the following query answering problem: Given a Boolean conjunctive query and a theory in the Horn loosely guarded fragment, the aim is to determine whether the query is entailed by the theory. In this paper, we present a resolution decision procedure for the loosely guarded fragment, and use such a procedure to answer Boolean conjunctive queries against the Horn loosely guarded fragment. The Horn loosely guarded fragment subsumes classes of rules that are prevalent in ontology-based query answering, such as Horn ALCHOI and guarded existential rules. Additionally, we identify star queries and cloud queries, which using our procedure, can be answered against the loosely guarded fragment.

    更新日期:2020-01-14
  • Games Where You Can Play Optimally with Finite Memory
    arXiv.cs.LO Pub Date : 2020-01-12
    Patricia Bouyer; Stéphane Le Roux; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove

    For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller synthesis, which can be rephrased through the game-theoretic metaphor as the quest for a winning strategy of the system in a game against its antagonistic environment. Depending on the specification, optimal strategies might be simple or quite complex, for example having to use (possibly infinite) memory. Hence, research strives to understand which settings allow for simple strategies. In 2005, Gimbert and Zielonka provided a complete characterization of preference relations (a formal framework to model specifications and game objectives) that admit memoryless optimal strategies for both players. In the last fifteen years however, practical applications have driven the community toward games with complex or multiple objectives, where memory --- finite or infinite --- is almost always required. Despite much effort, the exact frontiers of the class of preference relations that admit finite-memory optimal strategies still elude us. In this work, we establish a complete characterization of preference relations that admit optimal strategies using arena-independent finite memory, generalizing the work of Gimbert and Zielonka to the finite-memory case. We also prove an equivalent to their celebrated corollary of utmost practical interest: if both players have optimal (arena-independent-)finite-memory strategies in all one-player games, then it is also the case in all two-player games. Finally, we pinpoint the boundaries of our results with regard to the literature: our work completely covers the case of arena-independent memory (e.g., multiple parity objectives, lower- and upper-bounded energy objectives), and paves the way to the arena-dependent case (e.g., multiple lower-bounded energy objectives).

    更新日期:2020-01-14
  • Commonly Knowingly Whether
    arXiv.cs.LO Pub Date : 2020-01-12
    Jie Fan; Davide Grossi; Barteld Kooi; Xingchi Su; Rineke Verbrugge

    This paper introduces `commonly knowing whether', a non-standard version of classical common knowledge which is defined on the basis of `knowing whether', instead of classical `knowing that'. After giving five possible definitions of this concept, we explore the logical relations among them both in the multi-agent case and in the single-agent case. We focus on one definition and treat it as a modal operator. It is found that the expressivity of this operator is incomparable with the classical common knowledge operator. Moreover, some special properties of it over binary-tree models and KD45-models are investigated.

    更新日期:2020-01-14
  • Interactive Visualization of Saturation Attempts in Vampire
    arXiv.cs.LO Pub Date : 2020-01-13
    Bernhard Gleiss; Laura Kovacs; Lena Schnedlitz

    Many applications of formal methods require automated reasoning about system properties, such as system safety and security. To improve the performance of automated reasoning engines, such as SAT/SMT solvers and first-order theorem prover, it is necessary to understand both the successful and failing attempts of these engines towards producing formal certificates, such as logical proofs and/or models. Such an analysis is challenging due to the large number of logical formulas generated during proof/model search. In this paper we focus on saturation-based first-order theorem proving and introduce the SATVIS tool for interactively visualizing saturation-based proof attempts in first-order theorem proving. We build SATVIS on top of the world-leading theorem prover VAMPIRE, by interactively visualizing the saturation attempts of VAMPIRE in SATVIS. Our work combines the automatic layout and visualization of the derivation graph induced by the saturation attempt with interactive transformations and search functionality. As a result, we are able to analyze and debug (failed) proof attempts of VAMPIRE. Thanks to its interactive visualisation, we believe SATVIS helps both experts and non-experts in theorem proving to understand first-order proofs and analyze/refine failing proof attempts of first-order provers.

    更新日期:2020-01-14
  • Possibility and prevention of inappropriate data manipulation in Polar Data Journal
    arXiv.cs.LO Pub Date : 2020-01-13
    Takeshi Terui; Yasuyuki Minamiyama; Kazutsuna Yamaji

    Stakeholders in the scientific field must always maintain transparency in the process of publishing research results in journals. Unfortunately, although research misconduct has stopped, certain forms of manipulation continue to appear in other forms. As new techniques of scientific publishing develop, science stakeholders need to examine the possibility of inappropriate activity in these new platforms. The National Institute of Polar Research in Japan launched a new data journal Polar Data Journal (PDJ) in 2017 to review the quality of data obtained in the polar region. To maintain transparency in this new data journal, we investigated the possibility of inappropriate data manipulation in peer reviews before the inception of this journal. We clarified inappropriate activity for the data in the peer review and considered preventive measures. We designed a specific workflow for PDJ. This included two measures: (i) the comparison of hash values in the review process and (ii) open peer review report publishing. Using the hash value comparison, we detected two instances of inappropriate data manipulation after the start of the journal. This research will help improve workflow in data journals and data repositories.

    更新日期:2020-01-14
  • (Newtonian) Space-Time Algebra
    arXiv.cs.LO Pub Date : 2019-12-20
    James E. Smith

    The space-time (s-t) algebra provides a mathematical model for communication and computation using values encoded as events in discretized linear (Newtonian) time. Consequently, the input-output behavior of s-t algebra and implemented functions are consistent with the flow of time. The s-t algebra and functions are formally defined. A network design framework for s-t functions is describe, and the design of temporal neural networks, a form of spiking neural networks, is discussed as an extended case study. Finally, the relationship with Allen's interval algebra is briefly discussed.

    更新日期:2020-01-14
  • An extended quantum process algebra (eQPAlg) approach for distributed quantum systems
    arXiv.cs.LO Pub Date : 2020-01-06
    Salman Haider; Dr. Syed Asad Raza Kazmi

    In this work, we have expounded the communication procedure of quantum systems by means of process algebra. The main objective of our research effort is to formally represent the communication between distributed quantum systems. In this new proposed communication model we have ameliorated the existing rules of Lalire's quantum process algebra QPAlg. We have brought some important modification in QPAlg by introducing the concept of formally specifying the Quantum teleportation protocol. We have further introduced the formal description of protocol by using programs that best explains its working and satisfies the specification. Examples have been provided to describe the working of the improved algebra that formally explain the sending and receiving of both classical as well as quantum data, keeping in mind the principal features of quantum mechanics.

    更新日期:2020-01-14
  • On Concept of Petri Nets Receptors and Effectors
    arXiv.cs.LO Pub Date : 2019-12-18
    Alexander Yu. Chunikhin; Marina D. Sviatnenko

    New subclasses of Petri nets - Petri nets receptors and Petri nets effectors are introduced. The introduction/exclusion of such substructures in the main Petri net may be fulfilled in accordance with the Fusion/Defusion principles. We propose two pairs of entities: position marking receptor (effector) and transition marking receptor (effector), which allow to observe parameters of the main Petri net and, if necessary, to carry out their regulation.

    更新日期:2020-01-14
  • On the linear structure of cones
    arXiv.cs.LO Pub Date : 2020-01-13
    Thomas EhrhardIRIF

    For encompassing the limitations of probabilistic coherence spaces which do not seem to provide natural interpretations of continuous data types such as the real line, Ehrhard and al. introduced a model of probabilistic higher order computation based on (positive) cones, and a class of totally monotone functions that they called "stable". Then Crubill{\'e} proved that this model is a conservative extension of the earlier probabilistic coherence space model. We continue these investigations by showing that the category of cones and linear and Scott-continuous functions is a model of intuitionistic linear logic. To define the tensor product, we use the special adjoint functor theorem, and we prove that this operation is and extension of the standard tensor product of probabilistic coherence spaces. We also show that these latter are dense in cones, thus allowing to lift the main properties of the tensor product of probabilistic coherence spaces to general cones. Last we define in the same way an exponential of cones and extend measurability to these new operations.

    更新日期:2020-01-14
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
2020新春特辑
限时免费阅读临床医学内容
ACS材料视界
科学报告最新纳米科学与技术研究
清华大学化学系段昊泓
自然科研论文编辑服务
加州大学洛杉矶分校
上海纽约大学William Glover
南开大学化学院周其林
课题组网站
X-MOL
北京大学分子工程苏南研究院
华东师范大学分子机器及功能材料
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug