(digraph_conn_defsnil 3560614115"" (skosimp)"" (inst 1 "empty_digraph" )"" (split)"1" (expand "di_subgraph?" )"1" (expand "subset?" )"1" (expand "member" )"1" (split)"1" (skosimp)"1" (expand "empty_digraph" )"1" (expand "emptyset" ) (("1" (propax) nil nil ))nil ))nil ))nil )"2" (skosimp)"2" (expand "empty_digraph" )"2" (expand "emptyset" ) (("2" (propax) nil nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil )"2" (expand "connected_component?" )"2" (expand "connected?" )"2" (expand "reachable?" )"2" (expand "di_subgraph?" )"2" (expand "subset?" )"2" (expand "member" )"2" (split)"1" (skosimp)"1" (typepred "u!1" "v!1" )"1" (expand "empty_digraph" )"1" (expand "emptyset" )"1" (propax) nil nil )) nil ))nil ))nil ))nil )"2" (skosimp)"2" (expand "empty_digraph" )"2" (expand "emptyset" )"2" (propax) nil nil )) nil ))nil ))nil )"3" (skosimp)"3" (expand "empty_digraph" )"3" (expand "emptyset" )"3" (propax) nil nil )) nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil ))nil )nil digraph_conn_defs nil )nil digraphs nil )nil finite_sets nil )nil digraphs nil )nil booleans nil )nil booleans nil )"[bool, bool -> bool]" booleans nil )AND const-decl "[bool, bool -> bool]" booleans nil )nil digraphs nil )"digraph" digraphs nil )"bool" digraph_conn_defs nil )"bool" walks nil )NOT const-decl "[bool -> bool]" booleans nil )"bool" digraph_conn_defs nil )"bool" di_subgraphs nil )"bool" sets nil )"set" sets nil )"bool" sets nil ))nil )))quality 91%
¤ Dauer der Verarbeitung: 0.16 Sekunden
(vorverarbeitet)
¤ *© Formatika GbR, Deutschland
