{-# LANGUAGE MultiParamTypeClasses, TypeSynonymInstances #-}

{- |

Module : $Header$

Description : Comorphism from OWL2 to Common Logic

Copyright : (c) Francisc-Nicolae Bungiu, Felix Gabriel Mance

License : GPLv2 or higher, see LICENSE.txt

Maintainer : f.bungiu@jacobs-university.de

Stability : provisional

Portability : non-portable (via Logic.Logic)

a comorphism from OWL2 to CommonLogic

-}

module OWL2.OWL22CommonLogic (OWL22CommonLogic (..)) where

import Logic.Logic as Logic

import Logic.Comorphism

import qualified Common.AS_Annotation as CommonAnno

import Common.Result

import Control.Monad

import Data.Char

import Data.Maybe

import qualified Data.Set as Set

import qualified Data.Map as Map

-- OWL2 = domain

import OWL2.Logic_OWL2

import OWL2.AS

import OWL2.MS

--import OWL2.Parse

--import OWL2.ManchesterParser

--import Text.ParserCombinators.Parsec

import OWL2.ProfilesAndSublogics

import OWL2.Morphism

import OWL2.Symbols

import qualified OWL2.Sign as OS

-- CommonLogic = codomain

import Common.DocUtils

import CommonLogic.Logic_CommonLogic

import Common.Id as Id

import CommonLogic.AS_CommonLogic

import CommonLogic.Sign

import CommonLogic.Symbol

import qualified CommonLogic.Morphism as CLM

import qualified CommonLogic.Sublogic as ClSl

import Common.ProofTree

data OWL22CommonLogic = OWL22CommonLogic deriving Show

instance Language OWL22CommonLogic

instance Comorphism

OWL22CommonLogic -- comorphism

OWL2 -- lid domain

ProfSub -- sublogics domain

OntologyDocument -- Basic spec domain

Axiom -- sentence domain

SymbItems -- symbol items domain

SymbMapItems -- symbol map items domain

OS.Sign -- signature domain

OWLMorphism -- morphism domain

Entity -- symbol domain

RawSymb -- rawsymbol domain

ProofTree -- proof tree codomain

CommonLogic -- lid codomain

ClSl.CommonLogicSL -- sublogics codomain

BASIC_SPEC -- Basic spec codomain

TEXT -- sentence codomain

NAME -- symbol items codomain

SYMB_MAP_ITEMS -- symbol map items codomain

Sign -- signature codomain

CLM.Morphism -- morphism codomain

Symbol -- symbol codomain

Symbol -- rawsymbol codomain

ProofTree -- proof tree domain

where

sourceLogic OWL22CommonLogic = OWL2

sourceSublogic OWL22CommonLogic = topS

targetLogic OWL22CommonLogic = CommonLogic

mapSublogic OWL22CommonLogic _ = Just ClSl.top

map_theory OWL22CommonLogic = mapTheory

map_morphism OWL22CommonLogic = mapMorphism

map_symbol OWL22CommonLogic _ = mapSymbol

isInclusionComorphism OWL22CommonLogic = True

has_model_expansion OWL22CommonLogic = True

smap :: Monad m =>

(t4 -> t -> t1 -> t2 -> m t3) -> t4 -> t -> t1 -> t2 -> m (t3, t4)

smap f s a b c = do

x <- f s a b c

return (x, s)

failMsg :: Pretty a => a -> Result b

failMsg a = fail $ "cannot translate " ++ showDoc a "\n"

hetsPrefix :: String

hetsPrefix = ""

voiToTok :: VarOrIndi -> Token

voiToTok v = case v of

OVar o -> mkNName o

OIndi o -> uriToTok o

uriToTokM :: IRI -> Result Token

uriToTokM = return . uriToTok

-- | Extracts Token from IRI

uriToTok :: IRI -> Token

uriToTok urI = mkSimpleId $ showQN urI

-- | Extracts Id from IRI

uriToId :: IRI -> Id

uriToId = simpleIdToId . uriToTok

mkQuants :: QUANT_SENT -> SENTENCE

mkQuants qs = Quant_sent qs nullRange

mkBools :: BOOL_SENT -> SENTENCE

mkBools bs = Bool_sent bs nullRange

mkAtoms :: ATOM -> SENTENCE

mkAtoms as = Atom_sent as nullRange

mkUnivQ :: [NAME_OR_SEQMARK] -> SENTENCE -> QUANT_SENT

mkUnivQ = Universal

mkExist :: [NAME_OR_SEQMARK] -> SENTENCE -> QUANT_SENT

mkExist = Existential

cnjct :: [SENTENCE] -> BOOL_SENT

cnjct = Conjunction

dsjct :: [SENTENCE] -> BOOL_SENT

dsjct = Disjunction

mkNeg :: SENTENCE -> BOOL_SENT

mkNeg = Negation

mkImpl :: SENTENCE -> SENTENCE -> BOOL_SENT

mkImpl = Implication

mkBicnd :: SENTENCE -> SENTENCE -> BOOL_SENT

mkBicnd = Biconditional

mkNAME :: Int -> NAME_OR_SEQMARK

mkNAME n = Name (mkNName n)

mkNTERM :: Int -> TERM

mkNTERM n = Name_term (mkNName n)

mkVTerm :: VarOrIndi -> TERM

mkVTerm = Name_term . voiToTok

mkTermSeq :: NAME -> TERM_SEQ

mkTermSeq = Term_seq . Name_term

senToText :: SENTENCE -> TEXT

senToText s = Text [Sentence s] nullRange

msen2Txt :: [SENTENCE] -> [TEXT]

msen2Txt = map senToText

mk1NTERM :: TERM

mk1NTERM = mkNTERM 1

mk1NAME :: NAME_OR_SEQMARK

mk1NAME = mkNAME 1

mk1QU :: SENTENCE -> SENTENCE

mk1QU = mkQuants . mkUnivQ [mk1NAME]

mkQU :: [NAME_OR_SEQMARK] -> SENTENCE -> SENTENCE

mkQU l = mkQuants . mkUnivQ l

mkBI :: SENTENCE -> SENTENCE -> SENTENCE

mkBI s = mkBools . mkImpl s

mkBN :: SENTENCE -> SENTENCE

mkBN = mkBools . mkNeg

mkBD :: [SENTENCE] -> SENTENCE

mkBD sl = case sl of

[s] -> s

_ -> mkBools $ dsjct sl

mkBC :: [SENTENCE] -> SENTENCE

mkBC sl = case sl of

[s] -> s

_ -> mkBools $ cnjct sl

mkBB :: SENTENCE -> SENTENCE -> SENTENCE

mkBB s = mkBools . mkBicnd s

mkQE :: [NAME_OR_SEQMARK] -> SENTENCE -> SENTENCE

mkQE l = mkQuants . mkExist l

mkAE :: TERM -> TERM -> SENTENCE

mkAE t = mkAtoms . Equation t

mkSent :: [NAME_OR_SEQMARK] -> [NAME_OR_SEQMARK] -> SENTENCE -> SENTENCE

-> SENTENCE

mkSent l1 l2 s = mkQU l1 . mkQE l2 . mkBI s

mkQUBI :: [NAME_OR_SEQMARK] -> [SENTENCE] -> TERM -> TERM -> TEXT

mkQUBI l1 l2 a b = senToText $ mkQU l1 $ mkBI (mkBC l2) $ mkAE a b

mkTermAtoms :: NAME -> [TERM] -> SENTENCE

mkTermAtoms ur tl = mkAtoms $ Atom (Name_term ur) $ map Term_seq tl

sHead :: [SENTENCE] -> SENTENCE

sHead s = case s of

[a] -> a

_ -> mkBC s

eqFB :: [Int] -> [SENTENCE] -> TEXT

eqFB nl l = senToText $ mkQU (map mkNAME nl) $ sHead l

mkNNameH :: Int -> String

mkNNameH k = case k of

0 -> ""

j -> mkNNameH (j `div` 26) ++ [chr $ j `mod` 26 + 96]

-- | Build a name

mkNName :: Int -> Token

mkNName i = mkSimpleId $ hetsPrefix ++ mkNNameH i

-- | Get all distinct pairs for commutative operations

comPairs :: [t] -> [t1] -> [(t, t1)]

comPairs [] [] = []

comPairs _ [] = []

comPairs [] _ = []

comPairs (a : as) (_ : bs) = mkPairs a bs ++ comPairs as bs

mkPairs :: t -> [t1] -> [(t, t1)]

mkPairs a = map (\ b -> (a, b))

data VarOrIndi = OVar Int | OIndi IRI

-- | Mapping of OWL morphisms to CommonLogic morphisms

mapMorphism :: OWLMorphism -> Result CLM.Morphism

mapMorphism oMor = do

dm <- mapSign $ osource oMor

cd <- mapSign $ otarget oMor

mapp <- mapMap $ mmaps oMor

return (CLM.mkMorphism dm cd mapp)

mapMap :: Map.Map Entity IRI -> Result (Map.Map Id Id)

mapMap m = return $ Map.map uriToId $ Map.mapKeys entityToId m

mapSymbol :: Entity -> Set.Set Symbol

mapSymbol (Entity _ iri) = Set.singleton $ idToRaw $ uriToId iri

mapSign :: OS.Sign -> Result Sign

mapSign sig =

let conc = Set.unions [ OS.concepts sig

, OS.datatypes sig

, OS.objectProperties sig

, OS.dataProperties sig

, OS.annotationRoles sig

, OS.individuals sig ]

itms = Set.map uriToId conc

in return emptySig { items = itms }

mapTheory :: (OS.Sign, [CommonAnno.Named Axiom])

-> Result (Sign, [CommonAnno.Named TEXT])

mapTheory (owlSig, owlSens) = do

cSig <- mapSign owlSig

(cSensI, nSig) <- foldM (\ (x, y) z ->

do

(sen, sig) <- mapSentence y z

return (sen ++ x, unite sig y)

) ([], cSig) owlSens

return (nSig, cSensI)

-- | mapping of OWL to CommonLogic_DL formulae

mapSentence :: Sign -- ^ CommonLogic Signature

-> CommonAnno.Named Axiom -- ^ OWL2 Sentence

-> Result ([CommonAnno.Named TEXT], Sign) -- ^ CommonLogic TEXT

mapSentence cSig inSen = do

(outAx, outSig) <- mapAxioms cSig $ CommonAnno.sentence inSen

return (map (flip CommonAnno.mapNamed inSen . const) outAx, outSig)

getIRIWith :: EntityType -> Extended -> Maybe IRI

getIRIWith ty ane = case ane of

SimpleEntity (Entity ty2 iri) | ty == ty2 -> Just iri

ClassEntity (Expression iri) -> Just iri

ObjectEntity (ObjectProp iri) -> Just iri

_ -> Nothing

-- | Extracts Id from Entities

entityToId :: Entity -> Id

entityToId (Entity _ iri) = uriToId iri

-- | Mapping of Class IRIs

mapClassIRI :: Sign -> Class -> Token -> Result SENTENCE

mapClassIRI _ c tok = fmap (`mkTermAtoms` [Name_term tok]) $ uriToTokM c

-- | Mapping of Individual IRIs

mapIndivIRI :: Sign -> Individual -> Result TERM

mapIndivIRI _ i = fmap Name_term $ uriToTokM i

-- | mapping of individual list

mapComIndivList :: Sign -> SameOrDifferent -> Maybe Individual -> [Individual]

-> Result [SENTENCE]

mapComIndivList cSig sod mi inds = do

fs <- mapM (mapIndivIRI cSig) inds

il <- case mi of

Nothing -> return $ comPairs fs fs

Just i -> fmap (`mkPairs` fs) $ mapIndivIRI cSig i

let sntLst = map (\ (x, y) -> case sod of

Same -> mkAE x y

Different -> mkBN $ mkAE x y) il

return [mkBC sntLst]

-- | mapping of literals

mapLiteral :: Sign -> Literal -> Result TERM

mapLiteral _ c = do

let cl = case c of

Literal l _ -> l

NumberLit l -> show l

return $ Name_term $ mkSimpleId cl

-- | Mapping of a list of data constants only for mapDataRange

mapLiteralList :: Sign -> [Literal] -> Result [TERM]

mapLiteralList = mapM . mapLiteral

-- | Mapping of data properties

mapDataProp :: Sign -> DataPropertyExpression -> VarOrIndi -> VarOrIndi

-> Result SENTENCE

mapDataProp _ dp a b = fmap (`mkTermAtoms` map mkVTerm [a, b])

$ uriToTokM dp

mapDataPropI :: Sign -> VarOrIndi -> VarOrIndi -> DataPropertyExpression

-> Result SENTENCE

mapDataPropI cSig a b dp = mapDataProp cSig dp a b

-- | Mapping of obj props

mapObjProp :: Sign -> ObjectPropertyExpression -> VarOrIndi -> VarOrIndi

-> Result SENTENCE

mapObjProp cSig ob v1 v2 = case ob of

ObjectProp u -> fmap (`mkTermAtoms` map mkVTerm [v1, v2]) $ uriToTokM u

ObjectInverseOf u -> mapObjProp cSig u v2 v1

mapSubObjPropChain :: Sign -> [ObjectPropertyExpression]

-> ObjectPropertyExpression -> Int -> Result SENTENCE

mapSubObjPropChain cSig opl op a = let b = a + 1 in do

let vars = [a + 2 .. a + length opl]

vl = a : vars ++ [a + 1]

npl <- sequence $ zipWith3 (mapOPE cSig) opl vl $ tail vl

np <- mapOPE cSig op a b

let lst = map mkNAME $ a : b : vars

return $ mkQU lst $ mkBI (mkBC npl) np

-- | Mapping of subobj properties

mapSubObjProp :: Sign -> ObjectPropertyExpression -> ObjectPropertyExpression

-> Int -> Result SENTENCE

mapSubObjProp cSig sp p a = let b = a + 1 in do

l <- mapOPE cSig sp a b

r <- mapOPE cSig p a b

return $ mkQU (map mkNAME [a, b]) $ mkBI l r

mapDPE :: Sign -> DataPropertyExpression -> Int -> Int -> Result SENTENCE

mapDPE cSig dpe x y = mapDataProp cSig dpe (OVar x) $ OVar y

mapOPE :: Sign -> ObjectPropertyExpression -> Int -> Int -> Result SENTENCE

mapOPE cSig ope x y = mapObjProp cSig ope (OVar x) $ OVar y

mapOPEList :: Sign -> Int -> Int -> [ObjectPropertyExpression]

-> Result [SENTENCE]

mapOPEList s a b opl = mapM ((\ sig x1 x2 op -> mapOPE sig op x1 x2 ) s a b) opl

mapDPEList :: Sign -> Int -> Int -> [DataPropertyExpression]

-> Result [SENTENCE]

mapDPEList s a b dpl = mapM ((\ sig x1 x2 dp -> mapDPE sig dp x1 x2 ) s a b) dpl

mapObjPropListP :: Sign -> Int -> Int

-> [(ObjectPropertyExpression, ObjectPropertyExpression)]

-> Result [(SENTENCE, SENTENCE)]

mapObjPropListP = mapObjOrDataListP mapOPEList

mapDataPropListP :: Sign -> Int -> Int

-> [(DataPropertyExpression, DataPropertyExpression)]

-> Result [(SENTENCE, SENTENCE)]

mapDataPropListP = mapObjOrDataListP mapDPEList

mapObjOrDataListP :: Monad m => (t -> t1 -> t2 -> [a] -> m [b]) -> t -> t1 -> t2

-> [(a, a)] -> m [(b, b)]

mapObjOrDataListP f cSig a b ls = do

let (l, r) = unzip ls

l1 <- f cSig a b l

l2 <- f cSig a b r

return $ zip l1 l2

-- | mapping of Data Range

mapDataRange :: Sign -> DataRange -> VarOrIndi -> Result (SENTENCE, Sign)

mapDataRange cSig dr var = let uid = mkVTerm var in case dr of

DataJunction jt drl -> do

(jl, sig) <- mapAndUnzipM ((\ s v r -> mapDataRange s r v) cSig var) drl

let un = uniteL sig

return $ case jt of

IntersectionOf -> (mkBC jl, un)

UnionOf -> (mkBD jl, un)

DataComplementOf cdr -> do

(dc, sig) <- mapDataRange cSig cdr var

return (mkBN dc, sig)

DataOneOf cs -> do

cl <- mapLiteralList cSig cs

dl <- mapM (\ x -> return $ mkAtoms $ Atom x [Term_seq uid]) cl

return (mkBD dl, cSig)

DataType dt rlst -> do

let sent = mkTermAtoms (uriToTok dt) [uid]

(sens, sigL) <- mapAndUnzipM (mapFacet cSig uid) rlst

return (mkBC $ sent : sens, uniteL $ cSig : sigL)

-- | mapping of a tuple of ConstrainingFacet and RestictionValue

mapFacet :: Sign -> TERM -> (ConstrainingFacet, RestrictionValue)

-> Result (SENTENCE, Sign)

mapFacet sig var (f, r) = do

con <- mapLiteral sig r

return (mkTermAtoms (uriToTok f) [con, var], unite sig $ emptySig

{items = Set.fromList [stringToId $ showQN f]})

cardProps :: Bool -> Sign

-> Either ObjectPropertyExpression DataPropertyExpression -> Int

-> [VarOrIndi] -> Result [SENTENCE]

cardProps b cSig prop var vLst =

if b then let Left ope = prop in mapM (mapObjProp cSig ope $ OVar var) vLst

else let Right dpe = prop in mapM (mapDataProp cSig dpe $ OVar var) vLst

mapCard :: Bool -> Sign -> CardinalityType -> Int

-> Either ObjectPropertyExpression DataPropertyExpression

-> Maybe (Either ClassExpression DataRange) -> Int

-> Result (SENTENCE, Sign)

mapCard b cSig ct n prop d var = do

let vlst = map (var +) [1 .. n]

vLst = map OVar vlst

vlstM = vlst ++ [n + var + 1]

vLstM = map OVar vlstM

(dOut, sigL) <- case d of

Nothing -> return ([], [])

Just y ->

if b then let Left ce = y in mapAndUnzipM

(uncurry $ mapDescription cSig ce) $ zip vLst vlst

else let Right dr = y in mapAndUnzipM (mapDataRange cSig dr) vLst

let dlst = map (\ (x, y) -> mkBN $ mkAE (mkNTERM x) $ mkNTERM y)

$ comPairs vlst vlst

dlstM = map (\ (x, y) -> mkAE (mkNTERM x) $ mkNTERM y)

$ comPairs vlstM vlstM

qVars = map mkNAME vlst

qVarsM = map mkNAME vlstM

oProps <- cardProps b cSig prop var vLst

oPropsM <- cardProps b cSig prop var vLstM

let minLst = mkQE qVars $ mkBC $ dlst ++ dOut ++ oProps

maxLst = mkQE qVarsM $ mkBI (mkBC $ oPropsM ++ dOut) $ mkBD dlstM

return $ case ct of

MinCardinality -> (minLst, cSig)

MaxCardinality -> (maxLst, cSig)

ExactCardinality -> (mkBC [minLst, maxLst], uniteL sigL)

-- | Mapping of a list of descriptions

mapDescriptionList :: Sign -> Int -> [ClassExpression]

-> Result ([SENTENCE], Sign)

mapDescriptionList cSig n lst = do

(sens, lSig) <- mapAndUnzipM ((\ w x y z ->

mapDescription w z x y) cSig (OVar n) n) lst

sig <- sigUnionL lSig

return (sens, sig)

-- | Mapping of a list of pairs of descriptions

mapDescriptionListP :: Sign -> Int -> [(ClassExpression, ClassExpression)]

-> Result ([(SENTENCE, SENTENCE)], Sign)

mapDescriptionListP cSig n lst = do

let (l, r) = unzip lst

(llst, ssSig) <- mapDescriptionList cSig n l

(rlst, tSig) <- mapDescriptionList cSig n r

return (zip llst rlst, unite ssSig tSig)

-- | mapping of OWL Descriptions

mapDescription :: Sign -> ClassExpression -> VarOrIndi -> Int

-> Result (SENTENCE, Sign)

mapDescription cSig des oVar aVar =

let varN = case oVar of

OVar v -> mkNName v

OIndi i -> uriToTok i

var = case oVar of

OVar v -> v

OIndi _ -> aVar

in case des of

Expression cl -> do

ne <- mapClassIRI cSig cl varN

return (ne, cSig)

ObjectJunction jt desL -> do

(cel, dSig) <- mapAndUnzipM ((\ w x y z -> mapDescription w z x y)

cSig oVar aVar) desL

let un = uniteL dSig

return $ case jt of

UnionOf -> (mkBD cel, un)

IntersectionOf -> (mkBC cel, un)

ObjectComplementOf descr -> do

(ce, dSig) <- mapDescription cSig descr oVar aVar

return (mkBN ce, dSig)

ObjectOneOf il -> do

nil <- mapM (mapIndivIRI cSig) il

return (mkBD $ map (mkAE $ Name_term varN) nil, cSig)

ObjectValuesFrom qt oprop descr -> let v = var + 1 in do

ope <- mapOPE cSig oprop var v

(ce, dSig) <- mapDescription cSig descr (OVar v) $ aVar + 1

return $ case qt of

SomeValuesFrom -> (mkQE [mkNAME v] $ mkBC [ope, ce], dSig)

AllValuesFrom -> (mkQU [mkNAME v] $ mkBI ope ce, dSig)

ObjectHasSelf oprop -> smap mapObjProp cSig oprop oVar oVar

ObjectHasValue oprop indiv -> smap mapObjProp cSig oprop oVar (OIndi indiv)

ObjectCardinality (Cardinality ct n oprop d) -> mapCard True cSig ct n

(Left oprop) (fmap Left d) var

DataValuesFrom qt dpe dr -> let varNN = mkNName $ var + 1 in do

(drSent, drSig) <- mapDataRange cSig dr $ OVar var

senl <- mapM (mapDataPropI cSig (OVar var) $ OVar $ var + 1) [dpe]

let sent = mkBC $ drSent : senl

return $ case qt of

AllValuesFrom -> (mkQU [Name varNN] sent, drSig)

SomeValuesFrom -> (mkQE [Name varNN] sent, drSig)

DataHasValue dpe c -> do

con <- mapLiteral cSig c

return (mkQU [Name varN] $ mkAtoms $ Atom (Name_term $ uriToTok dpe)

[mkTermSeq varN, Term_seq con], cSig)

DataCardinality (Cardinality ct n dpe dr) -> mapCard False cSig ct n

(Right dpe) (fmap Right dr) var

mapClassAssertion :: TERM -> (ClassExpression, SENTENCE) -> TEXT

mapClassAssertion ind (ce, sent) = case ce of

Expression _ -> senToText sent

_ -> senToText $ (mk1QU . mkBI (mkAE mk1NTERM ind)) sent

mapFact :: Sign -> Extended -> Fact -> Result TEXT

mapFact cSig ex f = case f of

ObjectPropertyFact posneg obe ind -> case ex of

SimpleEntity (Entity NamedIndividual siri) -> do

oPropH <- mapObjProp cSig obe (OIndi siri) (OIndi ind)

return $ senToText $ case posneg of

Positive -> oPropH

Negative -> mkBN oPropH

_ -> failMsg f

DataPropertyFact posneg dpe lit -> case ex of

SimpleEntity (Entity NamedIndividual iri) -> do

inS <- mapIndivIRI cSig iri

inT <- mapLiteral cSig lit

nm <- uriToTokM dpe

let dPropH = mkTermAtoms nm [inS, inT]

return $ senToText $ case posneg of

Positive -> dPropH

Negative -> mkBN dPropH

_ -> failMsg f

mapCharact :: Sign -> ObjectPropertyExpression -> Character -> Result TEXT

mapCharact cSig ope c = case c of

Functional -> do

so1 <- mapOPE cSig ope 1 2

so2 <- mapOPE cSig ope 1 3

return $ mkQUBI (map mkNAME [1, 2, 3]) [so1, so2]

(mkNTERM 2) (mkNTERM 3)

InverseFunctional -> do

so1 <- mapOPE cSig ope 1 3

so2 <- mapOPE cSig ope 2 3

return $ mkQUBI (map mkNAME [1, 2, 3]) [so1, so2]

(mkNTERM 1) (mkNTERM 2)

Reflexive -> do

so <- mapOPE cSig ope 1 1

return $ senToText $ mk1QU so

Irreflexive -> do

so <- mapOPE cSig ope 1 1

return $ senToText $ mk1QU $ mkBN so

Symmetric -> do

so1 <- mapOPE cSig ope 1 2

so2 <- mapOPE cSig ope 2 1

return $ senToText $ mkQU [mkNAME 1, mkNAME 2] $ mkBI so1 so2

Asymmetric -> do

so1 <- mapOPE cSig ope 1 2

so2 <- mapOPE cSig ope 2 1

return $ senToText $ mkQU [mkNAME 1, mkNAME 2] $ mkBI so1 $ mkBN so2

Antisymmetric -> do

so1 <- mapOPE cSig ope 1 2

so2 <- mapOPE cSig ope 2 1

return $ mkQUBI [mkNAME 1, mkNAME 2] [so1, so2] (mkNTERM 1) (mkNTERM 2)

Transitive -> do

so1 <- mapOPE cSig ope 1 2

so2 <- mapOPE cSig ope 2 3

so3 <- mapOPE cSig ope 1 3

return $ senToText $ mkQU [mkNAME 1, mkNAME 2, mkNAME 3] $ mkBI

(mkBC [so1, so2]) so3

mkEDPairs :: Sign -> [Int] -> Maybe Relation -> [(SENTENCE, SENTENCE)]

-> Result ([TEXT], Sign)

mkEDPairs s il med pairs = do

let ls = case fromMaybe (error "expected EDRelation") med of

EDRelation Equivalent -> map (uncurry mkBB) pairs

EDRelation Disjoint -> map (\ (x, y) -> mkBN $ mkBC [x, y]) pairs

_ -> error "expected EDRelation"

return ([eqFB il ls], s)

-- | Mapping of ListFrameBit

mapListFrameBit :: Sign -> Extended -> Maybe Relation -> ListFrameBit

-> Result ([TEXT], Sign)

mapListFrameBit cSig ex rel lfb = case lfb of

AnnotationBit _ -> return ([], cSig)

ExpressionBit cls -> case ex of

Misc _ -> let cel = map snd cls in do

(els, sig) <- mapDescriptionListP cSig 1 $ comPairs cel cel

mkEDPairs sig [1] rel els

SimpleEntity (Entity ty iri) -> do

ls <- mapM (\ (_, c) -> mapDescription cSig c (OIndi iri) 1 ) cls

case ty of

NamedIndividual | rel == Just Types -> do

inD <- mapIndivIRI cSig iri

let ocls = map (mapClassAssertion inD)

$ zip (map snd cls) $ map fst ls

return (ocls, uniteL $ map snd ls)

DataProperty | rel == (Just $ DRRelation ADomain) -> do

oEx <- mapDPE cSig iri 1 2

return (msen2Txt $ map (mkSent [mk1NAME] [mkNAME 2] oEx

. fst) ls, uniteL $ map snd ls)

_ -> failMsg cls

ObjectEntity oe -> case rel of

Nothing -> failMsg cls

Just re -> case re of

DRRelation r -> do

tobjP <- mapOPE cSig oe 1 2

tdsc <- mapM (\ (_, c) -> mapDescription cSig c (case r of

ADomain -> OVar 1

ARange -> OVar 2) $ case r of

ADomain -> 1

ARange -> 2) cls

let vars = case r of

ADomain -> (1, 2)

ARange -> (2, 1)

return (msen2Txt $ map (mkSent [mkNAME $ fst vars]

[mkNAME $ snd vars] tobjP . fst) tdsc,

uniteL $ map snd tdsc)

_ -> failMsg cls

ClassEntity ce -> let cel = map snd cls in case rel of

Nothing -> failMsg lfb

Just r -> case r of

EDRelation _ -> do

(decrsS, dSig) <- mapDescriptionListP cSig 1 $ mkPairs ce cel

mkEDPairs dSig [1] rel decrsS

SubClass -> do

(domT, dSig) <- mapDescription cSig ce (OVar 1) 1

ls <- mapM (\ cd -> mapDescription cSig cd (OVar 1) 1) cel

rSig <- sigUnion cSig (unite dSig $ uniteL $ map snd ls)

return (msen2Txt $ map (mk1QU . mkBI domT . fst) ls, rSig)

_ -> failMsg cls

ObjectBit anl -> let opl = map snd anl in case rel of

Nothing -> failMsg lfb

Just r -> case ex of

Misc _ -> do

pairs <- mapObjPropListP cSig 1 2 $ comPairs opl opl

mkEDPairs cSig [1, 2] rel pairs

ObjectEntity op -> case r of

EDRelation _ -> do

pairs <- mapObjPropListP cSig 1 2 $ mkPairs op opl

mkEDPairs cSig [1, 2] rel pairs

SubPropertyOf -> do

os <- mapM (\ (o1, o2) -> mapSubObjProp cSig o1 o2 3)

$ mkPairs op opl

return (msen2Txt os, cSig)

InverseOf -> do

os1 <- mapM (\ o1 -> mapOPE cSig o1 1 2) opl

o2 <- mapOPE cSig op 2 1

return (msen2Txt $ map (\ cd -> mkQU (map mkNAME [1, 2])

$ mkBB cd o2) os1, cSig)

_ -> failMsg lfb

_ -> failMsg lfb

DataBit anl -> let dl = map snd anl in case rel of

Nothing -> return ([], cSig)

Just r -> case ex of

Misc _ -> do

pairs <- mapDataPropListP cSig 1 2 $ comPairs dl dl

mkEDPairs cSig [1, 2] rel pairs

SimpleEntity (Entity DataProperty iri) -> case r of

EDRelation _ -> do

pairs <- mapDataPropListP cSig 1 2 $ mkPairs iri dl

mkEDPairs cSig [1, 2] rel pairs

SubPropertyOf -> do

os1 <- mapM (\ o1 -> mapDPE cSig o1 1 2) dl

o2 <- mapDPE cSig iri 1 2

return (msen2Txt $ map (\ cd -> mkQU (map mkNAME [1, 2])

$ mkBI o2 cd) os1, cSig)

_ -> failMsg lfb

_ -> failMsg lfb

IndividualSameOrDifferent anl -> case rel of

Nothing -> failMsg lfb

Just (SDRelation re) -> do

fs <- mapComIndivList cSig re (getIRIWith NamedIndividual ex)

$ map snd anl

return (msen2Txt fs, cSig)

_ -> failMsg lfb

DataPropRange dpr -> case ex of

SimpleEntity (Entity DataProperty iri) -> do

oEx <- mapDPE cSig iri 1 2

ls <- mapM (\ (_, r) -> mapDataRange cSig r $ OVar 2) dpr

return (msen2Txt $ map (mkSent [mkNAME 1] [mkNAME 2] oEx

. fst) ls, uniteL $ map snd ls )

_ -> failMsg dpr

IndividualFacts indf -> do

fl <- mapM (mapFact cSig ex . snd) indf

return (fl, cSig)

ObjectCharacteristics ace -> case ex of

ObjectEntity ope -> do

cl <- mapM (mapCharact cSig ope . snd) ace

return (cl, cSig)

_ -> failMsg ace

-- | Mapping of AnnFrameBit

mapAnnFrameBit :: Sign -> Extended -> AnnFrameBit -> Result ([TEXT], Sign)

mapAnnFrameBit cSig ex afb =

let err = fail $ "could not translate " ++ show afb in case afb of

AnnotationFrameBit _ -> return ([], cSig)

DataFunctional -> case ex of

SimpleEntity (Entity DataProperty iri) -> do

so1 <- mapDPE cSig iri 1 2

so2 <- mapDPE cSig iri 1 3

return ([mkQUBI (map mkNAME [1, 2, 3]) [so1, so2]

(mkNTERM 2) $ mkNTERM 3], cSig)

_ -> err

DatatypeBit dr -> case ex of

SimpleEntity (Entity Datatype iri) -> do

(odes, dSig) <- mapDataRange cSig dr $ OVar 1

let dtp = mkTermAtoms (uriToTok iri) [mkVTerm $ OVar 1]

return ([senToText $ mk1QU $ mkBB dtp odes], dSig)

_ -> err

ClassDisjointUnion clsl -> case ex of

ClassEntity (Expression iri) -> do

(decrs, dSig) <- mapDescriptionList cSig 1 clsl

(decrsS, pSig) <- mapDescriptionListP cSig 1 $ comPairs clsl clsl

let decrsP = unzip decrsS

mcls <- mapClassIRI cSig iri $ mkNName 1

return ([senToText $ mk1QU $ mkBB mcls $ mkBC

[mkBD decrs, mkBN $ mkBC $ uncurry (++) decrsP]],

unite dSig pSig)

_ -> err

ClassHasKey opl dpl -> do

let ClassEntity ce = ex

(_, sig) <- mapDescription cSig ce (OVar 1) 1

ol <- mapM (\ o -> mapOPE cSig o 1 2) opl

nol <- mapM (\ o -> mapOPE cSig o 3 2) opl

dl <- mapM (\ d -> mapDPE cSig d 1 2) dpl

ndl <- mapM (\ d -> mapDPE cSig d 3 2) dpl

keys <- mapM (mapKey cSig ce) $ zip (ol ++ dl) $ nol ++ ndl

return (msen2Txt keys, sig)

ObjectSubPropertyChain oplst -> case ex of

ObjectEntity op -> do

os <- mapSubObjPropChain cSig oplst op 3

return ([senToText os], cSig)

_ -> err

mapKey :: Sign -> ClassExpression -> (SENTENCE, SENTENCE) -> Result SENTENCE

mapKey cSig ce (p, np) = do

(nce, _) <- mapDescription cSig ce (OVar 1) 1

(c3, _) <- mapDescription cSig ce (OVar 3) 3

let un = mkQU [mkNAME 3] $ mkBI (mkBC [c3 ,np]) $ mkAE (mkNTERM 3) $ mkNTERM 1

return $ mk1QU $ mkBI nce $ mkQE [mkNAME 2] $ mkBC [p, un]

-- | Mapping of Axioms

mapAxioms :: Sign -> Axiom -> Result ([TEXT], Sign)

mapAxioms cSig (PlainAxiom ex fb) = case fb of

ListFrameBit rel lfb -> mapListFrameBit cSig ex rel lfb

AnnFrameBit _ afb -> mapAnnFrameBit cSig ex afb