• arXiv.cs.LO Pub Date : 2020-09-16

Property testing algorithms are highly efficient algorithms, that come with probabilistic accuracy guarantees. For a property P, the goal is to distinguish inputs that have P from those that are far from having P with high probability correctly, by querying only a small number of local parts of the input. In property testing on graphs, the distance is measured by the number of edge modifications (additions

更新日期：2020-09-18
• arXiv.cs.LO Pub Date : 2020-09-16
Julien LangeRoyal Holloway, University of London; Anastasia MavridouKBR/NASA Ames Research Center; Larisa SafinaINRIA; Alceste ScalasDTU Compute, Technical University of Denmark

This volume contains the proceedings of ICE'20, the 13th Interaction and Concurrency Experience, which was held online on the 19th of June 2020, as a satellite event of DisCoTec'20. The ICE workshop series features a distinguishing review and selection procedure, allowing PC members to interact anonymously with authors. As in the past 12 editions, this interaction considerably improved the accuracy

更新日期：2020-09-18
• arXiv.cs.LO Pub Date : 2020-09-15
Robin Hirsch; Jaš Šemrl

Composition and demonic refinement $\sqsubseteq$ of binary relations are defined by \begin{align*} (x, y)\in (R;S)&\iff \exists z((x, z)\in R\wedge (z, y)\in S) R\sqsubseteq S&\iff (dom(S)\subseteq dom(R) \wedge R\restriction_{dom(S)}\subseteq S) \end{align*} where $dom(S)=\{x:\exists y (x, y)\in S\}$ and $R\restriction_{dom(S)}$ denotes the restriction of $R$ to pairs $(x, y)$ where $x\in dom(S)$

更新日期：2020-09-16
• arXiv.cs.LO Pub Date : 2020-09-15
Brendan FongMIT; David SpivakMIT

Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free regular category FRg(T) on a set T. From this point of view, regular theories are certain monoidal 2-functors from a suitable 2-category of contexts -- the 2-category

更新日期：2020-09-16
• arXiv.cs.LO Pub Date : 2020-09-15
Philip Johnson-FreydSandia National Laboratories; Jon AytacSandia National Laboratories; Geoffrey HuletteSandia National Laboratories

TLA is a popular temporal logic for writing stuttering-invariant specifications of digital systems. However, TLA lacks higher-order features useful for specifying modern software written in higher-order programming languages. We use categorical techniques to recast a real-time semantics for TLA in terms of the actions of a group of time dilations, or "stutters," and an extension by a monoid incorporating

更新日期：2020-09-16
• arXiv.cs.LO Pub Date : 2020-09-15
Neil GhaniUniversity of Strathclyde; Clemens KupkeUniversity of Strathclyde; Alasdair LambertUniversity of Strathclyde; Fredrik Nordvall ForsbergUniversity of Strathclyde

We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category, which can be used to compose probabilistic games in parallel and sequentially. We also consider morphisms between games, and show that intuitive constructions give

更新日期：2020-09-16
• arXiv.cs.LO Pub Date : 2020-09-14
John Baez; Bob Coecke

Applied Category Theory is a new conference series. All papers are carefully refereed, and the bar for acceptance is high. This 1st occurrence in this format resulted in some 70 submitted papers and 150 attendants. The conference is part of the Compositionally family, a new diamond open access journal.

更新日期：2020-09-15
• arXiv.cs.LO Pub Date : 2020-09-12
Christian Antic

Describing complex objects as the composition of elementary ones is a common strategy in computer science and science in general. This paper contributes to the foundations of knowledge representation and database theory by introducing and studying the sequential composition of propositional Horn theories. Specifically, we show that the notion of composition gives rise to a family of monoids and near-semirings

更新日期：2020-09-15
• arXiv.cs.LO Pub Date : 2020-09-14
Marko Marković; Stevan Gostojić

This paper proposes a knowledge-based legal document assembly method that uses a machine-readable representation of knowledge of legal professionals. This knowledgebase has two components - the formal knowledge of legal norms represented as a rule-base and the tacit knowledge represented by a document template. A document assembly system is developed as a proof of concept. It collects input data in

更新日期：2020-09-15
• arXiv.cs.LO Pub Date : 2020-09-14
Felicidad Aguado; Pedro Cabalar; Martin Dieguez; Gilberto Perez; Torsten Schaub; Anna Schuhmann; Concepcion Vidal

We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving. Such programs are the result of combining usual rules with temporal modal operators, as in Linear-time Temporal Logic (LTL). We focus on recent results of the non-monotonic formalism called Temporal Equilibrium Logic (TEL) that is defined for the

更新日期：2020-09-15
• arXiv.cs.LO Pub Date : 2020-09-14
Bishwamittra Ghosh; Debabrota Basu; Kuldeep S. Meel

As a technology ML is oblivious to societal good or bad, and thus, the field of fair machine learning has stepped up to propose multiple mathematical definitions, algorithms, and systems to ensure different notions of fairness in ML applications. Given the multitude of propositions, it has become imperative to formally verify the fairness metrics satisfied by different algorithms on different datasets

更新日期：2020-09-15
• arXiv.cs.LO Pub Date : 2020-09-14
Anna Lukina; Christian Schilling; Thomas A. Henzinger

Machine-learning techniques achieve excellent performance in modern applications. In particular, neural networks enable training classifiers, often used in safety-critical applications, to complete a variety of tasks without human supervision. Neural-network models have neither the means to identify what they do not know nor to interact with the human user before making a decision. When deployed in

更新日期：2020-09-15
• arXiv.cs.LO Pub Date : 2020-09-13
Alessandro Daniele; Luciano Serafini

In the recent past, there has been a growing interest in Neural-Symbolic Integration frameworks, i.e., hybrid systems that integrate connectionist and symbolic approaches: on the one hand, neural networks show remarkable abilities to learn from a large amount of data in presence of noise, on the other, pure symbolic methods can perform reasoning as well as learning from few samples. By combining the

更新日期：2020-09-15
• arXiv.cs.LO Pub Date : 2020-09-11
Yehia Abd Alrahman; Victor Braberman; Nicolás D'Ippolito; Nir Piterman; Sebastián Uchitel

A controller for a Discrete Event System must achieve its goals despite that its environment being capable of resolving race conditions between controlled and uncontrolled events.Assuming that the controller loses all races is sometimes unrealistic. In many cases, a realistic assumption is that the controller sometimes wins races and is fast enough to perform multiple actions without being interrupted

更新日期：2020-09-14
• arXiv.cs.LO Pub Date : 2020-09-11
Carlo Angiuli; Evan Cavallo; Anders Mörtberg; Max Zeuner

In their usual form, representation independence metatheorems provide an external guarantee that two implementations of an abstract interface are interchangeable when they are related by an operation-preserving correspondence. If our programming language is dependently-typed, however, we would like to appeal to such invariance results within the language itself, in order to obtain correctness theorems

更新日期：2020-09-14
• arXiv.cs.LO Pub Date : 2020-09-11
Luca Bortolussi; Giuseppe Maria Gallo; Laura Nenzi

We discuss how to define a kernel for Signal Temporal Logic (STL) formulae. Such a kernel allows us to embed the space of formulae into a Hilbert space, and opens up the use of kernel-based machine learning algorithms in the context of STL. We show an application of this idea to a regression problem in formula space for probabilistic models.

更新日期：2020-09-14
• arXiv.cs.LO Pub Date : 2020-09-08
Flavio Ferrarotti; Senen Gonzalez; Klaus-Dieter Schewe; Jose Maria Turull-Torres

Complexity theory can be viewed as the study of the relationship between computation and applications, understood the former as complexity classes and the latter as problems. Completeness results are clearly central to that view. Many natural algorithms resulting from current applications have polylogarithmic time (PolylogTime) or space complexity (PolylogSpace). The classical Karp notion of complete

更新日期：2020-09-10
• arXiv.cs.LO Pub Date : 2020-09-08
Klaus-Dieter Schewe; Yamine Ait-Ameur; Sarah Benyagoub

Choreographies prescribe the rendez-vous synchronisation of messages in a system of communicating finite state machines. Such a system is called realisable, if the traces of the prescribed communication coincide with those of the asynchronous system of peers, where the communication channels either use FIFO queues or multiset mailboxes. In a recent article realisability was characterised by two necessary

更新日期：2020-09-10
• arXiv.cs.LO Pub Date : 2020-09-08
Eitetsu Ken; Kenji Tojo; Kazuki Watanabe; Masaki Natori

When we investigate a type system, it is helpful if we can establish the well-foundedness of types or terms with respect to a certain hierarchy, and the Extended Calculus of Constructions (called ECC, defined and studied comprehensively in [Luo, 1994]) is no exception. However, under a very natural hierarchy relation, the well-foundedness of terms does not hold generally. In this article, the well-foundedness

更新日期：2020-09-10
• arXiv.cs.LO Pub Date : 2020-09-07
Alexander Rabinovich; Doron Tiferet

An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k>0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if there is k, such that for every input it has at most k accepting computations. An automaton is finitely (respectively, countably) ambiguous if for every input it has at most finitely

更新日期：2020-09-08
• arXiv.cs.LO Pub Date : 2020-09-06
Carlos G. Lopez Pombo; Marcelo F. Frias; Thomas S. E. Maibaum

Fork algebras are an extension of relation algebras obtained by extending the set of logical symbols with a binary operator called fork. This class of algebras were introduced by Haeberer and Veloso in the early 90's aiming at enriching relation algebra, an already successful language for program specification, with the capability of expressing some form of parallel computation. The further study of

更新日期：2020-09-08
• arXiv.cs.LO Pub Date : 2020-09-07

Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the price of spending time in a state and executing an action, respectively). The goals of the players are to minimise and maximise the price to reach a target location, respectively. We consider priced timed games with one clock and arbitrary integer weights

更新日期：2020-09-08
• arXiv.cs.LO Pub Date : 2020-09-02
Azlan Iqbal

We present an algorithm that correctly updates the Forsyth-Edwards Notation (FEN) chessboard character string after any move is made without the need for an intermediary array representation of the board. In particular, this relates to software that have to do with chess, certain chess variants and possibly even similar board games with comparable position representation. Even when performance may

更新日期：2020-09-08
• arXiv.cs.LO Pub Date : 2020-09-07
Markus Iser; Luca Springer; Carsten Sinz

Experimental evaluation is an integral part in the design process of algorithms. Publicly available benchmark instances are widely used to evaluate methods in SAT solving. For the interpretation of results and the design of algorithm portfolios their attributes are crucial. Capturing the interrelation of benchmark instances and their attributes is considerably simplified through our specification of

更新日期：2020-09-08
• arXiv.cs.LO Pub Date : 2020-09-03
Nicolai Kraus

Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory." Most approaches are at least loosely based on Dybjer's categories with families (CwF's) and come with a type CON of contexts, a type family TY indexed over it modelling types, and so on. This works well in

更新日期：2020-09-08
• arXiv.cs.LO Pub Date : 2020-09-03
Erwan Mahe; Boutheina Bannour; Christophe Gaston; Arnault Lapitre; Pascale Le Gall

Interaction models describe the exchange of messages between the different components of distributed systems. We have previously defined a small-step operational semantics for interaction models. The paper extends this work by presenting an approach for checking the validity of multi-traces against interaction models. A multi-trace is a collection of traces (sequences of emissions and receptions),

更新日期：2020-09-05
• arXiv.cs.LO Pub Date : 2020-09-02
Felipe S. Abrahão; Klaus Wehmuth; Artur Ziviani

Challenging the standard notion of totality in computable functions, one has that, given any sufficiently expressive formal axiomatic system, there are total functions that, although computable and "intuitively" understood as being total, cannot be proved to be total. In this article we show that this implies the existence of an infinite hierarchy of time complexity classes whose representative members

更新日期：2020-09-03
• arXiv.cs.LO Pub Date : 2020-09-02
Clemens Kupke; Dirk Pattinson; Lutz Schröder

We establish a generic upper bound ExpTime for reasoning with global assumptions (also known as TBoxes) in coalgebraic modal logics. Unlike earlier results of this kind, our bound does not require a tractable set of tableau rules for the instance logics, so that the result applies to wider classes of logics. Examples are Presburger modal logic, which extends graded modal logic with linear inequalities

更新日期：2020-09-03
• arXiv.cs.LO Pub Date : 2020-09-01
Colin Shea-Blymyer; Houssam Abbas

We consider the pressing question of how to model, verify, and ensure that autonomous systems meet certain \textit{obligations} (like the obligation to respect traffic laws), and refrain from impermissible behavior (like recklessly changing lanes). Temporal logics are heavily used in autonomous system design; however, as we illustrate here, temporal (alethic) logics alone are inappropriate for reasoning

更新日期：2020-09-03
• arXiv.cs.LO Pub Date : 2020-09-01
Yannick Forster

"Church's thesis" ($\mathsf{CT}$) as an axiom in constructive logic states that every total function of type $\mathbb{N} \to \mathbb{N}$ is computable, i.e. definable in a model of computation. $\mathsf{CT}$ is inconsistent in both classical mathematics and in Brouwer's intuitionism since it contradicts Weak K\"onig's Lemma and the fan theorem, respectively. Recently, $\mathsf{CT}$ was proved consistent

更新日期：2020-09-02
• arXiv.cs.LO Pub Date : 2020-08-31
Davide AnconaDIBRIS, University of Genova, Italy; Angelo FerrandoUniversity of Manchester, UK; Viviana MascardiDIBRIS, University of Genova, Italy

Runtime verification (RV) consists in dynamically verifying that the event traces generated by single runs of a system under scrutiny (SUS) are compliant with the formal specification of its expected properties. RML (Runtime Monitoring Language) is a simple but expressive Domain Specific Language for RV; its semantics is based on a trace calculus formalized by a deterministic rewriting system which

更新日期：2020-09-02
• arXiv.cs.LO Pub Date : 2020-08-31
Claire Dross; Carlo A. Furia; Marieke Huisman; Rosemary Monahan; Peter Müller

VerifyThis is a series of program verification competitions that emphasize the human aspect: participants tackle the verification of detailed behavioral properties---something that lies beyond the capabilities of fully automatic verification, and requires instead human expertise to suitably encode programs, specifications, and invariants. This paper describes the 8th edition of VerifyThis, which took

更新日期：2020-09-01
• arXiv.cs.LO Pub Date : 2020-08-31
Martin Leinberger; Philipp Seifer; Tjitze Rienstra; Ralf Lämmel; Steffen Staab

The Shapes Constraint Language (SHACL) allows for formalizing constraints over RDF data graphs. A shape groups a set of constraints that may be fulfilled by nodes in the RDF graph. We investigate the problem of containment between SHACL shapes. One shape is contained in a second shape if every graph node meeting the constraints of the first shape also meets the constraints of the second. To decide

更新日期：2020-09-01
• arXiv.cs.LO Pub Date : 2020-08-31
Cristina Borralleras; Daniel Larraz; Albert Oliveras; Enric Rodriguez-Carbonell; Albert Rubio

We present new methods for solving the Satisfiability Modulo Theories problem over the theory of Quantifier-Free Non-linear Integer Arithmetic, SMT(QF-NIA), which consists in deciding the satisfiability of ground formulas with integer polynomial constraints. Following previous work, we propose to solve SMT(QF-NIA) instances by reducing them to linear arithmetic: non-linear monomials are linearized

更新日期：2020-09-01
• arXiv.cs.LO Pub Date : 2020-08-31
Rob van GlabbeekData61, CSIRO

Whereas standard treatments of temporal logic are adequate for closed systems, having no run-time interactions with their environment, they fall short for reactive systems, interacting with their environments through synchronisation of actions. This paper introduces reactive temporal logic, a form of temporal logic adapted for the study of reactive systems. I illustrate its use by applying it to formulate

更新日期：2020-09-01
• arXiv.cs.LO Pub Date : 2020-08-31
Mark BouwmanEindhoven University of Technology; Bas LuttikEindhoven University of Technology; Wouter ScholsEindhoven University of Technology; Tim A. C. WillemseEindhoven University of Technology

In standard process algebra, parallel components do not share a common state and communicate through synchronisation. The advantage of this type of communication is that it facilitates compositional reasoning. For modelling and analysing systems in which parallel components operate on shared memory, however, the communication-through-synchronisation paradigm is sometimes less convenient. In this paper

更新日期：2020-09-01
• arXiv.cs.LO Pub Date : 2020-08-31
Bas LuttikEindhoven University of Technology

This note considers the notion of divergence-preserving branching bisimilarity. It briefly surveys results pertaining to the notion that have been obtained in the past one-and-a-half decade, discusses its role in the study of expressiveness of process calculi, and concludes with some suggestions for future work.

更新日期：2020-09-01
• arXiv.cs.LO Pub Date : 2020-08-29
Linda Brodo; Roberto Bruni; Moreno Falaschi

Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS pairs a set of entities with a set of reactions over them. Entities can be used to enable or inhibit each reaction, and are produced by reactions. Entities can also be provided by an external context. RS semantics is defined in terms of an (unlabelled) rewrite system: given the current set of entities

更新日期：2020-09-01
• arXiv.cs.LO Pub Date : 2020-08-31
Manfred Schmidt-SchaußGoethe-University, Frankfurt, Germany; David SabelLMU, Munich, Germany

Comparison of concurrent programming languages and correctness of program transformations in concurrency are the focus of this research. As criterion we use contextual semantics adapted to concurrency, where may -- as well as should -- convergence are observed. We investigate the relation between the synchronous pi-calculus and a core language of Concurrent Haskell (CH). The contextual semantics is

更新日期：2020-09-01
• arXiv.cs.LO Pub Date : 2020-08-30
Laura Giordano; Valentina Gliozzi; Daniele Theseider Dupré

Inthispaperwedescribeaconcept-wisemulti-preferencesemantics for description logic which has its root in the preferential approach for modeling defeasible reasoning in knowledge representation. We argue that this proposal, beside satisfying some desired properties, such as KLM postulates, and avoiding the drowning problem, also defines a plausible notion of semantics. We motivate the plausibility of

更新日期：2020-09-01
• arXiv.cs.LO Pub Date : 2020-08-28
Isabel Wingen; Philipp Körner

Benefits of static type systems are well-known: they offer guarantees that no type error will occur during runtime and, inherently, inferred types serve as documentation on how functions are called. On the other hand, many type systems have to limit expressiveness of the language because, in general, it is undecidable whether a given program is correct regarding types. Another concern that was not

更新日期：2020-08-31
• arXiv.cs.LO Pub Date : 2020-08-28
Philipp Körner; David Schneider; Michael Leuschel

The semantics and the recursive execution model of Prolog make it very natural to express language interpreters in form of AST (Abstract Syntax Tree) interpreters where the execution follows the tree representation of a program. An alternative implementation technique is that of bytecode interpreters. These interpreters transform the program into a compact and linear representation before evaluating

更新日期：2020-08-31
• arXiv.cs.LO Pub Date : 2020-08-27
Ornela DardhaUniversity of Glasgow; Jurriaan RotRadboud University

This volume contains the proceedings of EXPRESS/SOS 2020: the Combined 27th International Workshop on Expressiveness in Concurrency and the 17th Workshop on Structural Operational Semantics, which was held online, as an affiliated workshop of CONCUR 2020, the 31st International Conference on Concurrency Theory. The EXPRESS/SOS workshop series aims at bringing together researchers interested in the

更新日期：2020-08-31
• arXiv.cs.LO Pub Date : 2020-08-26
Petr Jancar; Petr Osicka; Zdenek Sawa

We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (LMCS 2016) [HLMT16] for simulation preorder of succinct one-counter nets (i.e., one-counter automata with no zero tests where counter increments and decrements are integers written in binary), by showing that all relations between bisimulation equivalence and simulation preorder are EXPSPACE-hard for these nets. We describe a reduction

更新日期：2020-08-28
• arXiv.cs.LO Pub Date : 2020-08-26
Rob van Glabbeek

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.

更新日期：2020-08-27
• arXiv.cs.LO Pub Date : 2020-08-25
Payal; Sangita Kansal

In this paper,the authors show the versatility of the Signed Petri Net (SPN) introduced by them by showing the equivalence between a Logic Signed Petri Net (LSPN) and Logic Petri Net (LPN).The capacity of each place in all these nets is at most one, i.e.,a place has either zero or one token in it.

更新日期：2020-08-27
• arXiv.cs.LO Pub Date : 2020-08-25
Arno Pauly

This is an informal survey of progress in Weihrauch complexity (cf arXiv:1707.03202) in the period 2018-2020. Open questions are emphasised.

更新日期：2020-08-26
• arXiv.cs.LO Pub Date : 2020-08-25
Samson Abramsky; Dan Marsden

In previous work, Abramsky, Dawar and Wang (LiCS 2017) and Abramsky and Shah (CSL 2018) have shown how a range of model comparison games which play a central role in finite model theory, including Ehrenfeucht-Fraisse, pebbling, and bisimulation games, can be captured in terms of resource-indexed comonads on the category of relational structures. Moreover, the coalgebras for these comonads capture important

更新日期：2020-08-26
• arXiv.cs.LO Pub Date : 2020-08-25
Vincent Danos; Tobias Heindel; Ricardo Honorato-Zimmer; Sandro Stucki

In this paper, we combine ideas from two different scientific traditions: 1) graph transformation systems (GTSs) stemming from the theory of formal languages and concurrency, and 2) mean field approximations (MFAs), a collection of approximation techniques ubiquitous in the study of complex dynamics. Using existing tools from algebraic graph rewriting, as well as new ones, we build a framework which

更新日期：2020-08-26
• arXiv.cs.LO Pub Date : 2020-08-24
Nathalie Bertrand; Patricia Bouyer; Thomas Brihaye; Paulin Fournier

Decisiveness has proven to be an elegant concept for denumerable Markov chains: it is general enough to encompass several natural classes of denumerable Markov chains, and is a sufficient condition for simple qualitative and approximate quantitative model checking algorithms to exist. In this paper, we explore how to extend the notion of decisiveness to Markov decision processes. Compared to Markov

更新日期：2020-08-25
• arXiv.cs.LO Pub Date : 2020-08-23
Samuel Teuber; Marko Kleine Büning; Carsten Sinz

Decision procedures for SMT problems based on the theory of bit-vectors are a fundamental component in state-of-the-art software and hardware verifiers. While very efficient in general, certain SMT instances are still challenging for state-of-the-art solvers (especially when such instances include computationally costly functions). In this work, we present an approach for the quantifier-free bit-vector

更新日期：2020-08-25
• arXiv.cs.LO Pub Date : 2020-08-24
Kousha Etessami; Emanuel Martinov

We study qualitative multi-objective reachability problems for Ordered Branching Markov Decision Processes (OBMDPs), or equivalently context-free MDPs, building on prior results for single-target reachability on Branching Markov Decision Processes (BMDPs). We provide two separate algorithms for "almost-sure" and "limit-sure" multi-target reachability for OBMDPs. Specifically, given an OBMDP, $\mathcal{A}$

更新日期：2020-08-25
• arXiv.cs.LO Pub Date : 2020-08-23

Although a great deal of attention has been paid to how conspiracy theories circulate on social media and their factual counterpart conspiracies, there has been little computational work done on describing their narrative structures. We present an automated pipeline for the discovery and description of the generative narrative frameworks of conspiracy theories on social media, and actual conspiracies

更新日期：2020-08-25
• arXiv.cs.LO Pub Date : 2020-08-21
Włodzimierz Drabent

We discuss how to implement backjumping (or intelligent backtracking) in Prolog programs by means of exception handling. This seems impossible in a general case. We provide a solution, which works in certain cases, in particular for binary programs. We also provide an approximate solution, for arbitrary programs.

更新日期：2020-08-25
• arXiv.cs.LO Pub Date : 2020-08-21
Jean-Marc Alliot; Marta Cialdea Mayer; Robert Demolombe; Martín Diéguez; Luis Fariñas del Cerro

Metabolic networks, formed by a series of metabolic pathways, are made of intracellular and extracellular reactions that determine the biochemical properties of a cell, and by a set of interactions that guide and regulate the activity of these reactions. Most of these pathways are formed by an intricate and complex network of chain reactions, and can be represented in a human readable form using graphs

更新日期：2020-08-24
• arXiv.cs.LO Pub Date : 2020-08-21
Jim de Groot; Helle Hvid Hansen; Alexander Kurz

We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only in terms of the coalgebra structure and the one-step modal semantics and, moreover, can be characterised by a form of relation lifting. Furthermore we compare

更新日期：2020-08-24
• arXiv.cs.LO Pub Date : 2020-08-20
Jialu Bao; Simon Docherty; Justin Hsu; Alexandra Silva

Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs. Verification methods for independence are still nascent, and existing methods cannot handle conditional independence. We extend the logic of bunched implications (BI) with a non-commutative conjunction and provide a model based on Markov kernels; conditional independence

更新日期：2020-08-24
• arXiv.cs.LO Pub Date : 2020-08-20
Shaoyun Shi; Hanxiong Chen; Weizhi Ma; Jiaxin Mao; Min Zhang; Yongfeng Zhang

Recent years have witnessed the success of deep neural networks in many research areas. The fundamental idea behind the design of most neural networks is to learn similarity patterns from data for prediction and inference, which lacks the ability of cognitive reasoning. However, the concrete ability of reasoning is critical to many theoretical and practical problems. On the other hand, traditional

更新日期：2020-08-24
• arXiv.cs.LO Pub Date : 2020-08-21
Nofar Carmeli; Martin Grohe; Peter Lindner; Christoph Standke

Probabilistic databases (PDBs) are probability spaces over database instances. They provide a framework for handling uncertainty in databases, as occurs due to data integration, noisy data, data from unreliable sources or randomized processes. Most of the existing theory literature investigated finite, tuple-independent PDBs (TI-PDBs) where the occurrences of tuples are independent events. Only recently

更新日期：2020-08-24
• arXiv.cs.LO Pub Date : 2020-08-20
Jeffrey M. Dudek; Vu H. N. Phan; Moshe Y. Vardi

We propose a unifying dynamic-programming framework to compute exact literal-weighted model counts of formulas in conjunctive normal form. At the center of our framework are project-join trees, which specify efficient project-join orders to apply additive projections (variable eliminations) and joins (clause multiplications). In this framework, model counting is performed in two phases. First, the

更新日期：2020-08-21
Contents have been reproduced by permission of the publishers.

down
wechat
bug