default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlberto Policriti
Person information
SPARQL queries 
🛈 Please note that only 72% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j65]Christian Bianchini, Alberto Policriti, Brian Riccardi
, Riccardo Romanello:
Incremental NFA minimization. Theor. Comput. Sci. 1004: 114621 (2024)- [j64]Giovanna D'Agostino, Luca Geatti, Davide Martincigh, Alberto Policriti:
Cascade products and Wheeler automata. Theor. Comput. Sci. 1013: 114754 (2024) - [c89]Simone Boscaratto, Eugenio G. Omodeo, Alberto Policriti:
On Generalised Ackermann Encodings - The Basis Issue. CILC 2024 - [c88]Giovanni Manzini, Alberto Policriti, Nicola Prezza, Brian Riccardi:
The Rational Construction of a Wheeler DFA. CPM 2024: 23:1-23:15 - [c87]Roberto Pagliarini, Fabio Marroni, Carla Piazza, Giovanni Gabelli, Gabriele Magris, Gabriele Di Gaspero, Michele Morgante, Alberto Policriti:
Towards a Computational Approach to Quantification of Allele Specific Expression at Population Level. IWBBIO (2) 2024: 127-139 - [i18]Wesley Calvert, Valentina S. Harizanov, Eugenio G. Omodeo, Alberto Policriti, Alexandra Shlapentokh:
In Memory of Martin Davis. CoRR abs/2401.10154 (2024) - 2023
- [j63]Alberto Policriti, Eugenio G. Omodeo, Liesbeth De Mol:
Obituary of Martin Davis (1928-2023). IEEE Ann. Hist. Comput. 45(1): 93-94 (2023) - [j62]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Co-lexicographically Ordering Automata and Regular Languages - Part I. J. ACM 70(4): 27:1-27:73 (2023) - [j61]Giovanna D'Agostino, Davide Martincigh, Alberto Policriti:
Ordering regular languages and automata: Complexity. Theor. Comput. Sci. 949: 113709 (2023) - [c86]Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
Continued Hereditarily Finite Sets Approximations. CILC 2023 - [c85]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Testing Wheelerness of Regular Languages (short paper) (text not included). ICTCS 2023 - [c84]Giovanna D'Agostino, Luca Geatti, Davide Martincigh, Alberto Policriti:
A Linear-size Cascade Decomposition for Wheeler Automata. ICTCS 2023: 181-191 - [c83]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Optimal Wheeler Language Recognition. SPIRE 2023: 62-74 - [i17]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Optimal Wheeler Language Recognition. CoRR abs/2306.04737 (2023) - 2022
- [j60]Nicola Rizzo, Alexandru I. Tomescu, Alberto Policriti:
Solving String Problems on Graphs Using the Labeled Direct Product. Algorithmica 84(10): 3008-3033 (2022) - [j59]Alberto Policriti, Nicola Prezza:
Special Issue on Algorithms and Data-Structures for Compressed Computation. Algorithms 15(12): 457 (2022) - [c82]Brian Riccardi, Riccardo Romanello, Alberto Policriti, Christian Bianchini:
Incremental NFA Minimization. ICTCS 2022: 161-173 - [i16]Giovanna D'Agostino, Davide Martincigh, Alberto Policriti:
Ordering Regular Languages and Automata: Complexity. CoRR abs/2203.12534 (2022) - [i15]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Co-lexicographically ordering automata and regular languages. Part I. CoRR abs/2208.04931 (2022) - 2021
- [j58]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Wheeler languages. Inf. Comput. 281: 104820 (2021) - [c81]Davide Martincigh, Giovanna D'Agostino, Alberto Policriti:
Ordering Regular Languages: a Danger Zone. ICTCS 2021: 46-69 - [i14]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Which Regular Languages can be Efficiently Indexed? CoRR abs/2102.06798 (2021) - [i13]Giovanna D'Agostino, Davide Martincigh, Alberto Policriti:
Ordering regular languages: a danger zone. CoRR abs/2106.00315 (2021) - [i12]Giovanna D'Agostino, Nicola Cotumaccio, Alberto Policriti, Nicola Prezza:
On (co-lex) Ordering Automata. CoRR abs/2106.02309 (2021) - [i11]Nicola Rizzo, Alexandru I. Tomescu, Alberto Policriti:
The Labeled Direct Product Optimally Solves String Problems on Graphs. CoRR abs/2109.05290 (2021) - 2020
- [j57]Alice Tarzariol, Eugenia Zanazzo, Agostino Dovier, Alberto Policriti:
Towards a Logic Programming Tool for Cancer Data Analysis. Fundam. Informaticae 176(3-4): 299-319 (2020) - [j56]Laura Giordano, Alberto Policriti:
Adding the power-set to description logics. Theor. Comput. Sci. 813: 155-174 (2020) - [c80]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Regular Languages meet Prefix Sorting. SODA 2020: 911-930 - [i10]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Wheeler Languages. CoRR abs/2002.10303 (2020)
2010 – 2019
- 2019
- [c79]Eleonora Pippia, Arianna Bozzato, Emidio Tiberi, Riccardo Furlanetto, Alberto Policriti:
Optimization and Multistage Systems. The Thawing Case. OVERLAY@AI*IA 2019: 101-106 - [c78]Laura Giordano, Alberto Policriti:
Extending ALC with the power-set construct. CILC 2019 - [c77]Laura Giordano, Alberto Policriti:
Extending ALC with the Power-Set Construct. JELIA 2019: 387-398 - [e3]Massimo Bartoletti, Annalisa Barla, Andrea Bracciali, Gunnar W. Klau, Leif E. Peterson, Alberto Policriti, Roberto Tagliaferri:
Computational Intelligence Methods for Bioinformatics and Biostatistics - 14th International Meeting, CIBB 2017, Cagliari, Italy, September 7-9, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10834, Springer 2019, ISBN 978-3-030-14159-2 [contents] - [i9]Jarno Alanko, Alberto Policriti, Nicola Prezza:
On Prefix-Sorting Finite Automata. CoRR abs/1902.01088 (2019) - [i8]Laura Giordano, Alberto Policriti:
Adding the Power-Set to Description Logics. CoRR abs/1902.09844 (2019) - 2018
- [j55]Alberto Policriti, Nicola Prezza:
LZ77 Computation Based on the Run-Length Encoded BWT. Algorithmica 80(7): 1986-2011 (2018) - [c76]Laura Giordano, Alberto Policriti:
Power (Set) ALC (Extended Abstract). CILC 2018: 17-21 - [c75]Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg:
String Attractors: Verification and Optimization. ESA 2018: 52:1-52:13 - [c74]Laura Giordano, Alberto Policriti:
Power (Set) ALC. ICTCS 2018: 162-173 - [c73]Domenico Cantone, Alberto Policriti:
Encoding Sets as Real Numbers. SETS@ABZ 2018: 2-16 - [i7]Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg:
String Attractors: Verification and Optimization. CoRR abs/1803.01695 (2018) - [i6]Domenico Cantone, Alberto Policriti:
Encoding Sets as Real Numbers (Extended version). CoRR abs/1806.09329 (2018) - 2017
- [b3]Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
On Sets and Graphs: Perspectives on Logic and Combinatorics. Springer 2017, ISBN 978-3-319-54981-1 - [j54]Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Set-syllogistics meet combinatorics. Math. Struct. Comput. Sci. 27(2): 296-310 (2017) - [c72]Alberto Policriti, Nicola Prezza:
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. CPM 2017: 17:1-17:10 - [c71]Alice Tarzariol, Agostino Dovier, Alberto Policriti:
Towards a Logic Programming Tool for Cancer Analysis. ICTCS/CILC 2017: 361-375 - [c70]Simone Silvetti, Alberto Policriti, Luca Bortolussi:
An Active Learning Approach to the Falsification of Black Box Cyber-Physical Systems. IFM 2017: 3-17 - [i5]Alberto Policriti, Nicola Prezza:
From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. CoRR abs/1702.01340 (2017) - [i4]Simone Silvetti, Alberto Policriti, Luca Bortolussi:
An Active Learning Approach to the Falsification of Black Box Cyber-Physical Systems. CoRR abs/1705.01879 (2017) - 2016
- [j53]Nicola Prezza, Francesco Vezzi, Max Käller, Alberto Policriti:
Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2. BMC Bioinform. 17(S-4): 69 (2016) - [c69]Alessandro Dal Palù, Agostino Dovier, Andrea Formisano, Alberto Policriti, Enrico Pontelli:
Logic Programming Applied to Genome Evolution in Cancer. CILC 2016: 148-157 - [c68]Alberto Policriti, Nicola Prezza:
Computing LZ77 in Run-Compressed Space. DCC 2016: 23-32 - [c67]Luca Bortolussi, Alberto Policriti, Simone Silvetti:
Logic-Based Multi-objective Design of Chemical Reaction Networks. HSB 2016: 164-178 - [p1]Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
Banishing Ultrafilters from Our Consciousness. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 255-283 - [e2]Eugenio G. Omodeo, Alberto Policriti:
Martin Davis on Computability, Computational Logic, and Mathematical Foundations. Outstanding Contributions to Logic 10, Springer 2016, ISBN 978-3-319-41841-4 [contents] - [i3]Alberto Policriti, Nicola Prezza:
Fast Longest Common Extensions in Small Space. CoRR abs/1607.06660 (2016) - 2015
- [j52]Alberto Policriti, Nicola Prezza:
Fast randomized approximate string matching with succinct hash data structures. BMC Bioinform. 16(S-9): S4 (2015) - [j51]Chiara Bodei, Luca Bortolussi, Davide Chiarugi, Maria Luisa Guerriero, Alberto Policriti, Alessandro Romanel:
On the impact of discreteness and abstractions on modelling noise in gene regulatory networks. Comput. Biol. Chem. 56: 98-108 (2015) - [j50]Giovanna D'Agostino, Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Mapping Sets and Hypersets into Numbers. Fundam. Informaticae 140(3-4): 307-328 (2015) - [j49]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Rank and simulation: the well-founded case. J. Log. Comput. 25(6): 1331-1349 (2015) - [c66]Riccardo Vicedomini, Francesco Vezzi, Simone Scalabrin, Lars Arvestad, Alberto Policriti:
Hierarchical Assembly of Pools. IWBBIO (2) 2015: 207-218 - [c65]Alberto Policriti, Nicola Gigante, Nicola Prezza:
Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform. LATA 2015: 587-598 - [c64]Alberto Policriti, Nicola Prezza:
Fast Online Lempel-Ziv Factorization in Compressed Space. SPIRE 2015: 13-20 - [c63]Alberto Casagrande, Carla Piazza, Alberto Policriti:
Is Hyper-extensionality Preservable Under Deletions of Graph Elements? ICTCS 2015: 103-118 - [i2]Nicola Prezza, Alberto Policriti:
Computing LZ77 in Run-Compressed Space. CoRR abs/1510.06257 (2015) - 2014
- [j48]Marco Beccuti, Matteo Carrara, Francesca Cordero, Fulvio Lazzarato, Susanna Donatelli, Francesca Nadalin, Alberto Policriti, Raffaele A. Calogero:
Chimera: a Bioconductor package for secondary analysis of fusion products. Bioinform. 30(24): 3556-3557 (2014) - [c62]Eugenio G. Omodeo, Carla Piazza, Alberto Policriti, Alexandru I. Tomescu:
Hyper-Extensionality and One-Node Elimination on Membership Graphs. CILC 2014: 341-346 - [c61]Alberto Policriti, Nicola Prezza:
Hashing and Indexing: Succinct DataStructures and Smoothed Analysis. ISAAC 2014: 157-168 - [c60]Cristian Del Fabbro, Fabio Tardivo, Alberto Policriti:
A Parallel Algorithm for the Best k-Mismatches Alignment Problem. PDP 2014: 586-589 - 2013
- [j47]Alberto Policriti, Alexandru I. Tomescu:
Markov chain algorithms for generating sets uniformly at random. Ars Math. Contemp. 6(1): 57-68 (2013) - [j46]Riccardo Vicedomini, Francesco Vezzi, Simone Scalabrin, Lars Arvestad, Alberto Policriti:
GAM-NGS: genomic assemblies merger for next generation sequencing. BMC Bioinform. 14(S-7): S6 (2013) - [j45]Alberto Policriti, Alexandru I. Tomescu:
Well-quasi-ordering hereditarily finite sets. Int. J. Comput. Math. 90(6): 1278-1291 (2013) - [j44]Luca Bortolussi, Alberto Policriti:
(Hybrid) automata and (stochastic) programsThe hybrid automata lattice of a stochastic program. J. Log. Comput. 23(4): 761-798 (2013) - [c59]Alberto Policriti:
On the Decidability of the ∃*∀* Prefix Class in Set Theory. CILC 2013: 13 - [c58]Alberto Policriti:
Encodings of Sets and Hypersets. CILC 2013: 235-240 - 2012
- [j43]Francesco Vezzi, Cristian Del Fabbro, Alexandru I. Tomescu, Alberto Policriti:
rNA: a fast and accurate short reads numerical aligner. Bioinform. 28(1): 123-124 (2012) - [j42]Francesca Nadalin, Francesco Vezzi, Alberto Policriti:
GapFiller: a de novo assembly approach to fill the gap within paired reads. BMC Bioinform. 13(S-14): S8 (2012) - [j41]Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi:
A randomized Numerical Aligner (rNA). J. Comput. Syst. Sci. 78(6): 1868-1882 (2012) - [j40]Eugenio G. Omodeo, Alberto Policriti:
The Bernays - Schönfinkel - Ramsey class for set theory: decidability. J. Symb. Log. 77(3): 896-918 (2012) - [j39]Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Infinity, in short. J. Log. Comput. 22(6): 1391-1403 (2012) - [j38]Luca Bortolussi, Alberto Policriti:
Studying cancer-cell populations by programmable models of networks. Netw. Model. Anal. Health Informatics Bioinform. 1(3): 117-133 (2012) - [c57]Nicola Prezza, Cristian Del Fabbro, Francesco Vezzi, Emanuale De Paoli, Alberto Policriti:
ERNE-BS5: aligning BS-treated sequences by multiple hits on a 5-letters alphabet. BCB 2012: 12-19 - [c56]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Rank-Based Simulation on Acyclic Graphs. CILC 2012: 149-160 - [c55]Francesca Nadalin, Francesco Vezzi, Alberto Policriti:
A Multi-objective Optimisation Approach to the Design of Experiment in De Novo Assembly Projects. DEXA Workshops 2012: 213-217 - 2011
- [j37]Alberto Policriti, Alexandru I. Tomescu:
Counting extensional acyclic digraphs. Inf. Process. Lett. 111(16): 787-791 (2011) - [c54]Cristian Del Fabbro, Francesco Vezzi, Alberto Policriti:
mrNA: The MPI Randomized Numerical Aligner. BIBM 2011: 139-142 - [c53]Alberto Policriti, Alexandru I. Tomescu:
Well-Quasi-Ordering Hereditarily Finite Sets. LATA 2011: 440-451 - [c52]Luca Bortolussi, Alberto Policriti:
Programmable models of growth and mutation of cancer-cell populations. CompMod 2011: 19-33 - 2010
- [j36]Eugenio G. Omodeo, Alberto Policriti:
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. J. Symb. Log. 75(2): 459-480 (2010) - [j35]Luca Bortolussi, Alberto Policriti:
Hybrid dynamics of stochastic programs. Theor. Comput. Sci. 411(20): 2052-2077 (2010) - [c51]Federica Cattonaro, Alberto Policriti, Francesco Vezzi:
Enhanced reference guided assembly. BIBM 2010: 77-80 - [c50]Luca Bortolussi, Alberto Policriti:
Perspectives on Constraints, Process Algebras, and Hybrid Systems. WCB@ICLP 2010: 59-66 - [c49]Alberto Policriti, Alexandru I. Tomescu, Francesco Vezzi:
A Randomized Numerical Aligner (rNA). LATA 2010: 512-523
2000 – 2009
- 2009
- [j34]Simone Scalabrin, Michele Morgante, Alberto Policriti:
Automated FingerPrint Background removal: FPB. BMC Bioinform. 10 (2009) - [j33]Alberto Casagrande, Carla Piazza, Alberto Policriti:
Discrete Semantics for Hybrid Automata. Discret. Event Dyn. Syst. 19(4): 471-493 (2009) - [j32]Luca Bortolussi, Alberto Policriti:
Hybrid Dynamics of Stochastic pi-Calculus. Math. Comput. Sci. 2(3): 465-491 (2009) - [j31]Luca Bortolussi, Alberto Policriti:
Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back. Trans. Comp. Sys. Biology 11: 216-267 (2009) - [c48]Alberto Casagrande, Cristian Del Fabbro, Simone Scalabrin, Alberto Policriti:
GAM: Genomic Assemblies Merger: A Graph Based Method to Integrate Different Assemblies. BIBM 2009: 321-326 - [c47]Cristian Del Fabbro, Michele Morgante, Alberto Policriti, Nicola Vitacolonna:
TEA: a Transposable Elements Annotator. BIOCOMP 2009: 528-525 - [c46]Luca Bortolussi, Alberto Policriti:
Stochastic Programs and Hybrid Automata for (Biological) Modeling. CiE 2009: 37-48 - [c45]Luca Bortolussi, Alberto Policriti:
Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration. COMPMOD 2009: 63-76 - 2008
- [j30]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Symbolic Graphs: Linear Solutions to Connectivity Related Problems. Algorithmica 50(1): 120-158 (2008) - [j29]Luca Bortolussi, Alberto Policriti:
Modeling Biological Systems in Stochastic Concurrent Constraint Programming. Constraints An Int. J. 13(1-2): 66-90 (2008) - [j28]Alberto Casagrande, Carla Piazza, Alberto Policriti, Bud Mishra:
Inclusion dynamics hybrid automata. Inf. Comput. 206(12): 1394-1424 (2008) - [c44]Luca Bortolussi, Alberto Policriti:
Hybrid Semantics for Stochastic pi-Calculus. AB 2008: 40-55 - [c43]Carla Piazza, Alberto Policriti:
Systems Biology: Models and Logics. ICLP 2008: 14 - [c42]Radu Mardare, Alberto Policriti:
A Complete Axiomatic System for a Process-Based Spatial Logic. MFCS 2008: 491-502 - [c41]Luca Bortolussi, Alberto Policriti:
Hybrid Systems and Biology. SFM 2008: 424-448 - [c40]Luca Bortolussi, Alberto Policriti:
The Importance of Being (A Little Bit) Discrete. FBTC@ICALP 2008: 75-92 - 2007
- [c39]Luca Bortolussi, Simone Fonda, Alberto Policriti:
Constraint-Based Simulation of Biological Systems Described by Molecular Interaction Maps. BIBM 2007: 288-293 - [c38]Luca Bortolussi, Alberto Policriti:
Stochastic Concurrent Constraint Programming and Differential Equations. QAPL 2007: 27-42 - 2006
- [c37]Eugenio G. Omodeo, Domenico Cantone, Alberto Policriti, Jacob T. Schwartz:
A Computerized Referee. Reasoning, Action and Interaction in AI Theories and Systems 2006: 117-139 - [c36]Luca Bortolussi, Francesco Fabris, Alberto Policriti:
BuST-Bundled Suffix Trees. IFIP TCS 2006: 91-102 - 2005
- [j27]Michele Morgante, Alberto Policriti, Nicola Vitacolonna, Andrea Zuccolo:
Structured Motifs Search. J. Comput. Biol. 12(8): 1065-1082 (2005) - [j26]Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti:
The axiom of elementary sets on the edge of Peircean expressibility. J. Symb. Log. 70(3): 953-968 (2005) - [c35]Carla Piazza, Marco Antoniotti, Venkatesh Mysore, Alberto Policriti, Franz Winkler, Bud Mishra:
Algorithmic Algebraic Model Checking I: Challenges from Systems Biology. CAV 2005: 5-19 - [c34]Angelo Montanari, Alberto Policriti, Nicola Vitacolonna:
An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures. LPAR 2005: 139-153 - 2004
- [j25]Agostino Dovier, Carla Piazza, Alberto Policriti:
An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci. 311(1-3): 221-256 (2004) - [j24]Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti:
Three-variable statements of set-pairing. Theor. Comput. Sci. 322(1): 147-173 (2004) - [j23]Marco Antoniotti, Carla Piazza, Alberto Policriti, Marta Simeoni, Bud Mishra:
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice. Theor. Comput. Sci. 325(1): 45-67 (2004) - [j22]Carla Piazza, Alberto Policriti:
Ackermann Encoding, Bisimulations, and OBDDs. Theory Pract. Log. Program. 4(5-6): 695-718 (2004) - [c33]Alberto Casagrande, Andrea Balluchi, Luca Benvenuti, Alberto Policriti, Tiziano Villa, Alberto L. Sangiovanni-Vincentelli:
Improving reachability analysis of hybrid automata for engine control. CDC 2004: 2322-2327 - [c32]Alberto Policriti, Nicola Vitacolonna, Michele Morgante, Andrea Zuccolo:
Structured motifs search. RECOMB 2004: 133-139 - 2003
- [j21]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
From Bisimulation to Simulation: Coarsest Partition Problems. J. Autom. Reason. 31(1): 73-103 (2003) - [c31]Eugenio G. Omodeo, Ewa Orlowska, Alberto Policriti:
Rasiowa-Sikorski Style Relational Elementary Set Theory. RelMiCS 2003: 215-226 - [c30]Enrico Marzano, Angelo Montanari, Alberto Policriti:
Binary Extensions of S1S and the Composition Method. Verification: Theory and Practice 2003: 626-644 - [c29]Marco Antoniotti, Bhubaneswar Mishra, Carla Piazza, Alberto Policriti, Marta Simeoni:
Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing. CMSB 2003: 57-74 - [c28]Raffaella Gentilini, Alberto Policriti:
Biconnectivity on Symbolically Represented Graphs: A Linear Solution. ISAAC 2003: 554-564 - [c27]Marco Antoniotti, F. Park, Alberto Policriti, Nadia Ugel, Bud Mishra:
Foundations of a Query and Simulation System for the Modeling of Biochemical and Biological Processes. Pacific Symposium on Biocomputing 2003: 116-127 - [c26]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Computing strongly connected components in a linear number of symbolic steps. SODA 2003: 573-582 - [i1]Carla Piazza, Alberto Policriti:
Ackermann Encoding, Bisimulations, and OBDDs. CoRR cs.LO/0311018 (2003) - 2002
- [j20]Angelo Montanari, Alberto Policriti, Matteo Slanina:
Alternative Translation Techniques for Propositional and First-Order Modal Logics. J. Autom. Reason. 28(5): 397-415 (2002) - [j19]Angelo Montanari, Adriano Peron, Alberto Policriti:
Extending Kamp's Theorem to Model Time Granularity. J. Log. Comput. 12(4): 641-677 (2002) - [c25]Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti:
Automation of Aggregate Theories: The Cornerstones of Equational Expressibility. APPIA-GULP-PRODE 2002: 275- - [c24]Marco Antoniotti, Alberto Policriti, Nadia Ugel, Bud Mishra:
XS-systems: eXtended S-Systems and Algebraic Differential Automata for Modeling Cellular Behavior. HiPC 2002: 431-442 - [c23]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Simulation as Coarsest Partition Problem. TACAS 2002: 415-430 - [c22]Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Simulation Reduction as Constraint. WFLP 2002: 145-161 - [c21]Agostino Dovier, Raffaella Gentilini, Carla Piazza, Alberto Policriti:
Rank-Based Symbolic Bisimulation (and Model Checking). WoLLIC 2002: 166-183 - 2001
- [b2]Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
Set Theory for Computing - From Decision Procedures to Declarative Programming with Sets. Monographs in Computer Science, Springer 2001, ISBN 978-1-4419-2905-1, pp. 1-409 - [c20]Carla Piazza, Alberto Policriti:
Deciding modal logics using tableaux and set theory. APPIA-GULP-PRODE 2001: 261-276 - [c19]Agostino Dovier, Carla Piazza, Alberto Policriti:
A Fast Bisimulation Algorithm. CAV 2001: 79-90 - [c18]Luis Marti, Alberto Policriti, Luciano Garcia:
AppART: An ART Hybrid Stable Learning Neural Network for Universal Function Approximation. HIS 2001: 93-119 - [c17]Moreno Falaschi, Alberto Policriti, Alicia Villanueva:
Modeling concurrent systems specified in a temporal concurrent constraint language-I. APPIA-GULP-PRODE 2001: 197-210 - 2000
- [j18]Angelo Montanari, Adriano Peron, Alberto Policriti:
The Taming (Timing) of the States. Log. J. IGPL 8(5): 681-699 (2000) - [c16]Agostino Dovier, Carla Piazza, Alberto Policriti:
Comparing Expressiveness of Set Constructor Symbols. FroCoS 2000: 275-289 - [c15]Angelo Montanari, Alberto Policriti, Matteo Slanina:
Supporting automated deduction in first-order modal logics. KR 2000: 547-556 - [c14]Angelo Montanari, Alberto Policriti, Matteo Slanina:
Derivability in Locally Quantified Modal Logics via Translation in Set Theory. MFCS 2000: 559-568 - [c13]Carla Piazza, Alberto Policriti:
Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory. TABLEAUX 2000: 368-382
1990 – 1999
- 1999
- [j17]Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti:
Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case. Appl. Algebra Eng. Commun. Comput. 9(4): 293-332 (1999) - [j16]Angelo Montanari, Alberto Policriti, Yde Venema:
Editorial. Log. J. IGPL 7(1): 5-6 (1999) - [j15]Angelo Montanari, Adriano Peron, Alberto Policriti:
Theories of omega-Layered Metric Temporal Structures: Expressiveness and Decidability. Log. J. IGPL 7(1): 79-102 (1999) - [j14]Andrea Formisano, Alberto Policriti:
T-Resolution: Refinements and Model Elimination. J. Autom. Reason. 22(4): 433-483 (1999) - [c12]Agostino Dovier, Carla Piazza, Alberto Policriti:
Comparing expressiveness of set constructor symbols. APPIA-GULP-PRODE 1999: 151-166 - 1998
- [j13]Agostino Dovier, Alberto Policriti, Gianfranco Rossi:
A Uniform Axiomatic View of Lists, Multisets, and Sets, and the Relevant Unification Algorithms. Fundam. Informaticae 36(2-3): 201-234 (1998) - [j12]Johan van Benthem, Giovanna D'Agostino, Angelo Montanari, Alberto Policriti:
Modal Deduction in Second-Order Logic and Set Theory - II. Stud Logica 60(2): 387-420 (1998) - 1997
- [j11]Johan van Benthem, Giovanna D'Agostino, Angelo Montanari, Alberto Policriti:
Modal Deduction in Second-Order Logic and Set Theory - I. J. Log. Comput. 7(2): 251-265 (1997) - [c11]Agostino Dovier, Alberto Policriti:
Set domains for structural properties of terms. APPIA-GULP-PRODE 1997: 93-104 - [c10]Agostino Dovier, Andrea Formisano, Alberto Policriti:
On T Logic Programming. APPIA-GULP-PRODE 1997: 457-466 - [c9]Angelo Montanari, Alberto Policriti:
A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics. IJCAI (1) 1997: 196-201 - [c8]Agostino Dovier, Andrea Formisano, Alberto Policriti:
On T Logic Programming. ILPS 1997: 323-337 - [e1]Moreno Falaschi, Marisa Navarro, Alberto Policriti:
1997 Joint Conf. on Declarative Programming, APPIA-GULP-PRODE'97, Grado, Italy, June 16-19, 1997. 1997 [contents] - 1996
- [j10]Dikran Dikranjan, Alberto Policriti:
Complementation in the lattice of equivalence relations. Discret. Math. 159(1-3): 83-94 (1996) - [j9]Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
Decidability of ∃*∀-Sentences in Membership Theories. Math. Log. Q. 42: 41-58 (1996) - [j8]Angelo Montanari, Alberto Policriti:
Decidability Results for Metric and Layered Temporal Logics. Notre Dame J. Formal Log. 37(2): 260-282 (1996) - [c7]Agostino Dovier, Alberto Policriti, Gianfranco Rossi:
Integrating Lists, Multisets, and Sets in a Logic Programming Framework. FroCoS 1996: 303-319 - 1995
- [j7]Giovanna D'Agostino, Angelo Montanari, Alberto Policriti:
A Set-Theoretic Translation Method for Polymodal Logics. J. Autom. Reason. 15(3): 317-337 (1995) - [j6]Alberto Policriti, Jacob T. Schwartz:
T-Theorem Proving I. J. Symb. Comput. 20(3): 315-342 (1995) - [c6]Giovanna D'Agostino, Angelo Montanari, Alberto Policriti:
A Set-Theoretic Translation Method for (Poly)modal Logics. STACS 1995: 217-228 - 1994
- [c5]Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi:
Solving Systems of Equations over Hypersets. GULP-PRODE (1) 1994: 403-417 - 1993
- [j5]Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets. J. Symb. Comput. 15(5/6): 673-704 (1993) - [c4]Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi:
Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica? GULP 1993: 55-70 - [c3]Eugenio G. Omodeo, Alberto Policriti:
Decision Procedures for Set/Hyperset Contexts. DISCO 1993: 192-215 - 1992
- [j4]Franco Parlamento, Alberto Policriti:
The Decision Problem for Restricted Universal Quantification in Set Theory and the Axiom of Foundation. Math. Log. Q. 38(1): 143-156 (1992) - 1991
- [j3]Franco Parlamento, Alberto Policriti:
Decision Procedures for Elementary Sublanguages of Set Theory: XIII. Model Graphs, Reflection and Decidability. J. Autom. Reason. 7(2): 271-284 (1991) - [j2]Franco Parlamento, Alberto Policriti:
Expressing Infinity Without Foundation. J. Symb. Log. 56(4): 1230-1235 (1991) - 1990
- [b1]Alberto Policriti:
On a generalization of Herbrand's theorem. New York University, USA, 1990 - [j1]Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
The Automation of Syllogistic. J. Autom. Reason. 6(2): 173-187 (1990) - [c2]Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
Truth Tables for a Combinatorial Kernel of Set Theories. ECAI 1990: 485-490
1980 – 1989
- 1989
- [c1]Domenico Cantone, Vincenzo Cutello, Alberto Policriti:
Set-Theoretic Reductions of Hilbert's Tenth Problem. CSL 1989: 65-75
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
