Relationships between Logic Programming and RDF

Authors:
Harold Boley
Affiliations:
-
Venue:
Revised Papers from the PRICAI 2000 Workshop Reader, Four Workshops held at PRICAI 2000 on Advances in Artificial Intelligence
Year:
2000

Citing 0
Cited 7

Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
An RDF Query Language based on Logic Programming

Electronic Notes in Theoretical Computer Science (ENTCS)
Querying xml documents in logic programming*

Theory and Practice of Logic Programming
Integrating XQuery and Logic Programming

Applications of Declarative Programming and Knowledge Management
Derived types in semantic association discovery

Journal of Intelligent Information Systems
The RuleML family of web rule languages

PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Grailog 1.0: graph-logic visualization of ontologies and rules

RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mutual relationships between logic programming and RDF are examined. Basic RDF is formalized with ground binary Datalog Horn facts. Containers are modeled using ('active') polyadic constructors. For meta-statements a modal-logic treatment is suggested. To reduce large fact sets, an "inferential RDF", with special Horn rules, is introduced. A direct representation of non-binaryrelations is proposed. Reification is thus abandonned and RDF diagrams are generalized using hypergraphs. RDF types are considered as sort predicates. RDF Schema's class/propertyhierarc hies are regarded as a second-order subsumes/ subsumes syntax or as simple Horn rules. Its domain/range constraints are extended to (polymorphic) signatures. All concepts are explained via knowledge-representation examples as usable by information agents.