Relationships Between Logic Programming and RDF

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 construc-tors. For meta-statements a modal-logic treatment is suggested. To re-duce large fact sets, an \inferential RDF", with special Horn rules, is introduced. A direct representation of non-binary relations is proposed. Rei cation is thus abandonned and RDF diagrams are generalized us-ing hypergraphs. RDF types are considered as sort predicates. RDF Schema's class/property hierarchies are regarded as a second-order sub-sumes/subsumes2 syntax or as simple Horn rules. Its domain/range con-straints are extended to (polymorphic) signatures. All concepts are ex-plained via knowledge-representation examples as usable by information agents.