Alberto Policriti

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

On Sets and Graphs: Perspectives on Logic and Combinatorics

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-319-54980-4, 2017

2016

Fast Longest Common Extensions in Small Space.

[BibT_eX]

[DOI]

CoRR, 2016

Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2.

[BibT_eX]

[DOI]

BMC Bioinform., 2016

Logic-Based Multi-objective Design of Chemical Reaction Networks.

[BibT_eX]

[DOI]

Simone Silvetti

Proceedings of the Hybrid Systems Biology - 5th International Workshop, 2016

Computing LZ77 in Run-Compressed Space.

[BibT_eX]

[DOI]

Proceedings of the 2016 Data Compression Conference, 2016

Logic Programming Applied to Genome Evolution in Cancer.

[BibT_eX]

[DOI]

Proceedings of the 31st Italian Conference on Computational Logic, 2016

Banishing Ultrafilters from Our Consciousness.

[BibT_eX]

[DOI]

Proceedings of the Martin Davis on Computability, 2016

2015

Rank and simulation: the well-founded case.

[BibT_eX]

[DOI]

J. Log. Comput., 2015

Mapping Sets and Hypersets into Numbers.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Is Hyper-extensionality Preservable Under Deletions of Graph Elements?

[BibT_eX]

[DOI]

Alberto Casagrande

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

On the impact of discreteness and abstractions on modelling noise in gene regulatory networks.

[BibT_eX]

[DOI]

Chiara Bodei

Davide Chiarugi

Maria Luisa Guerriero

Alessandro Romanel

Comput. Biol. Chem., 2015

Fast randomized approximate string matching with succinct hash data structures.

[BibT_eX]

[DOI]

BMC Bioinform., 2015

Fast Online Lempel-Ziv Factorization in Compressed Space.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Nicola Gigante

Proceedings of the Language and Automata Theory and Applications, 2015

Hierarchical Assembly of Pools.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Biomedical Engineering, 2015

2014

Chimera: a Bioconductor package for secondary analysis of fusion products.

[BibT_eX]

[DOI]

Bioinform., 2014

A Parallel Algorithm for the Best k-Mismatches Alignment Problem.

[BibT_eX]

[DOI]

Cristian Del Fabbro

Fabio Tardivo

Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

Hashing and Indexing: Succinct DataStructures and Smoothed Analysis.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Hyper-Extensionality and One-Node Elimination on Membership Graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th Italian Conference on Computational Logic, 2014

2013

(Hybrid) automata and (stochastic) programsThe hybrid automata lattice of a stochastic program.

[BibT_eX]

[DOI]

J. Log. Comput., 2013

Well-quasi-ordering hereditarily finite sets.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

GAM-NGS: genomic assemblies merger for next generation sequencing.

[BibT_eX]

[DOI]

BMC Bioinform., 2013

Markov chain algorithms for generating sets uniformly at random.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2013

Encodings of Sets and Hypersets.

[BibT_eX]

[DOI]

Proceedings of the 28th Italian Conference on Computational Logic, 2013

On the Decidability of the ∃*∀* Prefix Class in Set Theory.

[BibT_eX]

[DOI]

Proceedings of the 28th Italian Conference on Computational Logic, 2013

2012

Studying cancer-cell populations by programmable models of networks.

[BibT_eX]

[DOI]

Netw. Model. Anal. Health Informatics Bioinform., 2012

Infinity, in short.

[BibT_eX]

[DOI]

J. Log. Comput., 2012

The Bernays - Schönfinkel - Ramsey class for set theory: decidability.

[BibT_eX]

[DOI]

J. Symb. Log., 2012

A randomized Numerical Aligner (rNA).

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

GapFiller: a de novo assembly approach to fill the gap within paired reads.

[BibT_eX]

[DOI]

Francesca Nadalin

BMC Bioinform., 2012

rNA: a fast and accurate short reads numerical aligner.

[BibT_eX]

[DOI]

Bioinform., 2012

A Multi-objective Optimisation Approach to the Design of Experiment in De Novo Assembly Projects.

[BibT_eX]

[DOI]

Francesca Nadalin

Proceedings of the 23rd International Workshop on Database and Expert Systems Applications, 2012

Rank-Based Simulation on Acyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 9th Italian Convention on Computational Logic, 2012

ERNE-BS5: aligning BS-treated sequences by multiple hits on a 5-letters alphabet.

[BibT_eX]

[DOI]

Proceedings of the ACM International Conference on Bioinformatics, 2012

2011

Counting extensional acyclic digraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Programmable models of growth and mutation of cancer-cell populations

[BibT_eX]

[DOI]

Proceedings of the Proceedings Third International Workshop on Computational Models for Cell Processes, 2011

mrNA: The MPI Randomized Numerical Aligner.

[BibT_eX]

[DOI]

Cristian Del Fabbro

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2010

Hybrid dynamics of stochastic programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability.

[BibT_eX]

[DOI]

J. Symb. Log., 2010

Perspectives on Constraints, Process Algebras, and Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Constraint Based Methods for Bioinformatics, 2010

Enhanced reference guided assembly.

[BibT_eX]

[DOI]

Federica Cattonaro

Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009

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

[BibT_eX]

[DOI]

Trans. Comp. Sys. Biology, 2009

Hybrid Dynamics of Stochastic pi-Calculus.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2009

Discrete Semantics for Hybrid Automata.

[BibT_eX]

[DOI]

Alberto Casagrande

Discret. Event Dyn. Syst., 2009

Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration

[BibT_eX]

[DOI]

Proceedings of the Proceedings Second International Workshop on Computational Models for Cell Processes, 2009

Automated FingerPrint Background removal: FPB.

[BibT_eX]

[DOI]

Simone Scalabrin

Michele Morgante

BMC Bioinform., 2009

Stochastic Programs and Hybrid Automata for (Biological) Modeling.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Theory and Computational Practice, 2009

TEA: a Transposable Elements Annotator.

[BibT_eX]

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2009

GAM: Genomic Assemblies Merger: A Graph Based Method to Integrate Different Assemblies.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE International Conference on Bioinformatics and Biomedicine, 2009

2008

Inclusion dynamics hybrid automata.

[BibT_eX]

[DOI]

Inf. Comput., 2008

The Importance of Being (A Little Bit) Discrete.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop From Biology to Concurrency and Back, 2008

Modeling Biological Systems in Stochastic Concurrent Constraint Programming.

[BibT_eX]

[DOI]

Constraints An Int. J., 2008

Symbolic Graphs: Linear Solutions to Connectivity Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 2008

Hybrid Systems and Biology.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Computational Systems Biology, 2008

A Complete Axiomatic System for a Process-Based Spatial Logic.

[BibT_eX]

[DOI]

Radu Mardare

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Systems Biology: Models and Logics.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 24th International Conference, 2008

Hybrid Semantics for Stochastic pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Biology, Third International Conference, 2008

2007

Stochastic Concurrent Constraint Programming and Differential Equations.

[BibT_eX]

[DOI]

Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages, 2007

Constraint-Based Simulation of Biological Systems Described by Molecular Interaction Maps.

[BibT_eX]

[DOI]

Simone Fonda

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2007

2006

BuST-Bundled Suffix Trees.

[BibT_eX]

[DOI]

Francesco Fabris

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

A Computerized Referee.

[BibT_eX]

[DOI]

Proceedings of the Reasoning, 2006

2005

The axiom of elementary sets on the edge of Peircean expressibility.

[BibT_eX]

[DOI]

J. Symb. Log., 2005

Structured Motifs Search.

[BibT_eX]

[DOI]

J. Comput. Biol., 2005

An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures.

[BibT_eX]

[DOI]

Nicola Vitacolonna

Proceedings of the Logic for Programming, 2005

Algorithmic Algebraic Model Checking I: Challenges from Systems Biology.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004

Ackermann Encoding, Bisimulations, and OBDDs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2004

Three-variable statements of set-pairing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

An efficient algorithm for computing bisimulation equivalence.

[BibT_eX]

[DOI]

Alberto L. Sangiovanni-Vincentelli

Theor. Comput. Sci., 2004

Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Improving reachability analysis of hybrid automata for engine control.

[BibT_eX]

[DOI]

Proceedings of the 43rd IEEE Conference on Decision and Control, 2004

2003

From Bisimulation to Simulation: Coarsest Partition Problems.

[BibT_eX]

[DOI]

J. Autom. Reason., 2003

Computing strongly connected components in a linear number of symbolic steps.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Foundations of a Query and Simulation System for the Modeling of Biochemical and Biological Processes.

[BibT_eX]

[DOI]

Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

Biconnectivity on Symbolically Represented Graphs: A Linear Solution.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing.

[BibT_eX]

[DOI]

Proceedings of the Computational Methods in Systems Biology, First International Workshop, 2003

Binary Extensions of S1S and the Composition Method.

[BibT_eX]

[DOI]

Enrico Marzano

Proceedings of the Verification: Theory and Practice, 2003

Rasiowa-Sikorski Style Relational Elementary Set Theory.

[BibT_eX]

[DOI]

Ewa Orlowska

Proceedings of the Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, 2003

2002

Extending Kamp's Theorem to Model Time Granularity.

[BibT_eX]

[DOI]

Adriano Peron

J. Log. Comput., 2002

Alternative Translation Techniques for Propositional and First-Order Modal Logics.

[BibT_eX]

[DOI]

Matteo Slanina

J. Autom. Reason., 2002

Simulation Reduction as Constraint.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Functional and (Constraint) Logic Programming, 2002

Rank-Based Symbolic Bisimulation (and Model Checking).

[BibT_eX]

[DOI]

Proceedings of the 9th Workhop on Logic, Language, Information and Computation, 2002

Simulation as Coarsest Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

XS-systems: eXtended S-Systems and Algebraic Differential Automata for Modeling Cellular Behavior.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2002

Automation of Aggregate Theories: The Cornerstones of Equational Expressibility.

[BibT_eX]

[DOI]

Proceedings of the AGP 2002: Proceedings of the Joint Conference on Declarative Programming, 2002

2001

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

[BibT_eX]

[DOI]

Monographs in Computer Science, Springer, ISBN: 978-1-4757-3452-2, 2001

Modeling concurrent systems specified in a temporal concurrent constraint language-I.

[BibT_eX]

[DOI]

Moreno Falaschi

Alicia Villanueva

Proceedings of the Declarative Programming, 2001

AppART: An ART Hybrid Stable Learning Neural Network for Universal Function Approximation.

[BibT_eX]

Luis Marti

Luciano Garcia

Proceedings of the Hybrid Information Systems, 2001

A Fast Bisimulation Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 13th International Conference, 2001

Deciding modal logics using tableaux and set theory.

[BibT_eX]

[DOI]

Proceedings of the APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, 2001

2000

The Taming (Timing) of the States.

[BibT_eX]

[DOI]

Adriano Peron

Log. J. IGPL, 2000

Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Derivability in Locally Quantified Modal Logics via Translation in Set Theory.

[BibT_eX]

[DOI]

Matteo Slanina

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Supporting automated deduction in first-order modal logics.

[BibT_eX]

Matteo Slanina

Proceedings of the KR 2000, 2000

1999

T-Resolution: Refinements and Model Elimination.

[BibT_eX]

[DOI]

J. Autom. Reason., 1999

Editorial.

[BibT_eX]

[DOI]

Yde Venema

Log. J. IGPL, 1999

Theories of omega-Layered Metric Temporal Structures: Expressiveness and Decidability.

[BibT_eX]

[DOI]

Adriano Peron

Log. J. IGPL, 1999

Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1999

Comparing expressiveness of set constructor symbols.

[BibT_eX]

Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998

Modal Deduction in Second-Order Logic and Set Theory - II.

[BibT_eX]

[DOI]

Stud Logica, 1998

A Uniform Axiomatic View of Lists, Multisets, and Sets, and the Relevant Unification Algorithms.

[BibT_eX]

[DOI]

Gianfranco Rossi

Fundam. Informaticae, 1998

1997

Modal Deduction in Second-Order Logic and Set Theory - I.

[BibT_eX]

[DOI]

J. Log. Comput., 1997

On T Logic Programming.

[BibT_eX]

Proceedings of the Logic Programming, 1997

A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Set domains for structural properties of terms.

[BibT_eX]

Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996

Decidability Results for Metric and Layered Temporal Logics.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1996

Decidability of ∃*∀-Sentences in Membership Theories.

[BibT_eX]

[DOI]

Math. Log. Q., 1996

Complementation in the lattice of equivalence relations.

[BibT_eX]

[DOI]

Dikran Dikranjan

Discret. Math., 1996

Integrating Lists, Multisets, and Sets in a Logic Programming Framework.

[BibT_eX]

Gianfranco Rossi

Proceedings of the Frontiers of Combining Systems, 1996

1995

T-Theorem Proving I.

[BibT_eX]

[DOI]

Jacob T. Schwartz

J. Symb. Comput., 1995

A Set-Theoretic Translation Method for Polymodal Logics.

[BibT_eX]

[DOI]

Giovanna D'Agostino

J. Autom. Reason., 1995

A Set-Theoretic Translation Method for (Poly)modal Logics.

[BibT_eX]

[DOI]

Giovanna D'Agostino

Proceedings of the STACS 95, 1995

1994

Solving Systems of Equations over Hypersets.

[BibT_eX]

Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

1993

A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets.

[BibT_eX]

[DOI]

J. Symb. Comput., 1993

Decision Procedures for Set/Hyperset Contexts.

[BibT_eX]

[DOI]

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica?

[BibT_eX]

Gianfranco Rossi

Proceedings of the 8th Italian Conference on Logic Programming, 1993

1992

The Decision Problem for Restricted Universal Quantification in Set Theory and the Axiom of Foundation.

[BibT_eX]

[DOI]

Math. Log. Q., 1992

1991

Expressing Infinity Without Foundation.

[BibT_eX]

[DOI]

J. Symb. Log., 1991

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

[BibT_eX]

[DOI]

J. Autom. Reason., 1991

1990

On a generalization of Herbrand's theorem.

[BibT_eX]

PhD thesis, 1990

The Automation of Syllogistic.

[BibT_eX]

[DOI]

J. Autom. Reason., 1990

Truth Tables for a Combinatorial Kernel of Set Theories.

[BibT_eX]

Proceedings of the 9th European Conference on Artificial Intelligence, 1990

1989

Set-Theoretic Reductions of Hilbert's Tenth Problem.

[BibT_eX]

[DOI]

Vincenzo Cutello