相关论文: Further Formalization of the Process Algebra CCS i…

We present a library-level formalisation of Hennessy-Milner Logic (HML) - a foundational logic for labelled transition systems (LTSs) - for the Lean Computer Science Library (CSLib). Our development includes the syntax, satisfaction…

We show that the axioms of Weak Kleene Algebra (WKA) are sound and complete for the theory of regular expressions modulo simulation equivalence, assuming their completeness for monodic trees (as conjectured by Takai and Furusawa).

In their seminal work, Atserias et al. and independently Pipatsrisawat and Darwiche in 2009 showed that CDCL solvers can simulate resolution proofs with polynomial overhead. However, previous work does not address the tightness of the…

Conformal algebras, recently introduced by Kac, encode an axiomatic description of the singular part of the operator product expansion in conformal field theory. The objective of this paper is to develop the theory of ``multi-dimensional''…

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

We introduce a notion of upper Green regular solutions to the Lax-Oleinik semi-group that is defined on the set of $C^0$ functions of a closed manifold via a Tonelli Lagrangian. Then we prove some weak $C^2$ convergence results to such a…

In this work, we consider the systematic error of quantum metrology by weak measurements under decoherence. We derive the systematic error of maximum likelihood estimation in general to the first-order approximation of a small deviation in…

We review the new approach to the theory of nonlinear $W$-algebras which is developed recently and called {\it conformal linearization}. In this approach $W$-algebras are embedded as subalgebras into some {\it linear conformal} algebras…

Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of…

In [math.AT/9907138] we proved that strongly homotopy algebras are homotopy invariant concepts in the category of chain complexes. Our arguments were based on the fact that strongly homotopy algebras are algebras over minimal cofibrant…

Linear algebraic expressions are the essence of many computationally intensive problems, including scientific simulations and machine learning applications. However, translating high-level formulations of these expressions to efficient…

Many Program Verification and Synthesis problems of interest can be modeled directly using Horn clauses and many recent advances in the CLP and CAV communities have centered around efficiently solving problems presented as Horn clauses. The…

We consider several harmonic analysis operators in the multi-dimensional context of the Dunkl Laplacian with the underlying group of reflections isomorphic to $\mathbb{Z}_2^n$ (also negative values of the multiplicity function are…

We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and loops. POCKA enables reasoning about programs that can access…

We determine the rational homology of the space of long knots in R^d for $d\geq4$. Our main result is that the Vassiliev spectral sequence computing this rational homology collapses at the E^1 page. As a corollary we get that the homology…

Formal mathematical reasoning remains a critical challenge for artificial intelligence, hindered by limitations of existing benchmarks in scope and scale. To address this, we present FormalMATH, a large-scale Lean4 benchmark comprising…

It is now well-admitted that formal methods are helpful for many issues raised in the Web service area. In this paper we present a framework for the design and verification of WSs using process algebras and their tools. We define a two-way…

We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The characterisation is not an axiomatisation, but is instead…

We develop the formalism to include substructure in the halo model of clustering. Real halos are not likely to be perfectly smooth, but have substructure which has so far been neglected in the halo model -- our formalism allows one to…

Two cochain complexes are constructed for an algebra A and a coalgebra C entwined with each other via the map $\psi:C\otimes A\to A\otimes C$. One complex is associated to an A-bimodule, the other to a C-bicomodule. In the former case the…