On the relation between SPARQL1.1 and Answer Set Programming
From MaRDI portal
Publication:4583314
DOI10.1080/11663081.2013.798992zbMath1400.68065DBLPjournals/jancl/PolleresW13OpenAlexW1990661066WikidataQ58049427 ScholiaQ58049427MaRDI QIDQ4583314
Johannes Peter Wallner, Axel Polleres
Publication date: 28 August 2018
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/11663081.2013.798992
Related Items (2)
Complexity and expressive power of weakly well-designed SPARQL ⋮ Datalog: Bag Semantics via Set Semantics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combining Horn rules and description logics in CARIN
- Conflict-driven answer set solving: from theory to practice
- Logic programs with stable model semantics as a constraint programming paradigm
- Combining answer set programming with description logics for the semantic web
- SPARQL Query Containment under RDFS Entailment Regime
- Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
- The read–write Linked Data Web
- Query Answering in Description Logics: The Knots Approach
- Answer Set Programming: A Primer
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logics in Artificial Intelligence
- Logic Programming and Nonmonotonic Reasoning
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
This page was built for publication: On the relation between SPARQL1.1 and Answer Set Programming