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

1) Assuming log Minimal Model Conjecture, we give a construction of a complete moduli space of stable log pairs of arbitrary dimension generalizing directly the space M_{g,n} of pointed stable curves. Each stable pair has semi log canonical…

We introduce the notion of generalized MR log canonical surfaces and establish the minimal model theory for generalized MR log canonical surfaces in full generality.

We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the integers. We present a technique that allows to overcome these…

We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…

We propose an automated method for proving termination of $\pi$-calculus processes, based on a reduction to termination of sequential programs: we translate a $\pi$-calculus process to a sequential program, so that the termination of the…

Using techniques from the theory of foliations, we establish the cone theorem and the contraction theorem for lc generalized pairs in full generality, and meanwhile develop the minimal model program for $\mathbb Q$-factorial foliated dlt…

We show that minimal models of $\mathbb{Q}$-factorial NQC log canonical generalised pairs exist, assuming the existence of minimal models of smooth varieties. More generally, we prove that on a $\mathbb{Q}$-factorial NQC log canonical…

We use reduction maps to study the minimal model program. Our main result is that the existence of a good minimal model for a klt pair $(X,\Delta)$ can be detected on the base of the $(K_{X}+\Delta)$-trivial reduction map. Thus we show that…

We introduce a method of verifying termination of logic programs with respect to concrete queries (instead of abstract query patterns). A necessary and sufficient condition is established and an algorithm for automatic verification is…

We continue our study of the relation between log minimal models and various types of Zariski decompositions. Let $(X,B)$ be a projective log canonical pair. We will show that $(X,B)$ has a log minimal model if either $K_X+B$ birationally…

We prove the finiteness of $B$-representations of generalised log canonical pairs. As a consequence, we prove that, the (relative) abundance for a generalised semi-log canonical pair is implied by the abundance for its normalisation.…

Tabled logic programming is receiving increasing attention in the Logic Programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and often extremely efficient execution mechanism for logic…

Termination of logic programs with negated body atoms (here called general logic programs) is an important topic. One reason is that many computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's…

There are many techniques and tools to prove termination of C programs, but up to now these tools were not very powerful for fully automated termination proofs of programs whose termination depends on recursive data structures like lists.…

This Survey provides an overview of techniques in termination analysis for programs with numerical variables and transitions defined by linear constraints. This subarea of program analysis is challenging due to the existence of undecidable…

We give a method to investigate isolated log canonical singularities with index one which are not log terminal. Our method depends on the minimal model program. One of the main purposes is to prove that our invariant coincides with Ishii's…

Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, whereas real-world Prolog programs typically use the cut operator.…

Minimal sentence pairs are frequently used to analyze the behavior of language models. It is often assumed that model behavior on contrastive pairs is predictive of model behavior at large. We argue that two conditions are necessary for…

In a previous work, we described the Minimal Model Program in the family of $\Qbb$-Gorenstein projective horospherical varieties, by studying certain continuous changes of moment polytopes of polarized horospherical varieties. Here, we…

We show the termination of any log-minimal model program for a pair $(X,\Delta)$ of a symplectic manifold $X$ and an effective $\mathbb R$-divisor $\Delta$.