Alberto Policriti

According to our database1, Alberto Policriti authored at least 139 papers between 1989 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 




Which Regular Languages can be Efficiently Indexed?
CoRR, 2021

Adding the power-set to description logics.
Theor. Comput. Sci., 2020

Towards a Logic Programming Tool for Cancer Data Analysis.
Fundam. Informaticae, 2020

Wheeler Languages.
CoRR, 2020

Regular Languages meet Prefix Sorting.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

On Prefix-Sorting Finite Automata.
CoRR, 2019

Extending <i>ALC</i> with the Power-Set Construct.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Extending ALC with the power-set construct.
Proceedings of the 34th Italian Conference on Computational Logic, 2019

Optimization and Multistage Systems. The Thawing Case.
Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, 2019

Encoding Sets as Real Numbers (Extended version).
CoRR, 2018

LZ77 Computation Based on the Run-Length Encoded BWT.
Algorithmica, 2018

Encoding Sets as Real Numbers.
Proceedings of the 3rd International Workshop on Sets and Tools co-located with the 6th International ABZ Conference, 2018

Power (Set) ALC.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

String Attractors: Verification and Optimization.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Power (Set) ALC (Extended Abstract).
Proceedings of the 33rd Italian Conference on Computational Logic, 2018

Set-syllogistics meet combinatorics.
Math. Struct. Comput. Sci., 2017

An Active Learning Approach to the Falsification of Black Box Cyber-Physical Systems.
Proceedings of the Integrated Formal Methods - 13th International Conference, 2017

Towards a Logic Programming Tool for Cancer Analysis.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

On Sets and Graphs: Perspectives on Logic and Combinatorics
Springer, ISBN: 978-3-319-54980-4, 2017

Is Hyper-extensionality Preservable Under Deletions of Graph Elements?
Electron. Notes Theor. Comput. Sci., 2016

Fast Longest Common Extensions in Small Space.
CoRR, 2016

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

Logic-Based Multi-objective Design of Chemical Reaction Networks.
Proceedings of the Hybrid Systems Biology - 5th International Workshop, 2016

Computing LZ77 in Run-Compressed Space.
Proceedings of the 2016 Data Compression Conference, 2016

Logic Programming Applied to Genome Evolution in Cancer.
Proceedings of the 31st Italian Conference on Computational Logic, 2016

Banishing Ultrafilters from Our Consciousness.
Proceedings of the Martin Davis on Computability, 2016

Rank and simulation: the well-founded case.
J. Log. Comput., 2015

Mapping Sets and Hypersets into Numbers.
Fundam. Informaticae, 2015

On the impact of discreteness and abstractions on modelling noise in gene regulatory networks.
Comput. Biol. Chem., 2015

Fast randomized approximate string matching with succinct hash data structures.
BMC Bioinform., 2015

Fast Online Lempel-Ziv Factorization in Compressed Space.
Proceedings of the String Processing and Information Retrieval, 2015

Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform.
Proceedings of the Language and Automata Theory and Applications, 2015

Hierarchical Assembly of Pools.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

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

A Parallel Algorithm for the Best k-Mismatches Alignment Problem.
Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

Hashing and Indexing: Succinct DataStructures and Smoothed Analysis.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Hyper-Extensionality and One-Node Elimination on Membership Graphs.
Proceedings of the 29th Italian Conference on Computational Logic, 2014

(Hybrid) automata and (stochastic) programs<i>The hybrid automata lattice of a stochastic program</i>.
J. Log. Comput., 2013

Well-quasi-ordering hereditarily finite sets.
Int. J. Comput. Math., 2013

GAM-NGS: genomic assemblies merger for next generation sequencing.
BMC Bioinform., 2013

Markov chain algorithms for generating sets uniformly at random.
Ars Math. Contemp., 2013

Encodings of Sets and Hypersets.
Proceedings of the 28th Italian Conference on Computational Logic, 2013

On the Decidability of the ∃*∀* Prefix Class in Set Theory.
Proceedings of the 28th Italian Conference on Computational Logic, 2013

Studying cancer-cell populations by programmable models of networks.
Netw. Model. Anal. Health Informatics Bioinform., 2012

Infinity, in short.
J. Log. Comput., 2012

The Bernays - Schönfinkel - Ramsey class for set theory: decidability.
J. Symb. Log., 2012

A randomized Numerical Aligner (rNA).
J. Comput. Syst. Sci., 2012

GapFiller: a de novo assembly approach to fill the gap within paired reads.
BMC Bioinform., 2012

rNA: a fast and accurate short reads numerical aligner.
Bioinform., 2012

A Multi-objective Optimisation Approach to the Design of Experiment in De Novo Assembly Projects.
Proceedings of the 23rd International Workshop on Database and Expert Systems Applications, 2012

Rank-Based Simulation on Acyclic Graphs.
Proceedings of the 9th Italian Convention on Computational Logic, 2012

ERNE-BS5: aligning BS-treated sequences by multiple hits on a 5-letters alphabet.
Proceedings of the ACM International Conference on Bioinformatics, 2012

Counting extensional acyclic digraphs.
Inf. Process. Lett., 2011

Programmable models of growth and mutation of cancer-cell populations
Proceedings of the Proceedings Third International Workshop on Computational Models for Cell Processes, 2011

mrNA: The MPI Randomized Numerical Aligner.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

Hybrid dynamics of stochastic programs.
Theor. Comput. Sci., 2010

The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability.
J. Symb. Log., 2010

Perspectives on Constraints, Process Algebras, and Hybrid Systems.
Proceedings of the Workshop on Constraint Based Methods for Bioinformatics, 2010

Enhanced reference guided assembly.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back.
Trans. Comp. Sys. Biology, 2009

Hybrid Dynamics of Stochastic pi-Calculus.
Math. Comput. Sci., 2009

The Importance of Being (A Little Bit) Discrete.
Electron. Notes Theor. Comput. Sci., 2009

Discrete Semantics for Hybrid Automata.
Discret. Event Dyn. Syst., 2009

Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration
Proceedings of the Proceedings Second International Workshop on Computational Models for Cell Processes, 2009

Automated FingerPrint Background removal: FPB.
BMC Bioinform., 2009

Stochastic Programs and Hybrid Automata for (Biological) Modeling.
Proceedings of the Mathematical Theory and Computational Practice, 2009

TEA: a Transposable Elements Annotator.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2009

GAM: Genomic Assemblies Merger: A Graph Based Method to Integrate Different Assemblies.
Proceedings of the 2009 IEEE International Conference on Bioinformatics and Biomedicine, 2009

Inclusion dynamics hybrid automata.
Inf. Comput., 2008

Modeling Biological Systems in Stochastic Concurrent Constraint Programming.
Constraints An Int. J., 2008

Symbolic Graphs: Linear Solutions to Connectivity Related Problems.
Algorithmica, 2008

Hybrid Systems and Biology.
Proceedings of the Formal Methods for Computational Systems Biology, 2008

A Complete Axiomatic System for a Process-Based Spatial Logic.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Systems Biology: Models and Logics.
Proceedings of the Logic Programming, 24th International Conference, 2008

Hybrid Semantics for Stochastic pi-Calculus.
Proceedings of the Algebraic Biology, Third International Conference, 2008

Stochastic Concurrent Constraint Programming and Differential Equations.
Electron. Notes Theor. Comput. Sci., 2007

Constraint-Based Simulation of Biological Systems Described by Molecular Interaction Maps.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2007

BuST-Bundled Suffix Trees.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

A Computerized Referee.
Proceedings of the Reasoning, 2006

The axiom of elementary sets on the edge of Peircean expressibility.
J. Symb. Log., 2005

Structured Motifs Search.
J. Comput. Biol., 2005

An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures.
Proceedings of the Logic for Programming, 2005

Algorithmic Algebraic Model Checking I: Challenges from Systems Biology.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

Ackermann Encoding, Bisimulations, and OBDDs.
Theory Pract. Log. Program., 2004

Three-variable statements of set-pairing.
Theor. Comput. Sci., 2004

An efficient algorithm for computing bisimulation equivalence.
Theor. Comput. Sci., 2004

Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice.
Theor. Comput. Sci., 2004

From Bisimulation to Simulation: Coarsest Partition Problems.
J. Autom. Reason., 2003

Computing strongly connected components in a linear number of symbolic steps.
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.
Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

Biconnectivity on Symbolically Represented Graphs: A Linear Solution.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing.
Proceedings of the Computational Methods in Systems Biology, First International Workshop, 2003

Binary Extensions of S1S and the Composition Method.
Proceedings of the Verification: Theory and Practice, 2003

Rasiowa-Sikorski Style Relational Elementary Set Theory.
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

Extending Kamp's Theorem to Model Time Granularity.
J. Log. Comput., 2002

Alternative Translation Techniques for Propositional and First-Order Modal Logics.
J. Autom. Reason., 2002

Simulation Reduction as Constraint.
Electron. Notes Theor. Comput. Sci., 2002

Rank-Based Symbolic Bisimulation (and Model Checking).
Electron. Notes Theor. Comput. Sci., 2002

Simulation as Coarsest Partition Problem.
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.
Proceedings of the High Performance Computing, 2002

Automation of Aggregate Theories: The Cornerstones of Equational Expressibility.
Proceedings of the AGP 2002: Proceedings of the Joint Conference on Declarative Programming, 2002

Set Theory for Computing - From Decision Procedures to Declarative Programming with Sets
Monographs in Computer Science, Springer, ISBN: 978-1-4757-3452-2, 2001

Modeling concurrent systems specified in a temporal concurrent constraint language-I.
Proceedings of the Declarative Programming, 2001

AppART: An ART Hybrid Stable Learning Neural Network for Universal Function Approximation.
Proceedings of the Hybrid Information Systems, 2001

A Fast Bisimulation Algorithm.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

Deciding modal logics using tableaux and set theory.
Proceedings of the APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, 2001

The Taming (Timing) of the States.
Log. J. IGPL, 2000

Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Derivability in Locally Quantified Modal Logics via Translation in Set Theory.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Supporting automated deduction in first-order modal logics.
Proceedings of the KR 2000, 2000

T-Resolution: Refinements and Model Elimination.
J. Autom. Reason., 1999

Log. J. IGPL, 1999

Theories of omega-Layered Metric Temporal Structures: Expressiveness and Decidability.
Log. J. IGPL, 1999

Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case.
Appl. Algebra Eng. Commun. Comput., 1999

Comparing expressiveness of set constructor symbols.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

Modal Deduction in Second-Order Logic and Set Theory - II.
Stud Logica, 1998

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

Modal Deduction in Second-Order Logic and Set Theory - I.
J. Log. Comput., 1997

On T Logic Programming.
Proceedings of the Logic Programming, 1997

A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Set domains for structural properties of terms.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

Decidability Results for Metric and Layered Temporal Logics.
Notre Dame J. Formal Log., 1996

Decidability of ∃<sup>*</sup>∀-Sentences in Membership Theories.
Math. Log. Q., 1996

Complementation in the lattice of equivalence relations.
Discret. Math., 1996

Integrating Lists, Multisets, and Sets in a Logic Programming Framework.
Proceedings of the Frontiers of Combining Systems, 1996

T-Theorem Proving I.
J. Symb. Comput., 1995

A Set-Theoretic Translation Method for Polymodal Logics.
J. Autom. Reason., 1995

A Set-Theoretic Translation Method for (Poly)modal Logics.
Proceedings of the STACS 95, 1995

Solving Systems of Equations over Hypersets.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets.
J. Symb. Comput., 1993

Decision Procedures for Set/Hyperset Contexts.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica?
Proceedings of the 8th Italian Conference on Logic Programming, 1993

The Decision Problem for Restricted Universal Quantification in Set Theory and the Axiom of Foundation.
Math. Log. Q., 1992

Expressing Infinity Without Foundation.
J. Symb. Log., 1991

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

The Automation of Syllogistic.
J. Autom. Reason., 1990

Truth Tables for a Combinatorial Kernel of Set Theories.
Proceedings of the 9th European Conference on Artificial Intelligence, 1990

Set-Theoretic Reductions of Hilbert's Tenth Problem.
Proceedings of the CSL '89, 1989