Alberto Policriti

From MaRDI portal
Person:626877

Available identifiers

zbMath Open policriti.albertoWikidataQ102332329 ScholiaQ102332329MaRDI QIDQ626877

List of research outcomes





PublicationDate of PublicationType
Cascade products and Wheeler automata2024-10-01Paper
In memory of Martin Davis2024-09-26Paper
Reasoning on relations, modalities, and sets2024-09-06Paper
Incremental NFA minimization2024-06-19Paper
Optimal Wheeler language recognition2024-05-29Paper
Ordering regular languages and automata: complexity2023-02-24Paper
Solving string problems on graphs using the labeled direct product2022-10-06Paper
https://portal.mardi4nfdi.de/entity/Q50877882022-07-01Paper
Wheeler languages2021-11-25Paper
https://portal.mardi4nfdi.de/entity/Q50096162021-08-04Paper
Regular Languages meet Prefix Sorting2021-02-02Paper
Banishing ultrafilters from our consciousness2020-08-06Paper
From LZ77 to the run-length encoded Burrows-Wheeler transform, and back2020-05-25Paper
Adding the power-set to description logics2020-04-21Paper
Extending \(\mathcal{ALC}\) with the power-set construct2020-02-18Paper
Logic-based multi-objective design of chemical reaction networks2019-12-04Paper
LZ77 computation based on the run-length encoded BWT2018-07-25Paper
A set-theoretic translation method for (poly)modal logics2017-12-04Paper
On sets and graphs. Perspectives on logic and combinatorics2017-09-26Paper
Set-syllogistics meet combinatorics2017-04-04Paper
Mapping Sets and Hypersets into Numbers2016-08-15Paper
Is hyper-extensionality preservable under deletions of graph elements?2016-08-05Paper
Average linear time and compressed space construction of the Burrows-Wheeler transform2016-04-08Paper
Rank and simulation: the well-founded case2015-12-28Paper
Hashing and indexing: succinct data structures and smoothed analysis2015-09-11Paper
Markov chain algorithms for generating sets uniformly at random2014-10-22Paper
The Importance of Being (A Little Bit) Discrete2014-03-21Paper
Stochastic concurrent constraint programming and differential equations2014-01-17Paper
Well-quasi-ordering hereditarily finite sets2013-10-22Paper
(Hybrid) automata and (stochastic) programs. The hybrid automata lattice of a stochastic program2013-08-27Paper
Modeling concurrent systems specified in a temporal concurrent constraint language. I2013-05-24Paper
Rank-based symbolic bisimulation: (and model checking)2013-04-19Paper
Counting extensional acyclic digraphs2013-04-04Paper
Infinity, in short2013-01-14Paper
A randomized numerical aligner (rNA)2012-11-06Paper
The Bernays-Schönfinkel-Ramsey class for set theory: decidability2012-09-19Paper
Statements of ill-founded infinity in set theory2011-10-05Paper
Well-quasi-ordering hereditarily finite sets2011-06-03Paper
Stating infinity in set/hyperset theory2011-05-20Paper
Hybrid dynamics of stochastic \(\pi \)-calculus2011-02-19Paper
Stochastic programs and hybrid automata for (biological) modeling2010-07-28Paper
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability2010-06-24Paper
A randomized numerical aligner (rNA)2010-05-26Paper
Hybrid dynamics of stochastic programs2010-05-11Paper
Binary extensions of S1S and the composition method2010-03-23Paper
Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology2010-01-18Paper
Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back2009-11-10Paper
Algorithms and Computation2009-08-07Paper
Inclusion dynamics hybrid automata2009-02-03Paper
Hybrid Semantics for Stochastic π-Calculus2009-02-03Paper
A Complete Axiomatic System for a Process-Based Spatial Logic2009-02-03Paper
Modeling biological systems in stochastic concurrent constraint programming2008-09-02Paper
An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures2008-05-27Paper
Symbolic graphs: Linear solutions to connectivity related problems2008-02-18Paper
The axiom of elementary sets on the edge of Peircean expressibility2006-01-16Paper
Relational and Kleene-Algebraic Methods in Computer Science2005-12-23Paper
https://portal.mardi4nfdi.de/entity/Q46686102005-04-19Paper
Ackermann encoding, bisimulations and OBDDs2005-04-15Paper
An efficient algorithm for computing bisimulation equivalence2004-10-27Paper
Three-variable statements of set-pairing2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44722572004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44713462004-07-28Paper
From bisimulation to simulation: Coarsest partition problems2004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44174902003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44132062003-07-17Paper
Extending Kamp's Theorem to Model Time Granularity2003-03-13Paper
https://portal.mardi4nfdi.de/entity/Q47834592002-12-04Paper
https://portal.mardi4nfdi.de/entity/Q45363922002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q45511362002-09-04Paper
Alternative translation techniques for propositional and first-order modal logics2002-08-20Paper
https://portal.mardi4nfdi.de/entity/Q27408872001-09-05Paper
The taming (timing) of the states2001-07-09Paper
https://portal.mardi4nfdi.de/entity/Q27212082001-07-01Paper
https://portal.mardi4nfdi.de/entity/Q45188752000-12-03Paper
Modal deduction in second-order logic and set theory. II2000-11-21Paper
https://portal.mardi4nfdi.de/entity/Q49523062000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q49409372000-02-28Paper
\(T\)-resolution: Refinements and model elimination2000-01-25Paper
https://portal.mardi4nfdi.de/entity/Q42684921999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42641051999-09-16Paper
Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case1999-06-02Paper
Theories of  -layered metric temporal structures: expressiveness and decidability1999-03-30Paper
Finite families with few symmetric differences1999-01-25Paper
https://portal.mardi4nfdi.de/entity/Q43854501998-04-13Paper
Modal deduction in second-order logic and set theory - I1997-06-10Paper
Decidability results for metric and layered temporal logics1997-03-19Paper
Witnessing differences without redundancies1997-02-19Paper
Complementation in the lattice of equivalence relations1996-12-08Paper
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case1996-11-04Paper
\(T\)-theorem proving. I1996-06-04Paper
Decidability of ∀*∀‐Sentences in Membership Theories1996-05-02Paper
A set-theoretic translation method for polymodal logics1995-12-20Paper
Undecidability results for restricted universally quantified formulae of set theory1994-10-17Paper
A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets1994-09-26Paper
THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION1994-07-11Paper
Expressing infinity without foundation1992-06-27Paper
The automation of syllogistic. II: Optimization and complexity issues1992-06-25Paper
Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability1991-01-01Paper
Note on "The Logically Simplest Form of the Infinity Axiom"1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34899781988-01-01Paper
Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory1988-01-01Paper
The Logically Simplest Form of the Infinity Axiom1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47311661987-01-01Paper
In Memory of Martin DavisN/APaper

Research outcomes over time

This page was built for person: Alberto Policriti