Relationship between logic programming and RDF
LNAI 2112, (2001)Abstract
Mutual relationships between logic programming and RDF are examined. Basic RDF is formalized with ground binaryDatalog 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/ subsumes2 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 byinformation agents.