相关论文: On termination of minimal model program for log ca…

Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. To make termination checks scale to large systems,…

Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In…

Termination is a central property in sequential programming models: a term is terminating if all its reduction sequences are finite. Termination is also important in concurrency in general, and for message-passing programs in particular. A…

This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional termination analysis where an analyser tries to verify termination for a specified mode. Our contribution is a…

The sequential composition of propositional logic programs has been recently introduced. This paper studies the sequential {\em decomposition} of programs by studying Green's relations $\mathcal{L,R,J}$ -- well-known in semigroup theory --…

A cheap method for constructing canonical models and complete moduli for complex projective varieties with a structure called "rational plurifibration" is given. A result about semistable reduction (whose nature is slightly different from…

We present a novel approach to termination analysis. In a first step, the analysis uses a program as a black-box which exhibits only a finite set of sample traces. Each sample trace is infinite but can be represented by a finite lasso. The…

Let $(X,B)$ be a projective log canonical pair such that $B$ is a $\Q$-divisor, and that there is a surjective morphism $f\colon X\to Z$ onto a normal variety $Z$ satisfying: $K_X+B\sim_\Q f^*M$ for some $\Q$-divisor $M$, and the augmented…

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

Algebraic characterization of logic programs has received increasing attention in recent years. Researchers attempt to exploit connections between linear algebraic computation and symbolic computation in order to perform logical inference…

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

We give a light introduction to some recent developments in Mori theory, and to our recent direct proof of the finite generation of the canonical ring.

Semistable reduction theorem for projective morphisms in the category of complex analytic spaces is established.

We study pairs of finitely generated modules over a principal ideal domain and their corresponding matrix representations. We introduce equivalence relations for such pairs and determine invariants and canonical forms.

This research note provides algebraic characterizations of the least model, subsumption, and uniform equivalence of propositional Krom logic programs.

The term {\em meta-programming} refers to the ability of writing programs that have other programs as data and exploit their semantics. The aim of this paper is presenting a methodology allowing us to perform a correct termination analysis…

We introduce a modified version of the well-known dependency pair framework that is suitable for the termination analysis of rewriting under forbidden pattern restrictions. By attaching contexts to dependency pairs that represent the…

This is a survey of some recent developments in the study of singularities related to the classification theory of algebraic varieties. In particular, the definition and basic properties of Du Bois singularities and their connections to the…

For a fixed pair and fixed exponents, we prove the discreteness of log discrepancies over all log canonical triples formed by attaching a product of ideals with given exponents.

There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a…