{SCL} with Theory Constraints

We lift the SCL calculus for first-order logic without equality to the SCL(T) calculus for first-order logic without equality modulo a background theory. In a nutshell, the SCL(T) calculus describes a new way to guide hierarchic resolution inferences by a partial model assumption instead of an a priori fixed order as done for instance in hierarchic superposition. The model representation consists of ground background theory literals and ground foreground first-order literals. One major advantage of the model guided approach is that clauses generated by SCL(T) enjoy a non-redundancy property that makes expensive testing for tautologies and forward subsumption completely obsolete. SCL(T) is a semi-decision procedure for pure clause sets that are clause sets without first-order function symbols ranging into the background theory sorts. Moreover, SCL(T) can be turned into a decision procedure if the considered combination of a first-order logic modulo a background theory enjoys an abstract finite model property

An Efficient Subsumption Test Pipeline for {BS(LRA)} Clauses

International audienceThe importance of subsumption testing for redundancy elimination in first-order logic automatic reasoning is well-known. Although the problem is already NP-complete for first-order clauses, the meanwhile developed test pipelines efficiently decide subsumption in almost all practical cases. We consider subsumption between first-oder clauses of the Bernays-Schönfinkel fragment over linear real arithmetic constraints: BS(LRA). The bottleneck in this setup is deciding implication between the LRA constraints of two clauses. Our new sample point heuristic preempts expensive implication decisions in about 94% of all cases in benchmarks. Combined with filtering techniques for the first-order BS part of clauses, it results again in an efficient subsumption test pipeline for BS(LRA) clauses

Linear Integer Arithmetic Revisited

We consider feasibility of linear integer programs in the context of verification systems such as SMT solvers or theorem provers. Although satisfiability of linear integer programs is decidable, many state-of-the-art solvers neglect termination in favor of efficiency. It is challenging to design a solver that is both terminating and practically efficient. Recent work by Jovanovic and de Moura constitutes an important step into this direction. Their algorithm CUTSAT is sound, but does not terminate, in general. In this paper we extend their CUTSAT algorithm by refined inference rules, a new type of conflicting core, and a dedicated rule application strategy. This leads to our algorithm CUTSAT++, which guarantees termination

A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

The Bernays-Sch\"onfinkel first-order logic fragment over simple linear real arithmetic constraints BS(SLR) is known to be decidable. We prove that BS(SLR) clause sets with both universally and existentially quantified verification conditions (conjectures) can be translated into BS(SLR) clause sets over a finite set of first-order constants. For the Horn case, we provide a Datalog hammer preserving validity and satisfiability. A toolchain from the BS(LRA) prover SPASS-SPL to the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. This is exemplified by the verification of supervisor code for a lane change assistant in a car and of an electronic control unit for a supercharged combustion engine

Ultrafast Momentum Imaging of Pseudospin-Flip Excitations in Graphene

The pseudospin of Dirac electrons in graphene manifests itself in a peculiar momentum anisotropy for photo-excited electron-hole pairs. These interband excitations are in fact forbidden along the direction of the light polarization, and are maximum perpendicular to it. Here, we use time- and angle-resolved photoemission spectroscopy to investigate the resulting unconventional hot carrier dynamics, sampling carrier distributions as a function of energy and in-plane momentum. We first show that the rapidly-established quasi-thermal electron distribution initially exhibits an azimuth-dependent temperature, consistent with relaxation through collinear electron-electron scattering. Azimuthal thermalization is found to occur only at longer time delays, at a rate that depends on the substrate and the static doping level. Further, we observe pronounced differences in the electron and hole dynamics in n-doped samples. By simulating the Coulomb- and phonon-mediated carrier dynamics we are able to disentangle the influence of excitation fluence, screening, and doping, and develop a microscopic picture of the carrier dynamics in photo-excited graphene. Our results clarify new aspects of hot carrier dynamics that are unique to Dirac materials, with relevance for photo-control experiments and optoelectronic device applications.Comment: 23 pages, 12 figure

Enhanced electron-phonon coupling in graphene with periodically distorted lattice

Electron-phonon coupling directly determines the stability of cooperative order in solids, including superconductivity, charge and spin density waves. Therefore, the ability to enhance or reduce electron-phonon coupling by optical driving may open up new possibilities to steer materials' functionalities, potentially at high speeds. Here we explore the response of bilayer graphene to dynamical modulation of the lattice, achieved by driving optically-active in-plane bond stretching vibrations with femtosecond mid-infrared pulses. The driven state is studied by two different ultrafast spectroscopic techniques. Firstly, TeraHertz time-domain spectroscopy reveals that the Drude scattering rate decreases upon driving. Secondly, the relaxation rate of hot quasi-particles, as measured by time- and angle-resolved photoemission spectroscopy, increases. These two independent observations are quantitatively consistent with one another and can be explained by a transient three-fold enhancement of the electron-phonon coupling constant. The findings reported here provide useful perspective for related experiments, which reported the enhancement of superconductivity in alkali-doped fullerites when a similar phonon mode was driven.Comment: 12 pages, 4 figure

A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems

We present a combination of the Mixed-Echelon-Hermite transformation and the Double-Bounded Reduction for systems of linear mixed arithmetic that preserve satisfiability and can be computed in polynomial time. Together, the two transformations turn any system of linear mixed constraints into a bounded system, i.e., a system for which termination can be achieved easily. Existing approaches for linear mixed arithmetic, e.g., branch-and-bound and cuts from proofs, only explore a finite search space after application of our two transformations. Instead of generating a priori bounds for the variables, e.g., as suggested by Papadimitriou, unbounded variables are eliminated through the two transformations. The transformations orient themselves on the structure of an input system instead of computing a priori (over-)approximations out of the available constants. Experiments provide further evidence to the efficiency of the transformations in practice. We also present a polynomial method for converting certificates of (un)satisfiability from the transformed to the original system