Why-provenance information for RDF, rules, and negation
From MaRDI portal
Publication:2248547
Recommendations
Cites work
- A framework for modular ERDF ontologies
- Algebraic Structures for Capturing the Provenance of SPARQL Queries
- Complexity results for answer set programming with bounded predicate arities and implications
- Conflict-Driven Answer Set Enumeration
- Extended RDF as a semantic foundation of rule markup languages
- Extended RDF: computability and complexity issues
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 2080480 (Why is no real title available?)
- scientific article; zbMATH DE number 2088362 (Why is no real title available?)
- Justifications for logic programming
- Logic programs with abstract constraint atoms: the role of computations
- Logical foundations of object-oriented and frame-based languages
- Making prolog more expressive
- On database query languages for K-relations
- On negation in Hilog
- Partial logics with two kinds of negation as a foundation for knowledge-based reasoning
- Reconcilable differences
- Tabled evaluation with delaying for general logic programs
- The DLV system for knowledge representation and reasoning
- The well-founded semantics for general logic programs
- XSB: extending Prolog with tabled logic programming
Cited in
(4)
This page was built for publication: Why-provenance information for RDF, rules, and negation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248547)