Refine
Has Fulltext
- yes (13)
Year of publication
- 2009 (13) (remove)
Document Type
- Preprint (13) (remove)
Keywords
- Automatisches Beweisen (1)
- DPLL (1)
- Edge-degenerate operators (1)
- Klausellernen (1)
- Logikkalkül (1)
- Operators on manifolds with conical singularities (1)
- SAT (1)
- automated theorem proving (1)
- clause learning (1)
- conormal symbols (1)
Aus dem Inhalt: Einleitung Kapitel 1. Starke Gesetze der Grossen Zahlen 1. SGGZ unter Wachstumsbedingungen an die p-ten Momente 2. SGGZ für identisch verteilte Zufallsvariablen 3. SGGZ für Prozesse mit *-mixing-Eigenschaft Kapitel 2. Einführung zu diskreten (Sub-,Super-)Martingalen 1. Vorhersagbarkeit 2. gestoppte (Sub-,Super-)Martingale 3. Upcrossings 4. Konvergenzsätze 5. Doob-Zerlegung 6. Eine äquivalente Definition eines (Sub-)Martingals Kapitel 3. Martingale und gleichgradige Integrierbarkeit 1. Gleichmäßige(-f¨ormige,-gradige) Integrierbarkeit 2. gleichgradig integrierbare Martingale Kapitel 4. Martingale und das SGGZ Kapitel 5.”reversed“ (Sub-,Super-)Martingale 1. Konvergenzsätze Kapitel 6. (Sub-,Super-)Martingale mit gerichteter Indexmenge 1. Äquivalente Formulierung eines (Sub-)Martingals 2. Konvergenzsätze Kapitel 7. Quasimartingale,Amarts und Semiamarts 1. Konvergenzsätze 2. Riesz-Zerlegung 3. Doob-Zerlegung Kapitel 8. Amarts und das SGGZ Kapitel 9.”reversed“ Amarts und Semiamarts 1. Konvergenzsätze 2.”Aufwärts“- gegen ”Abwärts“-Adaptiertheit 3. Riesz-Zerlegung 4. Stabilitätsanalyse Kapitel 10. Amarts mit gerichteter Indexmenge 1. Konvergenzsätze 2. Riesz-Zerlegung Anhang A. zur Existenz einer Folge unabhängiger Zufallsvariablen B. Konvergenz
Many formal descriptions of DPLL-based SAT algorithms either do not include all essential proof techniques applied by modern SAT solvers or are bound to particular heuristics or data structures. This makes it difficult to analyze proof-theoretic properties or the search complexity of these algorithms. In this paper we try to improve this situation by developing a nondeterministic proof calculus that models the functioning of SAT algorithms based on the DPLL calculus with clause learning. This calculus is independent of implementation details yet precise enough to enable a formal analysis of realistic DPLL-based SAT algorithms.
We consider an infinite system of non overlaping globules undergoing Brownian motions in R3. The term globules means that the objects we are dealing with are spherical, but with a radius which is random and time-dependent. The dynamics is modelized by an infinitedimensional Stochastic Differential Equation with local time. Existence and uniqueness of a strong solution is proven for such an equation with fixed deterministic initial condition. We also find a class of reversible measures.
The Cauchy problem of the vacuum Einstein's equations aims to find a semimetric g(αβ) of a spacetime with vanishing Ricci curvature Rα,β and prescribed initial data. Under the harmonic gauge condition, the equations Rα,β = 0 are transferred into a system of quasi-linear wave equations which are called the reduced Einstein equations. The initial data for Einstein's equations are a proper Riemannian metric h(αβ) and a second fundamental form K(αβ). A necessary condition for the reduced Einstein equation to satisfy the vacuum equations is that the initial data satisfy Einstein constraint equations. Hence the data (h(αβ),K(αβ)) cannot serve as initial data for the reduced Einstein equations. Previous results in the case of asymptotically flat spacetimes provide a solution to the constraint equations in one type of Sobolev spaces, while initial data for the evolution equations belong to a different type of Sobolev spaces. The goal of our work is to resolve this incompatibility and to show that under the harmonic gauge the vacuum Einstein equations are well-posed in one type of Sobolev spaces.
Studying the influence of the updating scheme for MCMC algorithm on spatially extended models is a well known problem. For discrete-time interacting particle systems we study through simulations the effectiveness of a synchronous updating scheme versus the usual sequential one. We compare the speed of convergence of the associated Markov chains from the point of view of the time-to-coalescence arising in the coupling-from-the-past algorithm. Unlike the intuition, the synchronous updating scheme is not always the best one. The distribution of the time-to-coalescence for these spatially extended models is studied too.
We construct elliptic elements in the algebra of (classical pseudo-differential) operators on a manifold M with conical singularities. The ellipticity of any such operator A refers to a pair of principal symbols (σ0, σ1) where σ0 is the standard (degenerate) homogeneous principal symbol, and σ1 is the so-called conormal symbol, depending on the complex Mellin covariable z. The conormal symbol, responsible for the conical singularity, is operator-valued and acts in Sobolev spaces on the base X of the cone. The σ1-ellipticity is a bijectivity condition for all z of real part (n + 1)/2 − γ, n = dimX, for some weight γ. In general, we have to rule out a discrete set of exceptional weights that depends on A. We show that for every operator A which is elliptic with respect to σ0, and for any real weight γ there is a smoothing Mellin operator F in the cone algebra such that A + F is elliptic including σ1. Moreover, we apply the results to ellipticity and index of (operator-valued) edge symbols from the calculus on manifolds with edges.
Multitype branching processes and Feller diffusion processes are conditioned on very late extinction. The conditioned laws are expressed as Doob h-transforms of the unconditioned laws, and an interpretation of the conditioned paths for the branching process is given, via the immortal particle. We study different limits for the conditioned process (increasing delay of extinction, long-time behavior, scaling limit) and provide an exhaustive list of exchangeability results.