Extended RDF: computability and complexity issues
From MaRDI portal
Publication:905991
DOI10.1007/s10472-015-9451-0zbMath1347.68316OpenAlexW1997904133WikidataQ58198046 ScholiaQ58198046MaRDI QIDQ905991
Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio
Publication date: 28 January 2016
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://eprints.hud.ac.uk/id/eprint/23551/1/AMAI-2015.pdf
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A framework for modular ERDF ontologies
- Stable models and circumscription
- Combining Horn rules and description logics in CARIN
- Answer set programming and plan generation
- 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
- Complexity results for answer set programming with bounded predicate arities and implications
- MWeb
- Efficiently Querying RDF(S) Ontologies with Answer Set Programming
- N3Logic: A logical framework for the World Wide Web
- Cheap Boolean Role Constructors for Description Logics
- Reconciling description logics and rules
- HiLog: A foundation for higher-order logic programming
- The well-founded semantics for general logic programs
- The DLV system for knowledge representation and reasoning
- Conflict-Driven Answer Set Enumeration
- The undecidability of the domino problem
This page was built for publication: Extended RDF: computability and complexity issues
