Copyright | (c) Dominik Luecke Uni Bremen 2007 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | luecke@informatik.uni-bremen.de |
Stability | experimental |
Portability | non-portable (imports Logic.Logic) |
Safe Haskell | Safe |
Sublogics for Propositional Logic
Synopsis
- sl_basic_spec :: PropSL -> BASIC_SPEC -> PropSL
- data PropFormulae
- data PropSL = PropSL {
- format :: Set PropFormulae
- sublogics_max :: PropSL -> PropSL -> PropSL
- top :: PropSL
- bottom :: PropSL
- sublogics_all :: [PropSL]
- sublogics_name :: PropSL -> String
- compareLE :: PropSL -> PropSL -> Bool
- sl_sig :: PropSL -> Sign -> PropSL
- sl_form :: PropSL -> FORMULA -> PropSL
- sl_sym :: PropSL -> Symbol -> PropSL
- sl_symit :: PropSL -> SYMB_ITEMS -> PropSL
- sl_mor :: PropSL -> Morphism -> PropSL
- sl_symmap :: PropSL -> SYMB_MAP_ITEMS -> PropSL
- prSymbolM :: PropSL -> Symbol -> Maybe Symbol
- prSig :: PropSL -> Sign -> Sign
- prMor :: PropSL -> Morphism -> Morphism
- prSymMapM :: PropSL -> SYMB_MAP_ITEMS -> Maybe SYMB_MAP_ITEMS
- prSymM :: PropSL -> SYMB_ITEMS -> Maybe SYMB_ITEMS
- prFormulaM :: PropSL -> FORMULA -> Maybe FORMULA
- prBasicSpec :: PropSL -> BASIC_SPEC -> BASIC_SPEC
- isNNF :: PropSL -> Bool
- isCNF :: PropSL -> Bool
- isDNF :: PropSL -> Bool
- isHC :: PropSL -> Bool
- isHF :: PropSL -> Bool
Documentation
sl_basic_spec :: PropSL -> BASIC_SPEC -> PropSL Source #
determines sublogic for basic spec
data PropFormulae Source #
types of propositional formulae
Instances
Eq PropFormulae Source # | |
Defined in Propositional.Sublogic (==) :: PropFormulae -> PropFormulae -> Bool (/=) :: PropFormulae -> PropFormulae -> Bool | |
Data PropFormulae Source # | |
Defined in Propositional.Sublogic gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PropFormulae -> c PropFormulae gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PropFormulae toConstr :: PropFormulae -> Constr dataTypeOf :: PropFormulae -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PropFormulae) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PropFormulae) gmapT :: (forall b. Data b => b -> b) -> PropFormulae -> PropFormulae gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PropFormulae -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PropFormulae -> r gmapQ :: (forall d. Data d => d -> u) -> PropFormulae -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> PropFormulae -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> PropFormulae -> m PropFormulae gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PropFormulae -> m PropFormulae gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PropFormulae -> m PropFormulae | |
Ord PropFormulae Source # | |
Defined in Propositional.Sublogic compare :: PropFormulae -> PropFormulae -> Ordering (<) :: PropFormulae -> PropFormulae -> Bool (<=) :: PropFormulae -> PropFormulae -> Bool (>) :: PropFormulae -> PropFormulae -> Bool (>=) :: PropFormulae -> PropFormulae -> Bool max :: PropFormulae -> PropFormulae -> PropFormulae min :: PropFormulae -> PropFormulae -> PropFormulae | |
Show PropFormulae Source # | |
Defined in Propositional.Sublogic showsPrec :: Int -> PropFormulae -> ShowS show :: PropFormulae -> String showList :: [PropFormulae] -> ShowS | |
Generic PropFormulae | |
Defined in Propositional.ATC_Propositional type Rep PropFormulae :: Type -> Type from :: PropFormulae -> Rep PropFormulae x to :: Rep PropFormulae x -> PropFormulae | |
FromJSON PropFormulae | |
Defined in Propositional.ATC_Propositional parseJSON :: Value -> Parser PropFormulae parseJSONList :: Value -> Parser [PropFormulae] | |
ToJSON PropFormulae | |
Defined in Propositional.ATC_Propositional toJSON :: PropFormulae -> Value toEncoding :: PropFormulae -> Encoding toJSONList :: [PropFormulae] -> Value toEncodingList :: [PropFormulae] -> Encoding | |
ShATermConvertible PropFormulae | |
Defined in Propositional.ATC_Propositional toShATermAux :: ATermTable -> PropFormulae -> IO (ATermTable, Int) toShATermList' :: ATermTable -> [PropFormulae] -> IO (ATermTable, Int) fromShATermAux :: Int -> ATermTable -> (ATermTable, PropFormulae) fromShATermList' :: Int -> ATermTable -> (ATermTable, [PropFormulae]) | |
type Rep PropFormulae | |
Defined in Propositional.ATC_Propositional type Rep PropFormulae = D1 ('MetaData "PropFormulae" "Propositional.Sublogic" "main" 'False) ((C1 ('MetaCons "HornFormula" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NegationNormalForm" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DisjunctiveNormalForm" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ConjunctiveNormalForm" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "HornClause" 'PrefixI 'False) (U1 :: Type -> Type)))) |
sublogics for propositional logic
PropSL | |
|
Instances
sublogics_all :: [PropSL] Source #
all sublogics
sublogics_name :: PropSL -> String Source #
sl_symmap :: PropSL -> SYMB_MAP_ITEMS -> PropSL Source #
determines the sublogic for symbol map items
prSymMapM :: PropSL -> SYMB_MAP_ITEMS -> Maybe SYMB_MAP_ITEMS Source #
prSymM :: PropSL -> SYMB_ITEMS -> Maybe SYMB_ITEMS Source #
prBasicSpec :: PropSL -> BASIC_SPEC -> BASIC_SPEC Source #