Copyright | (c) Till Mossakowski Uni Magdeburg 2022 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | till.mossakowski@ovgu.de |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Definition of signatures for neural-symbolic patterns
Synopsis
- data Sign = Sign {
- owlClasses :: Set IRI
- owlTaxonomy :: Relation IRI IRI
- nodes :: Set ResolvedNode
- edges :: Relation ResolvedNode ResolvedNode
- idMap :: Map IRI IRI
- data ResolvedNode = ResolvedNode {}
- resolved2Node :: ResolvedNode -> Node
- findNodeId :: IRI -> Set ResolvedNode -> Set ResolvedNode
- nesyIdMap :: Set ResolvedNode -> Map IRI IRI
- pretty :: Pretty a => a -> Doc
- isLegalSignature :: Sign -> Bool
- addToSig :: Sign -> ResolvedNode -> Sign
- addEdgeToSig :: Sign -> (ResolvedNode, ResolvedNode) -> Sign
- addEdgeToSig' :: Sign -> (ResolvedNode, ResolvedNode) -> Sign
- unite :: Sign -> Sign -> Sign
- emptySig :: Sign
- isSubSigOf :: Sign -> Sign -> Bool
- sigDiff :: Sign -> Sign -> Sign
- sigUnion :: Sign -> Sign -> Result Sign
- nesyIds :: Sign -> Set IRI
Documentation
Datatype for propositional Signatures Signatures are graphs over nodes from the abstract syntax
Sign | |
|
Instances
data ResolvedNode Source #
Instances
Eq ResolvedNode Source # | |
Defined in NeSyPatterns.Sign (==) :: ResolvedNode -> ResolvedNode -> Bool (/=) :: ResolvedNode -> ResolvedNode -> Bool | |
Data ResolvedNode Source # | |
Defined in NeSyPatterns.Sign gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ResolvedNode -> c ResolvedNode gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ResolvedNode toConstr :: ResolvedNode -> Constr dataTypeOf :: ResolvedNode -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ResolvedNode) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ResolvedNode) gmapT :: (forall b. Data b => b -> b) -> ResolvedNode -> ResolvedNode gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ResolvedNode -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ResolvedNode -> r gmapQ :: (forall d. Data d => d -> u) -> ResolvedNode -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ResolvedNode -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ResolvedNode -> m ResolvedNode gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ResolvedNode -> m ResolvedNode gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ResolvedNode -> m ResolvedNode | |
Ord ResolvedNode Source # | |
Defined in NeSyPatterns.Sign compare :: ResolvedNode -> ResolvedNode -> Ordering (<) :: ResolvedNode -> ResolvedNode -> Bool (<=) :: ResolvedNode -> ResolvedNode -> Bool (>) :: ResolvedNode -> ResolvedNode -> Bool (>=) :: ResolvedNode -> ResolvedNode -> Bool max :: ResolvedNode -> ResolvedNode -> ResolvedNode min :: ResolvedNode -> ResolvedNode -> ResolvedNode | |
Show ResolvedNode Source # | |
Defined in NeSyPatterns.Sign showsPrec :: Int -> ResolvedNode -> ShowS show :: ResolvedNode -> String showList :: [ResolvedNode] -> ShowS | |
Generic ResolvedNode | |
Defined in NeSyPatterns.ATC_NeSyPatterns type Rep ResolvedNode :: Type -> Type from :: ResolvedNode -> Rep ResolvedNode x to :: Rep ResolvedNode x -> ResolvedNode | |
GetRange ResolvedNode Source # | |
Defined in NeSyPatterns.Sign getRange :: ResolvedNode -> Range Source # rangeSpan :: ResolvedNode -> [Pos] Source # | |
FromJSON ResolvedNode | |
Defined in NeSyPatterns.ATC_NeSyPatterns parseJSON :: Value -> Parser ResolvedNode parseJSONList :: Value -> Parser [ResolvedNode] | |
ToJSON ResolvedNode | |
Defined in NeSyPatterns.ATC_NeSyPatterns toJSON :: ResolvedNode -> Value toEncoding :: ResolvedNode -> Encoding toJSONList :: [ResolvedNode] -> Value toEncodingList :: [ResolvedNode] -> Encoding | |
ShATermConvertible ResolvedNode | |
Defined in NeSyPatterns.ATC_NeSyPatterns toShATermAux :: ATermTable -> ResolvedNode -> IO (ATermTable, Int) toShATermList' :: ATermTable -> [ResolvedNode] -> IO (ATermTable, Int) fromShATermAux :: Int -> ATermTable -> (ATermTable, ResolvedNode) fromShATermList' :: Int -> ATermTable -> (ATermTable, [ResolvedNode]) | |
SymbolName ResolvedNode Source # | |
Defined in NeSyPatterns.Sign addString :: (ResolvedNode, String) -> ResolvedNode Source # | |
Pretty ResolvedNode Source # | |
Defined in NeSyPatterns.Sign pretty :: ResolvedNode -> Doc Source # pretties :: [ResolvedNode] -> Doc Source # | |
type Rep ResolvedNode | |
Defined in NeSyPatterns.ATC_NeSyPatterns type Rep ResolvedNode = D1 ('MetaData "ResolvedNode" "NeSyPatterns.Sign" "main" 'False) (C1 ('MetaCons "ResolvedNode" 'PrefixI 'True) (S1 ('MetaSel ('Just "resolvedOTerm") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IRI) :*: (S1 ('MetaSel ('Just "resolvedNeSyId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IRI) :*: S1 ('MetaSel ('Just "resolvedNodeRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range)))) |
resolved2Node :: ResolvedNode -> Node Source #
findNodeId :: IRI -> Set ResolvedNode -> Set ResolvedNode Source #
isLegalSignature :: Sign -> Bool Source #
determines whether a signature is vaild
addEdgeToSig :: Sign -> (ResolvedNode, ResolvedNode) -> Sign Source #
Adds an edge to the signature. Nodes are not added. See addEdgeToSig'
addEdgeToSig' :: Sign -> (ResolvedNode, ResolvedNode) -> Sign Source #
Adds an edge with its nodes to the signature
isSubSigOf :: Sign -> Sign -> Bool Source #
Determines if sig1 is subsignature of sig2