o 8Va!@sdZddlmZmZmZmZddlmZddlm Z ddl m Z ddZ dd d Z d d ZdddZdddZGdddZGdddeZdS)z Inference in propositional logic)AndNot conjunctsto_cnf)ordered)sympify) import_modulec CsV|dus|dur |Sz|jr|WS|jrt|jdWStttfy*tdw)z The symbol in this literal (without the negation). Examples ======== >>> from sympy.abc import A >>> from sympy.logic.inference import literal_symbol >>> literal_symbol(A) A >>> literal_symbol(~A) A TFrz#Argument must be a boolean literal.)Z is_SymbolZis_Notliteral_symbolargs ValueErrorAttributeError)literalr7/usr/lib/python3/dist-packages/sympy/logic/inference.pyr sr NFc Cs|dus|dkrtd}|durd}n |dkrtdd}|dkr+td}|dur+d}|dkr9dd lm}||S|dkrHdd lm}|||S|dkrWdd lm}|||S|dkrgdd lm}||||St ) a Check satisfiability of a propositional sentence. Returns a model when it succeeds. Returns {true: true} for trivially true expressions. On setting all_models to True, if given expr is satisfiable then returns a generator of models. However, if expr is unsatisfiable then returns a generator containing the single element False. Examples ======== >>> from sympy.abc import A, B >>> from sympy.logic.inference import satisfiable >>> satisfiable(A & ~B) {A: True, B: False} >>> satisfiable(A & ~A) False >>> satisfiable(True) {True: True} >>> next(satisfiable(A & ~A, all_models=True)) False >>> models = satisfiable((A >> B) & B, all_models=True) >>> next(models) {A: False, B: True} >>> next(models) {A: True, B: True} >>> def use_models(models): ... for model in models: ... if model: ... # Do something with the model. ... print(model) ... else: ... # Given expr is unsatisfiable. ... print("UNSAT") >>> use_models(satisfiable(A >> ~A, all_models=True)) {A: False} >>> use_models(satisfiable(A ^ A, all_models=True)) UNSAT Npycosatzpycosat module is not presentZdpll2Z minisat22pysatZdpllr)dpll_satisfiable)pycosat_satisfiable)minisat22_satisfiable) r ImportErrorZsympy.logic.algorithms.dpllrZsympy.logic.algorithms.dpll2Z&sympy.logic.algorithms.pycosat_wrapperrZ(sympy.logic.algorithms.minisat22_wrapperrNotImplementedError) expr algorithmZ all_modelsZminimalrrrrrrrr satisfiable&s0*       rcCstt| S)ax Check validity of a propositional sentence. A valid propositional sentence is True under every assignment. Examples ======== >>> from sympy.abc import A, B >>> from sympy.logic.inference import valid >>> valid(A | ~A) True >>> valid(A | B) False References ========== .. [1] https://en.wikipedia.org/wiki/Validity )rrrrrrvalidosrcsddlmddlmdfdd|vr|St|}|s+td||s/i}fdd |D}||}|vrGt|S|red d | D}t ||r_t |r]d Sd St |sed Sd S)a+ Returns whether the given assignment is a model or not. If the assignment does not specify the value for every proposition, this may return None to indicate 'not obvious'. Parameters ========== model : dict, optional, default: {} Mapping of symbols to boolean values to indicate assignment. deep: boolean, optional, default: False Gives the value of the expression under partial assignments correctly. May still return None to indicate 'not obvious'. Examples ======== >>> from sympy.abc import A, B >>> from sympy.logic.inference import pl_true >>> pl_true( A & B, {A: True, B: True}) True >>> pl_true(A & B, {A: False}) False >>> pl_true(A & B, {A: True}) >>> pl_true(A & B, {A: True}, deep=True) >>> pl_true(A >> (B >> A)) >>> pl_true(A >> (B >> A), deep=True) True >>> pl_true(A & ~A) >>> pl_true(A & ~A, deep=True) False >>> pl_true(A & B & (~A | ~B), {A: True}) >>> pl_true(A & B & (~A | ~B), {A: True}, deep=True) False r)Symbol)BooleanFunction)TFcs<t|s |vr dSt|sdStfdd|jDS)NTFc3s|]}|VqdSNr).0arg) _validaterr sz-pl_true.._validate..) isinstanceallr rrrr!booleanrrr!s  zpl_true.._validatez$%s is not a valid boolean expressioncsi|] \}}|vr||qSrr)rkv)r&rr szpl_true..cSsi|]}|dqS)Tr)rr'rrrr)sTFN) Zsympy.core.symbolrsympy.logic.boolalgrrr itemsZsubsboolZatomspl_truerr)rZmodelZdeepresultrr%rr-s0 (    r-cCs.|rt|}ng}|t|tt| S)a Check whether the given expr_set entail an expr. If formula_set is empty then it returns the validity of expr. Examples ======== >>> from sympy.abc import A, B, C >>> from sympy.logic.inference import entails >>> entails(A, [A >> B, B >> C]) False >>> entails(C, [A >> B, B >> C, A]) True >>> entails(A >> B) False >>> entails(A >> (B >> A)) True References ========== .. [1] https://en.wikipedia.org/wiki/Logical_consequence )listappendrrr)rZ formula_setrrrentailss  r1c@s>eZdZdZd ddZddZddZd d Zed d Z dS)KBz"Base class for all knowledge basesNcCst|_|r ||dSdSr)setclauses_tellselfsentencerrr__init__sz KB.__init__cCtrrr6rrrr5zKB.tellcCr:rr;r7Zqueryrrraskr<zKB.askcCr:rr;r6rrrretractr<z KB.retractcCstt|jSr)r/rr4)r7rrrclausessz KB.clausesr) __name__ __module__ __qualname____doc__r9r5r>r?propertyr@rrrrr2s r2c@s(eZdZdZddZddZddZdS) PropKBz=A KB for Propositional Logic. Inefficient, with no indexing.cC"tt|D]}|j|qdS)aiAdd the sentence's clauses to the KB Examples ======== >>> from sympy.logic.inference import PropKB >>> from sympy.abc import x, y >>> l = PropKB() >>> l.clauses [] >>> l.tell(x | y) >>> l.clauses [x | y] >>> l.tell(y) >>> l.clauses [y, x | y] N)rrr4addr7r8crrrr5 z PropKB.tellcCs t||jS)a8Checks if the query is true given the set of clauses. Examples ======== >>> from sympy.logic.inference import PropKB >>> from sympy.abc import x, y >>> l = PropKB() >>> l.tell(x & ~y) >>> l.ask(x) True >>> l.ask(y) False )r1r4r=rrrr>!s z PropKB.askcCrG)amRemove the sentence's clauses from the KB Examples ======== >>> from sympy.logic.inference import PropKB >>> from sympy.abc import x, y >>> l = PropKB() >>> l.clauses [] >>> l.tell(x | y) >>> l.clauses [x | y] >>> l.retract(x | y) >>> l.clauses [] N)rrr4discardrIrrrr?3rKzPropKB.retractN)rArBrCrDr5r>r?rrrrrFs  rF)NFF)NFr)rDr*rrrrZsympy.core.compatibilityrZsympy.core.sympifyrZsympy.external.importtoolsrr rrr-r1r2rFrrrrs    I  I!