Policriti A
Latest

Optimization and multistage systems. The thawing case

Regular languages meet prefix sorting

Adding the powerset to description logics

Extending$$mathcal ALC$$ with the PowerSet Construct

Reasoning on Relations, Modalities, and Sets

Banishing Ultrafilters from Our Consciousness

Markov chain algorithms for generating sets uniformly at random

The highquality draft genome of peach (Prunus persica) identifies unique patterns of genetic diversity, domestication and genome evolution

The BernaysSchoenfinkelRamsey Class in Set Theory: Decidability

mrNA: the MPI randomized Numerical Aligner

A Randomized Numerical Aligner (rNA)

Hybrid dynamics of stochastic programs

Physical mapping in highly heterozygous genomes: a physical contig map of the Pinot Noir grapevine cultivar

The Bernays Schoenfinkel Ramsey class for set theory: semidecidability

Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back

Stochastic Programs and Hybrid Automata for (Biological) Modeling

Discreteness, hybrid automata, and biology

Hybrid approximation of stochastic process algebras for systems biology

Hybrid semantics for stochastic picalculus

Hybrid systems and biology. continuous and discrete modeling for systems biology

Symbolic Graphs: Linear Solutions to Connectivity Related Problems

The importance of being (a little bit) discrete

Motif discovery fixing mismatch positions

The grapevine genome sequence suggests ancestral hexaploidization in major angiosperm phyla

A Computerized Referee

BuST: Bundled Suffix Trees

Connecting process algebras and differential equations for Systems Biology

Finding regulatory elements fixing error layouts

Modeling Biological Systems in Stochastic Concurrent Constraint Programming

Stemloop structure search for helitron discovery

Algorithmic Algebraic Model Checking I: Challenges from Systems Biology⋆

Ackermann Encodings, Bisimulations, and OBDDs

Foundations of a query and simulation system for the modeling of biochemical and biological processes

From Bisimulation to Simulation: Coarsest Partition Problems

Model building and model checking for biochemical processes

Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing

Alternative Translation Techniques for Propositional and FirstOrder Modal Logics

Simulation as Coarsest Partition Problem

Simulation Reduction as Constraint

The problem of finding transcription factor binding sites and its impact in defining coregulated genenetworks

Xssystems: extended ssystems and algebraic differential automata for modeling cellular behavior

A Fast Bisimulation Algorithm

A logical approach to time granularity

Modelling concurrent systems specified in a temporal concurrent constraint language I

Set Theory for Computing. From Decision Procedures to Declarative Programming with Sets

Comparing Expressiveness of Set Constructor Symbols

Modeling Timed Concurrent systems in a Temporal Concurrent Constraint language

Supporting automated deduction in firstorder modal logics

Editorial

Modal Logic and Set Theory: a SetTheoretic Interpretation of Modal Logic Liber Amicorum for the Fiftieth Birthday of J. F. A. K. van Benthem

Solvable set/hyperset contexts: II. A goal driven unification algorithm for the blended case

Theories of omegalayered metric temporal structures

A uniform axiomatic view of list, multisets, and sets, and the relevant unification algorithm

A SetTheoretic Approach to Automated Deduction in Graded Modal Logics

Book review: Temporal logic. From ancient ideas to artificial intelligence

Temporal Logic. From Ancient Ideas to Artificial Intelligence,by Peter Ohrstrom and Per F.V. Hasle (book review)

Witnessing differences without redundancies

Complementation in the lattice of equivalence relations

Decidability of E*Asentences in Membership Theories

Decidability of exists*forall sentences in membership theories

Decidability results for metric and layered temporal logics

Settheoretic decidability results for modal theorem proving

A settheoretic translation method for (poly)modal logics

A settheoretic translation method for polymodal logics

A derived algorithm for evaluating epsilonexpressions over abstract sets

Undecidability Results for Restricted Universally Quantified Formulae of Set Theory

Decision Procedures for Elementary Sublanguages of Set Theory XIII. Model Graphs, Reflection and Decidability.

Expressing Infinity without Foundation

A contribution to the Automated Treatment of Membership Theories

Note on: The Logically Simplest Form of the Infinity Axiom

The Automation of Syllogistic II. Optimization and Complexity Issues

Truth Table for a Combinatorial Kernel of Set Theories

Decidability results for classes of purely universal formulae and quantifiers elimination in Set Theory

Decision Procedures for Elementary Sublanguages of Set Theory. IX. Unsolvability of the decision problem for a restricted subclass of delta0 formulas of set theory.

Secision Procedures for Elementary Sublanguages of Set Theory XI. Unsolvability of the Decision Problem for a Restricted Subclass of the Delta_0Formulas in Set Theory

The Logically Simplest Form of the Infinity Axiom

Completeness and Decidability of the Deducibility Problem for Some Classes of Formulas of Set Theory