Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/28418
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZHANG, Xiaowang-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.contributor.authorWang, Kewen-
dc.contributor.authorWang, Zhe-
dc.date.accessioned2019-06-17T12:03:46Z-
dc.date.available2019-06-17T12:03:46Z-
dc.date.issued2018-
dc.identifier.citationAAAI Publications, Thirty-Second AAAI Conference on Artificial Intelligence,p. 2054-2061-
dc.identifier.isbn9781577358008-
dc.identifier.urihttp://hdl.handle.net/1942/28418-
dc.description.abstractThe pattern satisfiability is a fundamental problem for SPARQL. This paper provides a complete analysis of decidability/undecidability of satisfiability problems for SPARQL 1.1 patterns. A surprising result is the undecidability of satisfiability for SPARQL 1.1 patterns when only AND and MINUS are expressible. Also, it is shown that any fragment of SPARQL 1.1 without expressing both AND and MINUS is decidable. These results provide a guideline for future SPARQL query language design and implementation.-
dc.description.sponsorshipThis work is supported by the National Key Research and Development Program of China (2016YFB1000603), the National Natural Science Foundation of China (61502336), and the Key Technology Research and Development Program of Tianjin (16YFZCGX00210).-
dc.language.isoen-
dc.publisherASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE-
dc.titleOn the Satisfiability Problem of Patterns in SPARQL 1.1-
dc.typeProceedings Paper-
local.bibliographicCitation.conferencedate2-7 February 2018-
local.bibliographicCitation.conferencenameThe Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18)-
local.bibliographicCitation.conferenceplaceNew Orleans, Louisiana, USA-
dc.identifier.epage2061-
dc.identifier.spage2054-
local.bibliographicCitation.jcatC1-
dc.description.notesZhang, XW (reprint author), Tianjin Univ, Sch Comp Sci & Technol, Tianjin, Peoples R China. Tianjin Key Lab Cognit Comp & Applicat, Tianjin, Peoples R China.-
local.publisher.place2275 E BAYSHORE RD, STE 160, PALO ALTO, CA 94303 USA-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
dc.source.typeMeeting-
dc.identifier.isiWOS:000485488902016-
dc.identifier.urlhttps://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16590-
local.provider.typeWeb of Science-
local.bibliographicCitation.btitleAAAI Publications, Thirty-Second AAAI Conference on Artificial Intelligence-
item.fulltextWith Fulltext-
item.contributorZHANG, Xiaowang-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorWang, Kewen-
item.contributorWang, Zhe-
item.fullcitationZHANG, Xiaowang; VAN DEN BUSSCHE, Jan; Wang, Kewen & Wang, Zhe (2018) On the Satisfiability Problem of Patterns in SPARQL 1.1. In: AAAI Publications, Thirty-Second AAAI Conference on Artificial Intelligence,p. 2054-2061.-
item.accessRightsRestricted Access-
item.validationecoom 2020-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
16590-76673-1-PB.pdf
  Restricted Access		Published version527.48 kBAdobe PDFView/Open    Request a copy
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.