Domenico Cantone
Domenico Cantone
Professor of Computer Science, University of Catania
Verified email at
Cited by
Cited by
Set theory for computing: from decision procedures to declarative programming with sets
D Cantone, E Omodeo, A Policriti
Springer Science & Business Media, 2013
Computable set theory
D Cantone, A Ferro, E Omodeo
Clarendon Press, 1989
Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces
D Cantone, A Ferro, A Pulvirenti, DR Recupero, D Shasha
IEEE transactions on knowledge and data engineering 17 (4), 535-550, 2005
Computational logic and set theory: Applying formalized logic to analysis
JT Schwartz, D Cantone, EG Omodeo
Springer Science & Business Media, 2011
Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm
D Cantone, S Faro
Experimental and Efficient Algorithms: Second International Workshop, WEA …, 2003
An efficient algorithm for the approximate median selection problem
S Battiato, D Cantone, D Catalano, G Cincotti, M Hofri
Italian Conference on Algorithms and Complexity, 226-238, 2000
The automation of syllogistic: II. Optimization and complexity issues
D Cantone, EG Omodeo, A Policriti
Journal of Automated Reasoning 6, 173-187, 1990
A computerized referee
EG Omodeo, D Cantone, A Policriti, JT Schwartz
Reasoning, Action and Interaction in AI Theories and Systems: Essays …, 2006
Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
D Cantone
Journal of Automated Reasoning 7, 193-230, 1991
A new fast tableau-based decision procedure for an unquantified fragment of set theory
D Cantone, CG Zarba
International Workshop on First-Order Theorem Proving, 126-136, 1998
Notes from the logbook of a proof-checker’s project
D Cantone, EG Omodeo, JT Schwartz, P Ursino
Verification: Theory and Practice: Essays Dedicated to Zohar Manna on the …, 2003
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
D Cantone, S Faro, E Giaquinta
Annual Symposium on Combinatorial Pattern Matching, 288-298, 2010
Set-theoretic reductions of Hilbert's tenth problem
D Cantone, V Cutello, A Policriti
International Workshop on Computer Science Logic, 65-75, 1989
Efficient string-matching allowing for non-overlapping inversions
D Cantone, S Cristofaro, S Faro
Theoretical Computer Science 483, 85-95, 2013
Fast-search algorithms: New efficient variants of the Boyer-Moore pattern-matching algorithm
D Cantone, S Faro
J. Autom. Lang. Comb. 10 (5/6), 589-608, 2005
QuickHeapsort, an efficient mix of classical sorting algorithms
D Cantone, G Cincotti
Theoretical Computer Science 285 (1), 25-42, 2002
Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
D Cantone, A Ferro, JT Schwartz
J. Comput. Syst. Sci. 34 (1), 1-18, 1987
Decision procedures for elementary sublanguages of set theory. VI. Multi‐level syllogistic extended by the powerset operator
D Cantone, JT Schwartz, A Ferro
Communications on Pure and Applied Mathematics 38 (5), 549-571, 1985
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
D Cantone, S Faro
Electronic Notes in Discrete Mathematics 17, 81-86, 2004
Techniques of computable set theory with applications to proof verification
D Cantone, A Ferro
Communications on Pure and Applied Mathematics 48 (9), 901-945, 1995
The system can't perform the operation now. Try again later.
Articles 1–20