Extended RDF: computability and complexity issues

DOI10.1007/S10472-015-9451-0MaRDI QIDQ905991zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

rulescomplexitynegationsemantic webextended RDF ontologies

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 67490 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 2088362 (Why is no real title available?)
• A framework for modular ERDF ontologies
• Answer set programming and plan generation
• Cheap Boolean Role Constructors for Description Logics
• Combining Horn rules and description logics in CARIN
• Combining answer set programming with description logics for the semantic web
• Complexity results for answer set programming with bounded predicate arities and implications
• Conflict-Driven Answer Set Enumeration
• Conflict-driven answer set solving: from theory to practice
• Efficiently Querying RDF(S) Ontologies with Answer Set Programming
• Extended RDF as a semantic foundation of rule markup languages
• First-order stable model semantics and first-order loop formulas
• HiLog: A foundation for higher-order logic programming
• Logic programs with stable model semantics as a constraint programming paradigm
• MWeb: a principled framework for modular web rule bases and its semantics
• N3Logic: A logical framework for the World Wide Web
• Partial logics with two kinds of negation as a foundation for knowledge-based reasoning
• Reconciling description logics and rules
• Stable models and circumscription
• The DLV system for knowledge representation and reasoning
• The undecidability of the domino problem
• The well-founded semantics for general logic programs

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
• scientific article; zbMATH DE number 2088358 (Why is no real title available?)

Describes a project that uses

Uses Software

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

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)