model-checker 0.2.2__tar.gz → 0.2.4__tar.gz

model_checker-0.2.4/PKG-INFO

@@ -0,0 +1,38 @@
+Metadata-Version: 2.1
+Name: model-checker
+Version: 0.2.4
+Summary: A hyperintensional model checker for counterfactual conditionals
+Author-email: Benjamin Brast-McKie <benbrastmckie@gmail.com>, Miguel Buitrago <mbuit82@gmail.com>
+License: MIT
+Project-URL: Homepage, https://github.com/benbrastmckie/ModelChecker
+Project-URL: Issues, https://github.com/benbrastmckie/ModelChecker/issues
+Keywords: semantics,Z3,counterfactuals,model checker
+Classifier: Programming Language :: Python :: 3.8
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Description-Content-Type: text/markdown
+License-File: LICENCE
+Requires-Dist: z3-solver
+
+# Model Checker
+
+This project aims to develop tools for proving theorems and finding countermodels for counterfactual conditional and modal claims.
+
+## Installation
+
+Install [Python 3](https://www.python.org/downloads/) and run the following commands in the terminal:
+
+```
+pip install z3-solver
+pip install model-checker
+```
+
+## Examples
+
+To generate a test file run `model-checker`.
+Alternatively, run `model-checker path/to/test_file.py` if `test_file.py` already exists.
+The `examples.py` file contains a number of valid and invalid arguments that can be tested.
+
+## GitHub
+
+More information can be found in the GitHub [repository](https://github.com/benbrastmckie/ModelChecker).

model_checker-0.2.4/README.md

@@ -0,0 +1,22 @@
+# Model Checker
+
+This project aims to develop tools for proving theorems and finding countermodels for counterfactual conditional and modal claims.
+
+## Installation
+
+Install [Python 3](https://www.python.org/downloads/) and run the following commands in the terminal:
+
+```
+pip install z3-solver
+pip install model-checker
+```
+
+## Examples
+
+To generate a test file run `model-checker`.
+Alternatively, run `model-checker path/to/test_file.py` if `test_file.py` already exists.
+The `examples.py` file contains a number of valid and invalid arguments that can be tested.
+
+## GitHub
+
+More information can be found in the GitHub [repository](https://github.com/benbrastmckie/ModelChecker).

model_checker-0.2.4/model_checker.egg-info/PKG-INFO

@@ -0,0 +1,38 @@
+Metadata-Version: 2.1
+Name: model-checker
+Version: 0.2.4
+Summary: A hyperintensional model checker for counterfactual conditionals
+Author-email: Benjamin Brast-McKie <benbrastmckie@gmail.com>, Miguel Buitrago <mbuit82@gmail.com>
+License: MIT
+Project-URL: Homepage, https://github.com/benbrastmckie/ModelChecker
+Project-URL: Issues, https://github.com/benbrastmckie/ModelChecker/issues
+Keywords: semantics,Z3,counterfactuals,model checker
+Classifier: Programming Language :: Python :: 3.8
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Description-Content-Type: text/markdown
+License-File: LICENCE
+Requires-Dist: z3-solver
+
+# Model Checker
+
+This project aims to develop tools for proving theorems and finding countermodels for counterfactual conditional and modal claims.
+
+## Installation
+
+Install [Python 3](https://www.python.org/downloads/) and run the following commands in the terminal:
+
+```
+pip install z3-solver
+pip install model-checker
+```
+
+## Examples
+
+To generate a test file run `model-checker`.
+Alternatively, run `model-checker path/to/test_file.py` if `test_file.py` already exists.
+The `examples.py` file contains a number of valid and invalid arguments that can be tested.
+
+## GitHub
+
+More information can be found in the GitHub [repository](https://github.com/benbrastmckie/ModelChecker).

{model_checker-0.2.2 → model_checker-0.2.4}/model_checker.egg-info/SOURCES.txt

@@ -1,4 +1,5 @@
 LICENCE
+README.md
 pyproject.toml
 model_checker.egg-info/PKG-INFO
 model_checker.egg-info/SOURCES.txt
@@ -11,6 +12,4 @@ package/model_definitions.py
 package/model_structure.py
 package/semantics.py
 package/syntax.py
-package/test.py
-package/test_complete.py
-package/top_test.py
+package/test_complete.py

{model_checker-0.2.2 → model_checker-0.2.4}/package/examples.py

@@ -1,5 +1,9 @@
 """
-module for user inputs.
+Example module for user inputs.
+Premises are conjoined and conclusions are disjoined.
+To save the output, change 'save_bool' to 'True' below.
+The examples below can be turned on and off by (un)commenting the premises an conclusions.
+The final pair of premises and conclusions to be defined will be run when the file is tested.
 """
 import os
 parent_directory = os.path.dirname(__file__)
@@ -8,7 +12,7 @@ parent_directory = os.path.dirname(__file__)
 ########## SETTINGS ############
 ################################
 
-# length of bitvectors
+# number of atomic states included in the models
 N = 3
 
 # print all Z3 constraints if a model is found
@@ -18,33 +22,21 @@ print_cons_bool = False
 print_unsat_core_bool = True
 
 # present option to append output to file
-save_bool = True
+save_bool = False
 
 
 ################################
-########### WORKING ############
+######## COUNTER MODELS ########
 ################################
 
-
 ### INVALID ###
 
-# premises = []
-# conclusions = []
-
-# premises = ['A']
-# conclusions = []
-
-# premises = ['\\neg A','(A \\boxright (B \\vee C))']
-# conclusions = ['(A \\boxright B)','(A \\boxright C)']
+premises = ['\\neg A','(A \\boxright (B \\vee C))']
+conclusions = ['(A \\boxright B)','(A \\boxright C)']
 
-# # NOTE: if null verifiers are permitted, then null state verifies A
-# # but possible state c does not?
 # premises = ['A','B']
 # conclusions = ['(A \\boxright B)']
 
-# premises = ['A',]
-# conclusions = ['\\neg A']
-
 # premises = ['\\neg A']
 # conclusions = ['(A \\boxright B)','(A \\boxright \\neg B)']
 
@@ -69,40 +61,23 @@ save_bool = True
 # premises = ['\\neg (\\top \\boxright \\neg (A \\wedge B))','((A \\wedge B) \\boxright C)']
 # conclusions = ['(A \\boxright (B \\boxright C))']
 
-# premises = ['A','(A \\boxright (B \\boxright (C \\boxright D)))']
-# conclusions = []
-
 # premises = ['(\\Box A \\vee \\Box B)']
 # conclusions = ['(A \\wedge B)']
 
-# # NOTE: slow
-# premises = ['(A \\boxright B)', '\\neg ((A \\wedge C) \\boxright B)', '(((A \\wedge C) \\wedge D) \\boxright B)']
-# conclusions = []
-
-premises = ['\\Diamond A', '\\Diamond B']
-conclusions = ['\\Diamond (A \\wedge B)']
+# premises = ['\\Diamond A', '\\Diamond B']
+# conclusions = ['\\Diamond (A \\wedge B)']
 
-# # NOTE: ssh finds a model
 # premises = ['(A \\boxright B)']
 # conclusions = ['\\Box (A \\rightarrow B)']
 
 
+################################
+############ LOGIC #############
+################################
 
-
-
-
-
-
-
-
-
-### VALID ###
-
-# # NOTE: unsat_core seems satisfiable
 # premises = []
 # conclusions = ['(A \\vee \\neg A)']
 
-# # NOTE: unsat_core seems satisfiable
 # premises = []
 # conclusions = ['\\neg (A \\wedge \\neg A)']
 
@@ -182,65 +157,3 @@ conclusions = ['\\Diamond (A \\wedge B)']
 
 # premises = ['\\Box (A \\rightarrow B)']
 # conclusions = ['(A \\boxright B)']
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-################################
-######### NOT WORKING ##########
-################################
-
-
-### HIGH PRIORITY: NEGATION PROBLEM ###
-
-# # NOTE: only works without \neg B
-# premises = ['\\neg B','(A \\boxright B)']
-# conclusions = ['(\\neg B \\boxright \\neg A)']
-
-# # NOTE: only works without \neg A
-# premises = ['\\neg A','(A \\boxright C)']
-# conclusions = ['((A \\wedge B) \\boxright C)']
-
-# # NOTE: only works without \neg A and \neg B
-# premises = ['\\neg A','\\neg B','(A \\boxright B)','(B \\boxright C)']
-# conclusions = ['(A \\boxright C)']
-
-# # NOTE: only works without \neg A
-# premises = ['\\neg A', '(A \\boxright B)', '\\neg ((A \\wedge C) \\boxright B)']
-# conclusions = []
-
-### MEDIUM PRIORITY: NESTED COUNTERFACTUALS ###
-
-# # NOTE: this does not find models for N = 3
-# # NOTE: N = 4 ran for minutes on ssh
-# premises = ['(A \\boxright (B \\boxright C))']
-# conclusions = ['((A \\wedge B) \\boxright C)']
-
-# # NOTE: ssh killed process
-# premises = ['(A \\boxright C)','(B \\boxright C)']
-# conclusions = ['((A \\wedge B) \\boxright C)']
-
-### LOW PRIORITY: MODAL EQUIVALENCE ###
-
-# # NOTE: killed in ssh
-# # K axiom (top)
-# premises = ['(\\top \\boxright (A \\rightarrow B))']
-# conclusions = ['((\\top \\boxright A) \\rightarrow (\\top \\boxright B))']
-
-# # NOTE: killed in ssh
-# # top-to-box equivalence
-# premises = ['(\\top \\boxright A)']
-# conclusions = ['\\Box A']

{model_checker-0.2.2 → model_checker-0.2.4}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "model-checker"
-version = "0.2.2"
+version = "0.2.4"
 description = "A hyperintensional model checker for counterfactual conditionals"
 authors = [
     { name = "Benjamin Brast-McKie", email = "benbrastmckie@gmail.com" },
@@ -27,4 +27,4 @@ Homepage = "https://github.com/benbrastmckie/ModelChecker"
 Issues = "https://github.com/benbrastmckie/ModelChecker/issues"
 
 [tool.poetry.scripts]
-package = "package.test_complete:main"
+model-checker = "package.test_complete:main"

model_checker-0.2.2/PKG-INFO

@@ -1,15 +0,0 @@
-Metadata-Version: 2.1
-Name: model-checker
-Version: 0.2.2
-Summary: A hyperintensional model checker for counterfactual conditionals
-Author-email: Benjamin Brast-McKie <benbrastmckie@gmail.com>, Miguel Buitrago <mbuit82@gmail.com>
-License: MIT
-Project-URL: Homepage, https://github.com/benbrastmckie/ModelChecker
-Project-URL: Issues, https://github.com/benbrastmckie/ModelChecker/issues
-Keywords: semantics,Z3,counterfactuals,model checker
-Classifier: Programming Language :: Python :: 3.8
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Operating System :: OS Independent
-Description-Content-Type: text/markdown
-License-File: LICENCE
-Requires-Dist: z3-solver

model_checker-0.2.2/model_checker.egg-info/PKG-INFO

@@ -1,15 +0,0 @@
-Metadata-Version: 2.1
-Name: model-checker
-Version: 0.2.2
-Summary: A hyperintensional model checker for counterfactual conditionals
-Author-email: Benjamin Brast-McKie <benbrastmckie@gmail.com>, Miguel Buitrago <mbuit82@gmail.com>
-License: MIT
-Project-URL: Homepage, https://github.com/benbrastmckie/ModelChecker
-Project-URL: Issues, https://github.com/benbrastmckie/ModelChecker/issues
-Keywords: semantics,Z3,counterfactuals,model checker
-Classifier: Programming Language :: Python :: 3.8
-Classifier: License :: OSI Approved :: MIT License
-Classifier: Operating System :: OS Independent
-Description-Content-Type: text/markdown
-License-File: LICENCE
-Requires-Dist: z3-solver

model_checker-0.2.2/package/test.py

@@ -1,137 +0,0 @@
-# TITLE: test
-
-"""
-There is a 3-model of:
-
-\Diamond A
-\Diamond B
-\neg \Diamond (A \wedge B)
-
-Possible states:
-  #b000 = □
-  #b001 = a (world)
-  #b010 = b (world)
-  #b100 = c (world)
-
-The evaluation world is c:
-  A  (True in c)
-  B  (Not true in c)
-
-1.  \Diamond A  (True in c)
-    |A| = < {b, c}, {a} >  (False in a)
-    |A| = < {b, c}, {a} >  (True in b)
-    |A| = < {b, c}, {a} >  (True in c)
-
-2.  \Diamond B  (True in c)
-    |B| = < {a}, {b, c} >  (True in a)
-    |B| = < {a}, {b, c} >  (False in b)
-    |B| = < {a}, {b, c} >  (False in c)
-
-3.  \neg \Diamond (A \wedge B)  (True in c)
-    \Diamond (A \wedge B)  (False in c)
-      (A \wedge B)  (False in a)
-        |A| = < {b, c}, {a} >  (False in a)
-        |B| = < {a}, {b, c} >  (True in a)
-      (A \wedge B)  (False in b)
-        |A| = < {b, c}, {a} >  (True in b)
-        |B| = < {a}, {b, c} >  (False in b)
-      (A \wedge B)  (False in c)
-        |A| = < {b, c}, {a} >  (True in c)
-        |B| = < {a}, {b, c} >  (False in c)
-
-Run time: 0.1222 seconds
-"""
-
-# path to parent directory
-import os
-parent_directory = os.path.dirname(__file__)
-
-# input sentences
-premises = ['\\Diamond A', '\\Diamond B', '\\neg \\Diamond (A \\wedge B)']
-conclusions = ['\\Diamond (A \\wedge B)']
-
-# number of atomic states
-N = 3
-
-# print all Z3 constraints if a model is found
-print_cons_bool = False
-
-# print core unsatisfiable Z3 constraints if no model exists
-print_unsat_core_bool = True
-
-# present option to save output
-save_bool = False
-
-# use constraints to find models in stead of premises and conclusions
-use_constraints_bool = False
-
-
-# satisfiable constraints
-all_constraints = [ForAll([frame_dummy_x, frame_dummy_y],
-       Implies(And(possible(frame_dummy_y),
-                   frame_dummy_x | frame_dummy_y ==
-                   frame_dummy_y),
-               possible(frame_dummy_x))), ForAll([frame_dummy_x, frame_dummy_y],
-       Exists(frame_dummy_z,
-              frame_dummy_x | frame_dummy_y == frame_dummy_z)), And(possible(w),
-    ForAll(max_dummy,
-           Implies(possible(max_dummy | w),
-                   max_dummy | w == w))), Not(verify(0, A)), Not(falsify(0, A)), ForAll([prop_dummy_x, prop_dummy_y],
-       Implies(And(verify(prop_dummy_x, A),
-                   verify(prop_dummy_y, A)),
-               verify(prop_dummy_x | prop_dummy_y, A))), ForAll([prop_dummy_x, prop_dummy_y],
-       Implies(And(falsify(prop_dummy_x, A),
-                   falsify(prop_dummy_y, A)),
-               falsify(prop_dummy_x | prop_dummy_y, A))), ForAll([prop_dummy_x, prop_dummy_y],
-       Implies(And(verify(prop_dummy_x, A),
-                   falsify(prop_dummy_y, A)),
-               Not(possible(prop_dummy_x | prop_dummy_y)))), ForAll([prop_dummy_x, prop_dummy_y],
-       Implies(And(possible(prop_dummy_x),
-                   assign(prop_dummy_x, A) == prop_dummy_y),
-               And(possible(prop_dummy_x | prop_dummy_y),
-                   Or(verify(prop_dummy_y, A),
-                      falsify(prop_dummy_y, A))))), Not(verify(0, B)), Not(falsify(0, B)), ForAll([prop_dummy_x, prop_dummy_y],
-       Implies(And(verify(prop_dummy_x, B),
-                   verify(prop_dummy_y, B)),
-               verify(prop_dummy_x | prop_dummy_y, B))), ForAll([prop_dummy_x, prop_dummy_y],
-       Implies(And(falsify(prop_dummy_x, B),
-                   falsify(prop_dummy_y, B)),
-               falsify(prop_dummy_x | prop_dummy_y, B))), ForAll([prop_dummy_x, prop_dummy_y],
-       Implies(And(verify(prop_dummy_x, B),
-                   falsify(prop_dummy_y, B)),
-               Not(possible(prop_dummy_x | prop_dummy_y)))), ForAll([prop_dummy_x, prop_dummy_y],
-       Implies(And(possible(prop_dummy_x),
-                   assign(prop_dummy_x, B) == prop_dummy_y),
-               And(possible(prop_dummy_x | prop_dummy_y),
-                   Or(verify(prop_dummy_y, B),
-                      falsify(prop_dummy_y, B))))), Exists(t_dummy_u,
-       And(And(possible(t_dummy_u),
-               ForAll(max_dummy,
-                      Implies(possible(max_dummy | t_dummy_u),
-                              max_dummy | t_dummy_u ==
-                              t_dummy_u))),
-           Exists(t_dummy_x,
-                  And(t_dummy_x | t_dummy_u == t_dummy_u,
-                      verify(t_dummy_x, A))))), Exists(t_dummy_u,
-       And(And(possible(t_dummy_u),
-               ForAll(max_dummy,
-                      Implies(possible(max_dummy | t_dummy_u),
-                              max_dummy | t_dummy_u ==
-                              t_dummy_u))),
-           Exists(t_dummy_x,
-                  And(t_dummy_x | t_dummy_u == t_dummy_u,
-                      verify(t_dummy_x, B))))), ForAll(f_dummy_u,
-       Implies(And(possible(f_dummy_u),
-                   ForAll(max_dummy,
-                          Implies(possible(max_dummy |
-                                        f_dummy_u),
-                                  max_dummy | f_dummy_u ==
-                                  f_dummy_u))),
-               Or(Exists(f_dummy_x,
-                         And(f_dummy_x | f_dummy_u ==
-                             f_dummy_u,
-                             falsify(f_dummy_x, A))),
-                  Exists(f_dummy_x,
-                         And(f_dummy_x | f_dummy_u ==
-                             f_dummy_u,
-                             falsify(f_dummy_x, B))))))]

model_checker-0.2.2/package/top_test.py

@@ -1,73 +0,0 @@
-
-'''
-Model Checker: top_test.py
-'''
-import os
-parent_directory = os.path.dirname(__file__)
-from model_structure import make_model_for
-
-################################
-########## SETTINGS ############
-################################
-
-# length of bitvectors
-N = 3
-
-# print all Z3 constraints if a model is found
-print_cons_bool = False
-
-# print core unsatisfiable Z3 constraints if no model exists
-print_unsat_core_bool = True
-
-# present option to append output to file
-save_bool = False
-
-# use constraints to find models in stead of premises and conclusions
-use_constraints_bool = False
-
-################################
-########### ARGUMENT ###########
-################################
-
-### INVALID ###
-
-# premises = ['neg A','(A boxright (B vee C))']
-# conclusions = ['(A boxright B)','(A boxright C)']
-
-### VALID ###
-
-premises = ['(\\top \\boxright (A \\boxright B))', 'A']
-conclusions = ['\\neg B']
-
-# premises = ['(\\top \\boxright A)', '((A \\wedge B) \\boxright C)', '\\neg (\\top \\boxright \\neg D)']
-# conclusions = ['\\neg A']
-
-# premises = ['(\\top \\boxright A)']
-# # conclusions = ['\\neg A'] # exists model, as desired
-# conclusions = ['A'] # no models, as desired
-# conclusions = ['\\neg (\\top \\boxright \\neg A)'] # no models, as desired
-
-# should this be valid? to me it seems intuitively it should be, but not sure
-# premises = ['(\\top \\boxright A)', '((A \\wedge B) \\boxright C)']
-# conclusions = ['(B \\boxright C)']
-
-# premises =  ['\\Box A'] # no models, as desired
-# premises = ['\\Diamond A'] # model, as desired
-# conclusions = ['A']
-
-# premises = ['\\Box A']
-# conclusions = ['(\\top \\boxright A)'] # works; flipped takes a while, and Diamond case takes a while too
-
-premises = ['(\\Box A \\vee \\Box B)']
-conclusions = ['(A \\wedge B)']
-
-
-
-mod = make_model_for(N)(premises, conclusions)
-# mod.print_inputs_recursively()
-# mod.print_evaluation()
-mod.print_to(print_cons_bool, print_unsat_core_bool)
-# print(mod.sentence_letters)
-# print(mod.all_subsentences)
-# for sent_let in mod.sentence_letters:
-#     print(sent_let, type(sent_let))