中文
相关论文

相关论文: A circular proof system for the hybrid mu-calculus

200 篇论文

Fitting geometric models onto outlier contaminated data is provably intractable. Many computer vision systems rely on random sampling heuristics to solve robust fitting, which do not provide optimality guarantees and error bounds. It is…

计算机视觉与模式识别 · 计算机科学 2022-06-28 Anh-Dzung Doan , Michele Sasdelli , David Suter , Tat-Jun Chin

The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension…

计算机科学中的逻辑 · 计算机科学 2023-10-20 Denis Cousineau , Gilles Dowek

We prove compactness of solutions to some fourth order equations with exponential nonlinearities on four manifolds. The proof is based on a refined bubbling analysis, for which the main estimates are given in integral form. Our result is…

偏微分方程分析 · 数学 2007-05-23 Andrea Malchiodi

We present and implement an algorithm for computing the invariant circle and the corresponding stable manifolds for 2-dimensional maps. The algorithm is based on the parameterization method, and it is backed up by an a-posteriori theorem…

动力系统 · 数学 2021-11-01 Yian Yao , Rafael De La Llave

The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on…

计算机科学中的逻辑 · 计算机科学 2015-09-11 Martin Lange

This paper is devoted to study the generic fold-fold singularity of Filippov systems on the plane, its unfoldings and its Sotomayor-Teixeira regularization. We work with general Filippov systems and provide the bifurcation diagrams of the…

动力系统 · 数学 2018-02-14 Carles Bonet-Revés , Juliana Larrosa , Tere M-Seara

The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched μ-calculus is known…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Piero A. Bonatti , Carsten Lutz , Aniello Murano , Moshe Y. Vardi

For a given cusped 3-manifold $M$ admitting an ideal triangulation, we describe a method to rigorously prove that either $M$ or a filling of $M$ admits a complete hyperbolic structure via verified computer calculations. Central to our…

This is the first part in a series of papers on counting surfaces on Calabi-Yau 4-folds. Besides the Hilbert scheme of 2-dimensional subschemes, we introduce \emph{two} types of moduli spaces of stable pairs. We show that all three moduli…

代数几何 · 数学 2025-05-20 Younghan Bae , Martijn Kool , Hyeonjun Park

Given a closed complex manifold $X$ of even dimension, we develop a systematic (vertex) algebraic approach to study the rational orbifold cohomology rings $\orbsym$ of the symmetric products. We present constructions and establish results…

代数几何 · 数学 2007-05-23 Zhenbo Qin , Weiqiang Wang

Couplings are a powerful mathematical tool for reasoning about pairs of probabilistic processes. Recent developments in formal verification identify a close connection between couplings and pRHL, a relational program logic motivated by…

编程语言 · 计算机科学 2018-03-16 Gilles Barthe , Benjamin Grégoire , Justin Hsu , Pierre-Yves Strub

Robin Milner (1984) gave a sound proof system for bisimilarity of regular expressions interpreted as processes: Basic Process Algebra with unary Kleene star iteration, deadlock 0, successful termination 1, and a fixed-point rule. He asked…

计算机科学中的逻辑 · 计算机科学 2020-04-28 Clemens Grabmayer , Wan Fokkink

The rewriting system sigma is the set of rules propagating explicit substitutions in the lambda-calculus with explicit substitutions. In this note, we prove the undecidability of unification modulo sigma.

计算机科学中的逻辑 · 计算机科学 2023-05-11 Gilles Dowek

In this paper, we present a formalization of Kozen's propositional modal $\mu$-calculus, in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Marino Miculan

We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.

逻辑 · 数学 2014-11-04 Danko Ilik , Gyesik Lee , Hugo Herbelin

This paper introduces quantum ``multiple-Merlin''-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical multi-proof systems are obviously equivalent to classical…

量子物理 · 物理学 2008-05-12 Hirotada Kobayashi , Keiji Matsumoto , Tomoyuki Yamakami

In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…

统计力学 · 物理学 2008-02-03 Christophe Dress , Werner Krauth

We show that Hertling-Manin F-manifolds provide the appropriate theoretical framework for studying the integrability of quasilinear systems of first-order evolutionary partial differential equations of the form ${\bf u}_t=X\circ {\bf u}_x$…

数学物理 · 物理学 2026-05-26 Alessandro Arsie , Paolo Lorenzoni

Given a compact four dimensional manifold, we prove existence of conformal metrics with constant $Q$-curvature under generic assumptions. The problem amounts to solving a fourth-order nonlinear elliptic equation with variational structure.…

偏微分方程分析 · 数学 2007-05-23 Zindine Djadli , Andrea Malchiodi

In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…

符号计算 · 计算机科学 2016-05-02 Alexander Maletzky