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

Time and position sensitive single photon detector for scintillator read-out

We have developed a photon counting detector system for combined neutron and gamma radiography which can determine position, time and intensity of a secondary photon flash created by a high-energy particle or photon within a scintillator screen. The system is based on a micro-channel plate photomultiplier concept utilizing image charge coupling to a position- and time-sensitive read-out anode placed outside the vacuum tube in air, aided by a standard photomultiplier and very fast pulse-height analyzing electronics. Due to the low dead time of all system components it can cope with the high throughput demands of a proposed combined fast neutron and dual discrete energy gamma radiography method (FNDDER). We show tests with different types of delay-line read-out anodes and present a novel pulse-height-to-time converter circuit with its potential to discriminate gamma energies for the projected FNDDER devices for an automated cargo container inspection system (ACCIS).Comment: Proceedings of FNDA 201

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

A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

In a previous paper, we have shown that clause sets belonging to the HornBernays-Sch\"onfinkel fragment over simple linear real arithmetic (HBS(SLR))can be translated into HBS clause sets over a finite set of first-orderconstants. The translation preserves validity and satisfiability and it isstill applicable if we extend our input with positive universally orexistentially quantified verification conditions (conjectures). We call thistranslation a Datalog hammer. The combination of its implementation inSPASS-SPL with the Datalog reasoner VLog establishes an effective way ofdeciding verification conditions in the Horn fragment. We verify supervisorcode for two examples: a lane change assistant in a car and an electroniccontrol unit of a supercharged combustion engine. In this paper, we improve ourDatalog hammer in several ways: we generalize it to mixed real-integerarithmetic and finite first-order sorts; we extend the class of acceptableinequalities beyond variable bounds and positively grounded inequalities; andwe significantly reduce the size of the hammer output by a soft typingdiscipline. We call the result the sorted Datalog hammer. It not only allows usto handle more complex supervisor code and to model already consideredsupervisor code more concisely, but it also improves our performance on realworld benchmark examples. Finally, we replace the before file-based interfacebetween SPASS-SPL and VLog by a close coupling resulting in a single executablebinary.<br

A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic

International audienceAbstract In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine. In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary

A Pluralistic Theory of Wordhood

What are words and how should we individuate them? There are two main answers on the philosophical market. For some, words are bundles of structural-functional features defining a unique performance profile. For others, words are non-eternal continuants individuated by their causal-historical ancestry. These conceptions offer competing views of the nature of words, and it seems natural to assume that at most one of them can capture the essence of wordhood. This paper makes a case for pluralism about wordhood: the view that there is a plurality of acceptable conceptions of the nature of words, none of which is uniquely entitled to inform us as to what wordhood consists in

An Optical Readout TPC (O-TPC) for Studies in Nuclear Astrophysics With Gamma-Ray Beams at HIgS

We report on the construction, tests, calibrations and commissioning of an Optical Readout Time Projection Chamber (O-TPC) detector operating with a CO2(80%) + N2(20%) gas mixture at 100 and 150 Torr. It was designed to measure the cross sections of several key nuclear reactions involved in stellar evolution. In particular, a study of the rate of formation of oxygen and carbon during the process of helium burning will be performed by exposing the chamber gas to intense nearly mono-energetic gamma-ray beams at the High Intensity Gamma Source (HIgS) facility. The O-TPC has a sensitive target-drift volume of 30x30x21 cm^3. Ionization electrons drift towards a double parallel grid avalanche multiplier, yielding charge multiplication and light emission. Avalanche induced photons from N2 emission are collected, intensified and recorded with a Charge Coupled Device (CCD) camera, providing two-dimensional track images. The event's time projection (third coordinate) and the deposited energy are recorded by photomultipliers and by the TPC charge-signal, respectively. A dedicated VME-based data acquisition system and associated data analysis tools were developed to record and analyze these data. The O-TPC has been tested and calibrated with 3.183 MeV alpha-particles emitted by a 148Gd source placed within its volume with a measured energy resolution of 3.0%. Tracks of alpha and 12C particles from the dissociation of 16O and of three alpha-particles from the dissociation of 12C have been measured during initial in-beam test experiments performed at the HIgS facility at Duke University. The full detection system and its performance are described and the results of the preliminary in-beam test experiments are reported.Comment: Supported by the Richard F. Goodman Yale-Weizmann Exchange Program, ACWIS, NY, and USDOE grant Numbers: DE-FG02-94ER40870 and DE-FG02-97ER4103

SPASS-SATT: A CDCL(LA) Solver

International audienceSPASS-SATT is a CDCL(LA) solver for linear rational and linear mixed/integer arithmetic. This system description explains its specific features: fast cube tests for integer solvability, bounding transformations for unbounded problems, close interaction between the SAT solver and the theory solver, efficient data structures, and small-clause-normal-form generation. SPASS-SATT is currently one of the strongest systems on the respective SMT-LIB benchmarks