( en | de | ru )

 

Disambiguation of "Cantone, Domenico"

Author of the publication

copydeleteadd this publication to your clipboard
A Set-Theoretic Approach to ABox Reasoning Services.

, , and . RuleML+RR, volume 10364 of Lecture Notes in Computer Science, page 87-102. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Domenico Laurendi

Domenico Castrigiano

Domenico Lupo

Domenico Pavone

Domenico Tamburro

 

Other publications of authors with the same name

A Relational Dual Tableau Decision Procedure for Multimodal and Description Logics., , and . HAIS, volume 8480 of Lecture Notes in Computer Science, page 466-477. Springer, (2014)A Sound Framework for delta-Rule Variants in Free-Variable Semantic Tableaux., and . J. Autom. Reason., 38 (1-3): 31-56 (2007)Decision Problems for Tarski and Presburger Arithmetics Extended With Sets., , and . CSL, volume 533 of Lecture Notes in Computer Science, page 95-109. Springer, (1990)Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces., , , , and . IEEE Trans. Knowl. Data Eng., 17 (4): 535-550 (2005)A Decidable Fragment of the Elementary Theory of Relations and Some Applications., and . ISSAC, page 24-29. ACM, (1990)Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory., , , and . CILC, volume 2396 of CEUR Workshop Proceedings, page 123-137. CEUR-WS.org, (2019)A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory., and . FTP (LNCS Selection), volume 1761 of Lecture Notes in Computer Science, page 126-136. Springer, (1998)An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem., , and . Stringology, page 22-35. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2015)QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms., and . CIAC, volume 1767 of Lecture Notes in Computer Science, page 150-162. Springer, (2000)A Potential-Based Variant of the Bellman-Ford Algorithm., , and . ICTCS, volume 2504 of CEUR Workshop Proceedings, page 122-135. CEUR-WS.org, (2019)