No project description provided
Project description
Relation Graph, Python Port
This is a minimal implementation of relation-graph in Python
The goal is to reason over a minimal subset
- subClassOf
- someValuesFrom
- transitive properties
- property chains
To run:
run_relation_graph("tests/input/test.csv", "tests/output/results.csv")
- input must be csv
- headers must be subject, predicate, object
- domain entities can be any syntax, rdf/owl terms must be CURIEs
- rows are either:
- relation graph direct edges
- triples of the form
PRED,rdf:type,owl:TransitiveProperty
See tests/input for details
TODO
- reflexive edges
- relax equivalence to paired subClassOf
- compare with scala relation-graph
- property chains
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
relation_graph-0.1.1.tar.gz
(11.2 MB
view hashes)
Built Distributions
Close
Hashes for relation_graph-0.1.1-cp39-cp39-macosx_10_7_x86_64.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | e464ab5facc4b566dd851763e3790000b2f64b7766ccacbdaf0066d23c90e60b |
|
| MD5 | 49cb2cffb3bb158e26640763442b139f |
|
| BLAKE2b-256 | 668f21ae5e06736e5e25a32a9f83be48e827ffb6e42ba5fb4d61b4c51e82b2ca |
Close
Hashes for relation_graph-0.1.1-cp37-cp37m-manylinux_2_5_x86_64.manylinux1_x86_64.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | f9e99269ea064c0000910875c80baa7400c279c9142797660047cac7e12f6404 |
|
| MD5 | e5adb5da40cf7dab0214746562cdb9dc |
|
| BLAKE2b-256 | 887a67bccb2b73ab72abdd87527eb907cf39861aea9db8737f478615a9f22c69 |
