- library
- semweb
- rdf_db.pl -- Core RDF database
- rdf_cache.pl -- Cache RDF triples
- rdfs.pl -- RDFS handling
- rdf_persistency.pl -- RDF persistency plugin
- rdf_litindex.pl -- Search literals
- rdf_ntriples.pl -- Process files in the RDF N-Triples format
- rdf11.pl -- RDF 1.1 API
- rdf/3
- rdf/4
- rdf_has/3
- rdf_has/4
- rdf_update/4
- rdf_update/5
- rdf_reachable/3
- rdf_reachable/5
- rdf_assert/3
- rdf_assert/4
- rdf_retractall/3
- rdf_retractall/4
- rdf_compare/3
- {}/1
- rdf_where/1
- rdf_default_graph/1
- rdf_default_graph/2
- rdf_canonical_literal/2
- rdf_lexical_form/2
- rdf_term/1
- rdf_literal/1
- rdf_bnode/1
- rdf_iri/1
- rdf_name/1
- rdf_subject/1
- rdf_predicate/1
- rdf_object/1
- rdf_node/1
- rdf_create_bnode/1
- rdf_is_iri/1
- rdf_is_bnode/1
- rdf_is_literal/1
- rdf_is_name/1
- rdf_is_object/1
- rdf_is_predicate/1
- rdf_is_subject/1
- rdf_is_term/1
- rdf_list/1
- rdf_list/2
- rdf_length/2
- rdf_member/2
- rdf_nextto/2
- rdf_nextto/3
- rdf_nth0/3
- rdf_nth1/3
- rdf_last/2
- rdf_estimate_complexity/4
- rdf_assert_list/2
- rdf_assert_list/3
- rdf_retract_list/1
- sparql_client.pl -- SPARQL client library
- turtle.pl -- Turtle: Terse RDF Triple Language
- rdf_turtle_write.pl -- Turtle - Terse RDF Triple Language writer
- rdf_http_plugin.pl -- RDF HTTP Plugin
- rdf_library.pl -- RDF Library Manager
- rdf_zlib_plugin.pl -- RDF compressed-data plugin
- semweb
- rdf_reachable(?S, +P, ?O) is nondet
- rdf_reachable(?S, +P, ?O, +MaxD, -D) is nondet
- True when O can be reached from S using the transitive closure
of P. The predicate uses (the internals of) rdf_has/3 and thus
matches both rdfs:subPropertyOf and the
inverse_ofandsymmetricpredicate properties. The version rdf_reachable/5 maximizes the steps considered and returns the number of steps taken.If both S and O are given, these predicates are
semidet. The number of steps D is minimal because the implementation uses breath first search.