English
Related papers

Related papers: A circular proof system for the hybrid mu-calculus

200 papers

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…

Computer Vision and Pattern Recognition · Computer Science 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…

Logic in Computer Science · Computer Science 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…

Analysis of PDEs · Mathematics 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…

Dynamical Systems · Mathematics 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…

Logic in Computer Science · Computer Science 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…

Dynamical Systems · Mathematics 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…

Logic in Computer Science · Computer Science 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…

Algebraic Geometry · Mathematics 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…

Algebraic Geometry · Mathematics 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…

Programming Languages · Computer Science 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…

Logic in Computer Science · Computer Science 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.

Logic in Computer Science · Computer Science 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…

Logic in Computer Science · Computer Science 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.

Logic · Mathematics 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…

Quantum Physics · Physics 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…

Statistical Mechanics · Physics 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$…

Mathematical Physics · Physics 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.…

Analysis of PDEs · Mathematics 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…

Symbolic Computation · Computer Science 2016-05-02 Alexander Maletzky
‹ Prev 1 3 4 5 6 7 10 Next ›