( en | de | ru )

 

Disambiguation of "Longo, Cristiano"

Author of the publication

copydeleteadd this publication to your clipboard
A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions.

, and . Theor. Comput. Sci., (2014)

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.

José Longo

Fabio Longo

Silvano Longo

Paolo Longo

Claudio Longo

 

Other publications of authors with the same name

A decidable quantified fragment of set theory with ordered pairs and some undecidable extensions, and . GandALF, volume 96 of EPTCS, page 224-237. (2012)Representing Kinship Relations on the Semantic Web., , and . OWLED, volume 1080 of CEUR Workshop Proceedings, CEUR-WS.org, (2013)Herbrand-Satisfiability of a Quantified Set-theoretical Fragment., , and . CILC, volume 1195 of CEUR Workshop Proceedings, page 162-177. CEUR-WS.org, (2014)A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions., and . Theor. Comput. Sci., (2014)Blockchains Through Ontologies: The Case Study of the Ethereum ERC721 Standard in oasis., , , , and . IDC, volume 1026 of Studies in Computational Intelligence, page 249-259. Springer, (2021)Semantic Representation as a Key Enabler for Blockchain-Based Commerce., , , , and . GECON, volume 13072 of Lecture Notes in Computer Science, page 191-198. Springer, (2021)A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics., , and . CSL, volume 12 of LIPIcs, page 129-143. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Herbrand-satisfiability of a Quantified Set-theoretic Fragment., , and . Fundam. Informaticae, 150 (1): 49-71 (2017)Verifying Second-Level Security Protocols., , and . TPHOLs, volume 2758 of Lecture Notes in Computer Science, page 352-366. Springer, (2003)A protocol to preserve a code of conduct., and . SAC, page 1579-1585. ACM, (2007)