| 2009 |
| 71 | EE | Luca Bortolussi,
Alberto Policriti:
The Importance of Being (A Little Bit) Discrete.
Electr. Notes Theor. Comput. Sci. 229(1): 75-92 (2009) |
| 2008 |
| 70 | EE | Luca Bortolussi,
Alberto Policriti:
Hybrid Semantics for Stochastic pi-Calculus.
AB 2008: 40-55 |
| 69 | EE | Carla Piazza,
Alberto Policriti:
Systems Biology: Models and Logics.
ICLP 2008: 14 |
| 68 | EE | Radu Mardare,
Alberto Policriti:
A Complete Axiomatic System for a Process-Based Spatial Logic.
MFCS 2008: 491-502 |
| 67 | EE | Luca Bortolussi,
Alberto Policriti:
Hybrid Systems and Biology.
SFM 2008: 424-448 |
| 66 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Symbolic Graphs: Linear Solutions to Connectivity Related Problems.
Algorithmica 50(1): 120-158 (2008) |
| 65 | EE | Luca Bortolussi,
Alberto Policriti:
Modeling Biological Systems in Stochastic Concurrent Constraint Programming.
Constraints 13(1-2): 66-90 (2008) |
| 64 | EE | Alberto Casagrande,
Carla Piazza,
Alberto Policriti,
Bud Mishra:
Inclusion dynamics hybrid automata.
Inf. Comput. 206(12): 1394-1424 (2008) |
| 2007 |
| 63 | EE | Luca Bortolussi,
Simone Fonda,
Alberto Policriti:
Constraint-Based Simulation of Biological Systems Described by Molecular Interaction Maps.
BIBM 2007: 288-293 |
| 62 | EE | Luca Bortolussi,
Alberto Policriti:
Stochastic Concurrent Constraint Programming and Differential Equations.
Electr. Notes Theor. Comput. Sci. 190(3): 27-42 (2007) |
| 2006 |
| 61 | EE | Luca Bortolussi,
Francesco Fabris,
Alberto Policriti:
BuST-Bundled Suffix Trees.
IFIP TCS 2006: 91-102 |
| 60 | EE | 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 |
| 2005 |
| 59 | EE | 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 |
| 58 | EE | Angelo Montanari,
Alberto Policriti,
Nicola Vitacolonna:
An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures.
LPAR 2005: 139-153 |
| 57 | EE | Michele Morgante,
Alberto Policriti,
Nicola Vitacolonna,
Andrea Zuccolo:
Structured Motifs Search.
Journal of Computational Biology 12(8): 1065-1082 (2005) |
| 2004 |
| 56 | EE | Alberto Policriti,
Nicola Vitacolonna,
Michele Morgante,
Andrea Zuccolo:
Structured motifs search.
RECOMB 2004: 133-139 |
| 55 | | Carla Piazza,
Alberto Policriti:
Ackermann Encoding, Bisimulations, and OBDDs.
TPLP 4(5-6): 695-718 (2004) |
| 54 | EE | Agostino Dovier,
Carla Piazza,
Alberto Policriti:
An efficient algorithm for computing bisimulation equivalence.
Theor. Comput. Sci. 311(1-3): 221-256 (2004) |
| 53 | EE | Andrea Formisano,
Eugenio G. Omodeo,
Alberto Policriti:
Three-variable statements of set-pairing.
Theor. Comput. Sci. 322(1): 147-173 (2004) |
| 52 | EE | 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) |
| 2003 |
| 51 | EE | Marco Antoniotti,
Bhubaneswar Mishra,
Carla Piazza,
Alberto Policriti,
Marta Simeoni:
Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing.
CMSB 2003: 57-74 |
| 50 | EE | Raffaella Gentilini,
Alberto Policriti:
Biconnectivity on Symbolically Represented Graphs: A Linear Solution.
ISAAC 2003: 554-564 |
| 49 | EE | 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 |
| 48 | EE | Eugenio G. Omodeo,
Ewa Orlowska,
Alberto Policriti:
Rasiowa-Sikorski Style Relational Elementary Set Theory.
RelMiCS 2003: 215-226 |
| 47 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Computing strongly connected components in a linear number of symbolic steps.
SODA 2003: 573-582 |
| 46 | EE | Enrico Marzano,
Angelo Montanari,
Alberto Policriti:
Binary Extensions of S1S and the Composition Method.
Verification: Theory and Practice 2003: 626-644 |
| 45 | EE | Carla Piazza,
Alberto Policriti:
Ackermann Encoding, Bisimulations, and OBDDs
CoRR cs.LO/0311018: (2003) |
| 44 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
From Bisimulation to Simulation: Coarsest Partition Problems.
J. Autom. Reasoning 31(1): 73-103 (2003) |
| 2002 |
| 43 | EE | 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 |
| 42 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Simulation as Coarsest Partition Problem.
TACAS 2002: 415-430 |
| 41 | EE | Agostino Dovier,
Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Rank-Based Symbolic Bisimulation (and Model Checking).
Electr. Notes Theor. Comput. Sci. 67: (2002) |
| 40 | EE | Raffaella Gentilini,
Carla Piazza,
Alberto Policriti:
Simulation Reduction as Constraint.
Electr. Notes Theor. Comput. Sci. 76: (2002) |
| 39 | | Angelo Montanari,
Alberto Policriti,
Matteo Slanina:
Alternative Translation Techniques for Propositional and First-Order Modal Logics.
J. Autom. Reasoning 28(5): 397-415 (2002) |
| 38 | EE | Angelo Montanari,
Adriano Peron,
Alberto Policriti:
Extending Kamp's Theorem to Model Time Granularity.
J. Log. Comput. 12(4): 641-677 (2002) |
| 2001 |
| 37 | EE | Agostino Dovier,
Carla Piazza,
Alberto Policriti:
A Fast Bisimulation Algorithm.
CAV 2001: 79-90 |
| 36 | | Luis Marti,
Alberto Policriti,
Luciano Garcia:
AppART: An ART Hybrid Stable Learning Neural Network for Universal Function Approximation.
HIS 2001: 93-119 |
| 35 | EE | Moreno Falaschi,
Alberto Policriti,
Alicia Villanueva:
Modeling concurrent systems specified in a temporal concurrent constraint language-I.
Electr. Notes Theor. Comput. Sci. 48: (2001) |
| 2000 |
| 34 | | Agostino Dovier,
Carla Piazza,
Alberto Policriti:
Comparing Expressiveness of Set Constructor Symbols.
FroCos 2000: 275-289 |
| 33 | | Angelo Montanari,
Alberto Policriti,
Matteo Slanina:
Supporting automated deduction in first-order modal logics.
KR 2000: 547-556 |
| 32 | EE | Angelo Montanari,
Alberto Policriti,
Matteo Slanina:
Derivability in Locally Quantified Modal Logics via Translation in Set Theory.
MFCS 2000: 559-568 |
| 31 | | Carla Piazza,
Alberto Policriti:
Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory.
TABLEAUX 2000: 368-382 |
| 30 | EE | Angelo Montanari,
Adriano Peron,
Alberto Policriti:
The Taming (Timing) of the States.
Logic Journal of the IGPL 8(5): (2000) |
| 1999 |
| 29 | | Agostino Dovier,
Carla Piazza,
Alberto Policriti:
Comparing expressiveness of set constructor symbols.
APPIA-GULP-PRODE 1999: 151-166 |
| 28 | EE | 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) |
| 27 | | Andrea Formisano,
Alberto Policriti:
T-Resolution: Refinements and Model Elimination.
J. Autom. Reasoning 22(4): 433-483 (1999) |
| 26 | EE | Angelo Montanari,
Alberto Policriti,
Yde Venema:
Editorial.
Logic Journal of the IGPL 7(1): 5-6 (1999) |
| 25 | EE | Angelo Montanari,
Adriano Peron,
Alberto Policriti:
Theories of omega-Layered Metric Temporal Structures: Expressiveness and Decidability.
Logic Journal of the IGPL 7(1): 79-102 (1999) |
| 1998 |
| 24 | | Agostino Dovier,
Alberto Policriti,
Gianfranco Rossi:
A Uniform Axiomatic View of Lists, Multisets, and Sets, and the Relevant Unification Algorithms.
Fundam. Inform. 36(2-3): 201-234 (1998) |
| 23 | | Johan van Benthem,
Giovanna D'Agostino,
Angelo Montanari,
Alberto Policriti:
Modal Deduction in Second-Order Logic and Set Theory - II.
Studia Logica 60(2): 387-420 (1998) |
| 1997 |
| 22 | | Moreno Falaschi,
Marisa Navarro,
Alberto Policriti:
1997 Joint Conf. on Declarative Programming, APPIA-GULP-PRODE'97, Grado, Italy, June 16-19, 1997
APPIA-GULP-PRODE 1997 |
| 21 | | Agostino Dovier,
Andrea Formisano,
Alberto Policriti:
On T Logic Programming.
APPIA-GULP-PRODE 1997: 457-466 |
| 20 | | Agostino Dovier,
Alberto Policriti:
Set domains for structural properties of terms.
APPIA-GULP-PRODE 1997: 93-104 |
| 19 | | Angelo Montanari,
Alberto Policriti:
A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics.
IJCAI (1) 1997: 196-201 |
| 18 | | Agostino Dovier,
Andrea Formisano,
Alberto Policriti:
On T Logic Programming.
ILPS 1997: 323-337 |
| 17 | | 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) |
| 1996 |
| 16 | | Agostino Dovier,
Alberto Policriti,
Gianfranco Rossi:
Integrating Lists, Multisets, and Sets in a Logic Programming Framework.
Frontiers of Combining Systems (FroCos) 1996: 303-319 |
| 15 | EE | Dikran Dikranjan,
Alberto Policriti:
Complementation in the lattice of equivalence relations.
Discrete Mathematics 159(1-3): 83-94 (1996) |
| 14 | | Eugenio G. Omodeo,
Franco Parlamento,
Alberto Policriti:
Decidability of exist*forall-Sentences in Membership Theories.
Math. Log. Q. 42: 41-58 (1996) |
| 13 | | Angelo Montanari,
Alberto Policriti:
Decidability Results for Metric and Layered Temporal Logics.
Notre Dame Journal of Formal Logic 37(2): 260-282 (1996) |
| 1995 |
| 12 | | Giovanna D'Agostino,
Angelo Montanari,
Alberto Policriti:
A Set-Theoretic Translation Method for (Poly)modal Logics.
STACS 1995: 217-228 |
| 11 | | Giovanna D'Agostino,
Angelo Montanari,
Alberto Policriti:
A Set-Theoretic Translation Method for Polymodal Logics.
J. Autom. Reasoning 15(3): 317-337 (1995) |
| 10 | | Alberto Policriti,
Jacob T. Schwartz:
T-Theorem Proving I.
J. Symb. Comput. 20(3): 315-342 (1995) |
| 1994 |
| 9 | | Agostino Dovier,
Eugenio G. Omodeo,
Alberto Policriti,
Gianfranco Rossi:
Solving Systems of Equations over Hypersets.
GULP-PRODE (1) 1994: 403-417 |
| 1993 |
| 8 | | Eugenio G. Omodeo,
Alberto Policriti:
Decision Procedures for Set/Hyperset Contexts.
DISCO 1993: 192-215 |
| 7 | | Eugenio G. Omodeo,
Alberto Policriti,
Gianfranco Rossi:
Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica?
GULP 1993: 55-70 |
| 6 | | 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) |
| 1991 |
| 5 | | Franco Parlamento,
Alberto Policriti:
Decision Procedures for Elementary Sublanguages of Set Theory: XIII. Model Graphs, Reflection and Decidability.
J. Autom. Reasoning 7(2): 271-284 (1991) |
| 4 | | Franco Parlamento,
Alberto Policriti:
Expressing Infinity Without Foundation.
J. Symb. Log. 56(4): 1230-1235 (1991) |
| 1990 |
| 3 | | Eugenio G. Omodeo,
Franco Parlamento,
Alberto Policriti:
Truth Tables for a Combinatorial Kernel of Set Theories.
ECAI 1990: 485-490 |
| 2 | | Domenico Cantone,
Eugenio G. Omodeo,
Alberto Policriti:
The Automation of Syllogistic.
J. Autom. Reasoning 6(2): 173-187 (1990) |
| 1989 |
| 1 | | Domenico Cantone,
Vincenzo Cutello,
Alberto Policriti:
Set-Theoretic Reductions of Hilbert's Tenth Problem.
CSL 1989: 65-75 |