Extended RDF: computability and complexity issues

DOI10.1007/S10472-015-9451-0zbMATH Open1347.68316DBLPjournals/amai/AnalytiDA15OpenAlexW1997904133WikidataQ58198046 ScholiaQ58198046MaRDI QIDQ905991FDOQ905991

Authors: Anastasia Analyti, Carlos Viegas Damásio, Grigoris Antoniou 

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

Recommendations

• Logical Foundations of RDF(S) with Datatypes
• A framework for modular ERDF ontologies
• Foundations of RDF Databases
• Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
• scientific article; zbMATH DE number 2088358

zbMATH Keywords

rulescomplexitynegationsemantic webextended RDF ontologies

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Cites Work

• N3Logic: A logical framework for the World Wide Web
• Title not available (Why is that?)
• Combining answer set programming with description logics for the semantic web
• Title not available (Why is that?)
• Title not available (Why is that?)
• The well-founded semantics for general logic programs
• The DLV system for knowledge representation and reasoning
• 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
• Reconciling description logics and rules
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stable models and circumscription
• Title not available (Why is that?)
• The undecidability of the domino problem
• Partial logics with two kinds of negation as a foundation for knowledge-based reasoning
• MWeb
• A framework for modular ERDF ontologies
• Extended RDF as a semantic foundation of rule markup languages
• Conflict-Driven Answer Set Enumeration
• Combining Horn rules and description logics in CARIN
• First-order stable model semantics and first-order loop formulas
• HiLog: A foundation for higher-order logic programming
• Complexity results for answer set programming with bounded predicate arities and implications
• Efficiently Querying RDF(S) Ontologies with Answer Set Programming
• Cheap Boolean Role Constructors for Description Logics

Cited In (5)

• Why-provenance information for RDF, rules, and negation
• Complexity and Expressiveness of ShEx for RDF
• Defeasible RDFS via rational closure
• A framework for modular ERDF ontologies
• Title not available (Why is that?)

Uses Software

• HiLog
• N3Logic
• TRIPLE
• Smodels
• SPARQL
• swrl
• MWeb

This page was built for publication: Extended RDF: computability and complexity issues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905991)