On the Satisfiability Problem of Patterns in SPARQL 1.1
Authors: Xiaowang Zhang, Jan Van den Bussche, Kewen Wang, Zhe Wang
AAAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | This paper provides a complete analysis of decidability/undecidability of satisfiability problems for SPARQL 1.1 patterns. |
| Researcher Affiliation | Academia | Xiaowang Zhang,1,5 Jan Van den Bussche,3 Kewen Wang,2,4 Zhe Wang4 1School of Computer Science and Technology, Tianjin University, Tianjin, China 2School of Computer Software, Tianjin University, Tianjin, China 3Faculty of Sciences, Hasselt University, Hasselt, Belgium 4School of Information and Communication Technology, Griffith University, Brisbane, Australia 5Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin, China |
| Pseudocode | No | The paper does not contain any structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any concrete access information for open-source code related to the described methodology. |
| Open Datasets | No | This is a theoretical paper focusing on decidability, not on empirical studies using datasets. Therefore, no information regarding dataset availability is provided. |
| Dataset Splits | No | This is a theoretical paper and does not involve empirical experiments with data splits for training, validation, or testing. |
| Hardware Specification | No | This is a theoretical paper and does not describe experiments that would require hardware specifications. |
| Software Dependencies | No | This is a theoretical paper and does not describe experiments requiring specific software dependencies with version numbers. |
| Experiment Setup | No | This is a theoretical paper and does not describe experiments that would require an experimental setup with hyperparameter details. |