Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints

The monadic shallow linear Horn fragment is well-known to be decidable and has many application, e.g., in security protocol analysis, tree automata, or abstraction refinement. It was a long standing open problem how to extend the fragment to the non-Horn case, preserving decidability, that would, e.g., enable to express non-determinism in protocols. We prove decidability of the non-Horn monadic shallow linear fragment via ordered resolution further extended with dismatching constraints and discuss some applications of the new decidable fragment.Comment: 29 pages, long version of CADE-26 pape

On the Expressivity and Applicability of Model Representation Formalisms

A number of first-order calculi employ an explicit model representation formalism for automated reasoning and for detecting satisfiability. Many of these formalisms can represent infinite Herbrand models. The first-order fragment of monadic, shallow, linear, Horn (MSLH) clauses, is such a formalism used in the approximation refinement calculus. Our first result is a finite model property for MSLH clause sets. Therefore, MSLH clause sets cannot represent models of clause sets with inherently infinite models. Through a translation to tree automata, we further show that this limitation also applies to the linear fragments of implicit generalizations, which is the formalism used in the model-evolution calculus, to atoms with disequality constraints, the formalisms used in the non-redundant clause learning calculus (NRCL), and to atoms with membership constraints, a formalism used for example in decision procedures for algebraic data types. Although these formalisms cannot represent models of clause sets with inherently infinite models, through an additional approximation step they can. This is our second main result. For clause sets including the definition of an equivalence relation with the help of an additional, novel approximation, called reflexive relation splitting, the approximation refinement calculus can automatically show satisfiability through the MSLH clause set formalism.Comment: 15 page

Automatic Generation of Invariants for Circular Derivations in {SUP(LA)} 1

The hierarchic combination of linear arithmetic and firstorder logic with free function symbols, FOL(LA), results in a strictly more expressive logic than its two parts. The SUP(LA) calculus can be turned into a decision procedure for interesting fragments of FOL(LA). For example, reachability problems for timed automata can be decided by SUP(LA) using an appropriate translation into FOL(LA). In this paper, we extend the SUP(LA) calculus with an additional inference rule, automatically generating inductive invariants from partial SUP(LA) derivations. The rule enables decidability of more expressive fragments, including reachability for timed automata with unbounded integer variables. We have implemented the rule in the SPASS(LA) theorem prover with promising results, showing that it can considerably speed up proof search and enable termination of saturation for practically relevant problems

3,3-Dimethyl-1,2,3,4-tetra­hydro­cyclo­penta­[b]indole-1,2-dione (bruceolline E)

The title compound, C13H11NO2, crystallizes with two mol­ecules in the asymmetric unit. The crystal packing is stabilized by N—H⋯O hydrogen bonds, which link the mol­ecules into chains along [10], and weak C—H⋯O inter­actions

A Parse-based Framework for Coupled Rhythm Quantization and Score Structuring

International audienceWe present a formal language-based framework for MIDI-to-score transcription, the problem of converting a sequence of symbolic musical events with arbitrary timestamps into a structured music score. The framework aims at solving in one pass the two subproblems of rhythm quantization and score production. It relies, throughout the process, on an apriori hierarchical model of scores given by generative grammars. We show that this coupled approach helps to make relevant and interrelated decisions, and we present an algorithm computing transcription solutions optimal with respect to both the fitness of the quantization to the input, and a measure of complexity of music notation

Automatic Methods for Analyzing Non-repudiation Protocole with an Active Intruder

International audienceNon-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. After discussing the limitations of this method, we define a new one based on the handling of the knowledge of protocol participants. This second method is general and of natural use, as it consists in adding simple annotations in the protocol specification. It is very easy to implement in tools able to handle participants knowledge. We have implemented it in the AVISPA Tool and analyzed the optimistic Cederquist-Corin-Dashti protocol, discovering two attacks. This extension of the AVISPA Tool for handling non-repudiation opens a highway to the specification of many other properties, without any more change in the tool itself

QTLs for oil yield components in an elite oil palm (Elaeis guineensis) cross

Increased modern farming of superior types of the oil palm, Elaeis guineensis Jacq., which has naturally efficient oil biosynthesis, has made it the world’s foremost edible oil crop. Breeding improvement is, however, circumscribed by time and costs associated with the tree’s long reproductive cycle, large size and 10–15 years of field testing. Marker-assisted breeding has considerable potential for improving this crop. Towards this, quantitative trait loci (QTL) linked to oil yield component traits were mapped in a high-yield population. In total, 164 QTLs associated with 21 oil yield component traits were discovered, with cumulative QTL effects increasing in tandem with the number of QTL markers and matching the QT+ alleles for each trait. The QTLs confirmed all traits to be polygenic, with many genes of individual small effects on independent loci, but epistatic interactions are not ruled out. Furthermore, several QTLs maybe pleiotropic as suggested by QTL clustering of inter-related traits on almost all linkage groups. Certain regions of the chromosomes seem richer in the genes affecting a particular yield component trait and likely encompass pleiotropic, epistatic and heterotic effects. A large proportion of the identified additive effects from QTLs may actually arise from genic interactions between loci. Comparisons with previous mapping studies show that most of the QTLs were for similar traits and shared similar marker intervals on the same linkage groups. Practical applications for such QTLs in marker-assisted breeding will require seeking them out in different genetic backgrounds and environments

On the Expressivity and Applicability of Model Representation Formalisms

International audienceA number of first-order calculi employ an explicit model representation formalism in support of non-redundant inferences and for detecting satisfiability. Many of these formalisms can represent infinite Herbrand models. The first-order fragment of monadic, shallow, linear, Horn (MSLH) clauses, is such a formalism used in the approximation refinement calculus (AR). Our first result is a finite model property for MSLH clause sets. Therefore, MSLH clause sets cannot represent models of clause sets with inherently infinite models. Through a translation to tree automata, we further show that this limitation also applies to the linear fragments of implicit generalizations, which is the formalism used in the model-evolution calculus (ME), to atoms with disequality constraints, the formalisms used in the non-redundant clause learning calculus (NRCL), and to atoms with membership constraints, a formalism used for example in decision procedures for algebraic data types. Although these formalisms cannot represent models of clause sets with inherently infinite models, through an additional approximation step they can. This is our second main result. For clause sets including the definition of an equivalence relation with the help of an additional, novel approximation, called reflexive relation splitting, the approximation refinement calculus can automatically show satisfiability through the MSLH clause set formalism