Capturing relational NEXPTIME with a fragment of existential third order logic

Autores
Turull Torres, José María
Año de publicación
2015
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
We prove that the existential fragment Σ²1,ω of the third or- der logic TOω captures the relational complexity class non deterministic exponential time. As a Corollary we have that relational machines can simulate third order relational machines.
XII Workshop Bases de Datos y Minería de Datos (WBDDM)
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
relational machines
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/50424
Acceder
id SEDICI_4d9583870938e8138f9c0573027d5d78
oai_identifier_str oai:sedici.unlp.edu.ar:10915/50424
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Capturing relational NEXPTIME with a fragment of existential third order logicTurull Torres, José MaríaCiencias Informáticasrelational machinesWe prove that the existential fragment Σ²<sub>1</sub><sup>,ω</sup> of the third or- der logic TO<sup>ω</sup> captures the relational complexity class non deterministic exponential time. As a Corollary we have that relational machines can simulate third order relational machines.XII Workshop Bases de Datos y Minería de Datos (WBDDM)Red de Universidades con Carreras en Informática (RedUNCI)2015-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/50424enginfo:eu-repo/semantics/altIdentifier/isbn/978-987-3806-05-6info:eu-repo/semantics/reference/hdl/10915/50028info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:03:56Zoai:sedici.unlp.edu.ar:10915/50424Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:03:57.148SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Capturing relational NEXPTIME with a fragment of existential third order logic
title Capturing relational NEXPTIME with a fragment of existential third order logic
spellingShingle Capturing relational NEXPTIME with a fragment of existential third order logic
Turull Torres, José María
Ciencias Informáticas
relational machines
title_short Capturing relational NEXPTIME with a fragment of existential third order logic
title_full Capturing relational NEXPTIME with a fragment of existential third order logic
title_fullStr Capturing relational NEXPTIME with a fragment of existential third order logic
title_full_unstemmed Capturing relational NEXPTIME with a fragment of existential third order logic
title_sort Capturing relational NEXPTIME with a fragment of existential third order logic
dc.creator.none.fl_str_mv Turull Torres, José María
author Turull Torres, José María
author_facet Turull Torres, José María
author_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
relational machines
topic Ciencias Informáticas
relational machines
dc.description.none.fl_txt_mv We prove that the existential fragment Σ²<sub>1</sub><sup>,ω</sup> of the third or- der logic TO<sup>ω</sup> captures the relational complexity class non deterministic exponential time. As a Corollary we have that relational machines can simulate third order relational machines.
XII Workshop Bases de Datos y Minería de Datos (WBDDM)
Red de Universidades con Carreras en Informática (RedUNCI)
description We prove that the existential fragment Σ²<sub>1</sub><sup>,ω</sup> of the third or- der logic TO<sup>ω</sup> captures the relational complexity class non deterministic exponential time. As a Corollary we have that relational machines can simulate third order relational machines.
publishDate 2015
dc.date.none.fl_str_mv 2015-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/50424
url http://sedici.unlp.edu.ar/handle/10915/50424
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/978-987-3806-05-6
info:eu-repo/semantics/reference/hdl/10915/50028
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615908139466752
score 13.069144

Publicaciones similares