Copyright | (c) Till Mossakowski Uni Magdeburg 2022 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | till.mossakowski@ovgu.de |
Stability | experimental |
Portability | portable Definition of morphisms for neural-symbolic patterns |
Safe Haskell | Safe |
Synopsis
- data Morphism = Morphism {
- source :: Sign
- target :: Sign
- owlMap :: Map IRI IRI
- nodeMap :: Map ResolvedNode ResolvedNode
- pretty :: Pretty a => a -> Doc
- idMor :: Sign -> Morphism
- isLegalMorphism :: Morphism -> Result ()
- composeMor :: Morphism -> Morphism -> Result Morphism
- inclusionMap :: Sign -> Sign -> Morphism
- applyMap :: Map ResolvedNode ResolvedNode -> ResolvedNode -> ResolvedNode
- applyMorphism :: Morphism -> ResolvedNode -> ResolvedNode
- morphismUnion :: Morphism -> Morphism -> Result Morphism
- morphism2TokenMap :: Morphism -> Map IRI IRI
- tokenMap2NodeMap :: Set ResolvedNode -> Set ResolvedNode -> Map IRI IRI -> Result (Map ResolvedNode ResolvedNode)
Documentation
Morphisms are graph homomorphisms, here: node maps
Morphism | |
|
Instances
isLegalMorphism :: Morphism -> Result () Source #
Determines whether a morphism is valid
composeMor :: Morphism -> Morphism -> Result Morphism Source #
Composition of morphisms in propositional Logic
applyMap :: Map ResolvedNode ResolvedNode -> ResolvedNode -> ResolvedNode Source #
Application function for nodeMaps
applyMorphism :: Morphism -> ResolvedNode -> ResolvedNode Source #
Application funtion for morphisms
tokenMap2NodeMap :: Set ResolvedNode -> Set ResolvedNode -> Map IRI IRI -> Result (Map ResolvedNode ResolvedNode) Source #