z-logo
open-access-imgOpen Access
On the Satisfiability Problem of Patterns in SPARQL 1.1
Author(s) -
Xiaowang Zhang,
Jan Van den Bussche,
Kewen Wang,
Zhe Wang
Publication year - 2018
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v32i1.11549
Subject(s) - sparql , decidability , satisfiability , boolean satisfiability problem , named graph , computer science , fragment (logic) , programming language , theoretical computer science , discrete mathematics , mathematics , information retrieval , semantic web , rdf

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom