default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandro Avellone
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Alessandro Avellone, Stefano Benati, Rosanna Grassi, Giorgio Rizzini:
On finding the community with maximum persistence probability. 4OR 22(4): 435-463 (2024)- 2022
- [j7]Alberto Arcagni
, Alessandro Avellone, Marco Fattore:
Complexity reduction and approximation of multidomain systems of partially ordered data. Comput. Stat. Data Anal. 173: 107520 (2022)
2010 – 2019
- 2015
- [j6]Alessandro Avellone, Camillo Fiorentini, Alberto Momigliano:
A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic. Fundam. Informaticae 140(3-4): 247-262 (2015) - 2013
- [c9]Alessandro Avellone, Camillo Fiorentini, Alberto Momigliano:
Focusing on Contraction. CILC 2013: 65-81
2000 – 2009
- 2008
- [j5]Alessandro Avellone, Guido Fiorino, Ugo Moscato:
Optimization techniques for propositional intuitionistic logic and their implementation. Theor. Comput. Sci. 409(1): 41-58 (2008) - 2007
- [c8]Alessandro Avellone, Guido Fiorino, Ugo Moscato:
Improvements to the Tableau Prover PITP. TABLEAUX 2007: 233-237 - 2005
- [c7]Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, Ugo Moscato:
ESBC: an application for computing stabilization bounds. CLASE 2005: 23-33 - 2004
- [c6]Alessandro Avellone, Camillo Fiorentini, Guido Fiorino, Ugo Moscato:
A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation. CSL 2004: 488-502 - 2001
- [j4]Alessandro Avellone, Marco Benini, Ugo Moscato:
How to Avoid the Formal Verification of a Theorem Prover. Log. J. IGPL 9(1): 1-25 (2001) - 2000
- [c5]Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini:
A formal framework for synthesis and verification of logic programs. LOPSTR 2000 - [c4]Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini:
A Formal Framework for Synthesis and Verification of Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 1-17
1990 – 1999
- 1999
- [j3]Alessandro Avellone, Mauro Ferrari, Pierangelo Miglioli:
Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Log. J. IGPL 7(4): 447-480 (1999) - 1998
- [j2]Alessandro Avellone, Massimiliano Goldwurm:
Analysis of algorithms for the recognition of rational and context-free trace languages. RAIRO Theor. Informatics Appl. 32(4-6): 141-152 (1998) - [c3]Alessandro Avellone, Mauro Ferrari, Pierangelo Miglioli:
Synthesis of Programs in Abstract Data Types. LOPSTR 1998: 81-100 - 1997
- [c2]Alessandro Avellone, Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi:
Generalized Tableau Systems for Intemediate Propositional Logics. TABLEAUX 1997: 43-61 - 1996
- [j1]Alessandro Avellone, Camillo Fiorentini, Paolo Mantovani, Pierangelo Miglioli:
On maximal intermediate predicate constructive logics. Stud Logica 57(2/3): 373-408 (1996) - [c1]Alessandro Avellone, Mauro Ferrari:
Almost Duplication-Free Tableau Calculi for Propositional Lax Logics. TABLEAUX 1996: 48-64
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-12-16 23:20 CET 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:
