Authors of this project:
This is a collection of useful tools to quickly inspect mSentential as
a black box for people who are not versed in the beauty of lisp. The theory
mSentential implements is described in:
Khemlani, S. S., Byrne, R. M., & Johnson‐Laird, P. N. (2018). Facts and Possibilities: A Model‐Based Theory of Sentential Reasoning. Cognitive science, 42(6), 1887-1924.
For these tools to work, a copy of the original mSentential program is
downloaded from www.modeltheory.org and
used as a black box. For more information about it, see the header of the
program which contains contact information. The original mSentential program
is distributed under Creative Commons Attribution-NonCommercial- ; ShareAlike
4.0 International License.
These tools require the following program to be available:
eclor any other lisp interpretor that can load several files before running a script from another fileRwith the packagestidyr,dplyrandpanderbashto glue things together.
This tool provides a table containing the output of mSentential for a given
formula, for all extreme values of the gamma and sigma parameters. It
expects a formula and request (one of necessary, possible, what-follows,
probability and verify), runs the model 100 time per condition, and
aggregates the output.
$ ./wrapper.R "(a ore b)(a)" "necessary"
Table: summary of the output for the formula `(inference '((a ore b)(a)) 'necessary?)` under extreme parameters for sigma and gamma
+---------+---------+--------+-----+-----+
| | | result | NO | YES |
+---------+---------+--------+-----+-----+
| UseSys2 | UseWeak | | | |
+---------+---------+--------+-----+-----+
| FALSE | FALSE | | 100 | 0 |
+---------+---------+--------+-----+-----+
| | TRUE | | 3 | 97 |
+---------+---------+--------+-----+-----+
| TRUE | FALSE | | 100 | 0 |
+---------+---------+--------+-----+-----+
| | TRUE | | 0 | 100 |
+---------+---------+--------+-----+-----+This tools takes values for sigma and gamma and a formula, and outputs
mSentential's internal deliberations.
$ ./expose_internals.sh 1 0 "(a ore b)(a)"
---- --------- --------------------------------------------------------------------------- -------
Step System Description Runtime
---- --------- --------------------------------------------------------------------------- -------
0 -- Initialized trace 0
0 Control No task specified and so builds models of all the premises 1
1 Language Parsing premise: 1
2 Language A ore b. 1
3 System 1 Constructs models: 2
4 Language Parsing premise: 2
5 Language A. 2
6 System 1 Constructs models: 2
7 System 1 Model of conjunction of premises: 2
8 System 1 The premises yield the models: (((- B) (A))) 2
9 Language Parsing premise: 2
10 Language A ore b. 2
11 System 1 Constructs models: 2
12 Language Parsing premise: 2
13 Language A. 2
14 System 1 Constructs models: 2
15 System 1 Model of conjunction of premises: 2
16 System 1 Number of explicit mental models constructed equals 8. 2
17 Control Engaging System 2 2
18 Language Parsing premise: 2
19 Language A ore b. 2
20 System 2 Constructs models: 2
21 Language Parsing premise: 2
22 Language A. 2
23 System 2 Constructs models: 2
24 System 2 Model of conjunction of premises: 3
25 System 2 The premises yield the models: (((A) (- B))) 3
26 System 2 Number of fully explicit models constructed equals 4. 3