This project consists in a theorem prover which aims to show that Craig' interpolation property holds for propositional logic, modal logic and PDL. The program given a logic sentence first determines it's validity, and if valid computes one of the possible interpolants and checks if it respects the general definition of interpolant.
This project was built on python 3.7.3. In order to run the following packages are needed:
- pdfTeX Version 3.14159265-2.6-1.40.16 (TeX Live 2015)
To run the code alway run the script 'main.py'. The user can then decide to test a desired formula or to run an experiment with randomly generated formulas (choosing the desired logic and number of formulas to test).
If the user decides to input a formula, this should be given in a very specific format, if the format is not followed it could lead to wrong results as the code is very sensitive in particular when using the modality operator.
The user can only use all lower case letters for propositional atoms (such as 'a','b','c'). The user can also use the atoms 'True' or 'False' in which case the user should use 'true' and 'false' as name of the atoms.
The formula is given similarly to prefix notation. The operators used are the following:
-
Single atom (p): p
-
Negation(~a): op.Not(a)
-
Modality([]a): op.Mod(a)
-
Modality([b]a): op.Mod(a, "b")
-
Modality([c;b]a): op.Mod(a, "c ; b")
-
Modality([c U b]a): op.Mod(a, "c U b")
-
Conjunction(a^b): op.Conj(a,b)
-
Disjunction(a|b): op.Disj(a,b)
-
Implication (a->b): op.Impl(a,b)
Here are some easy and some more complicated examples to understad the fomat required:
- p: p
- (p ^ q ^ r): op.Conj(op.Conj(p,q),r) or op.Conj(p,op.Conj(q,r))
- (p ^ q ^ r ^ s): op.Conj(op.Conj(p,q),op.Conj(r,s)) or op.Conj(op.Conj(op.Conj(p,q),r),s)
- ((p | q)->p): op.Impl(op.Disj(p,q),p)
- ([a][b]p ->[a U b]p): op.Impl(op.Mod(op.Mod(p,"b"),"a"), op.Mod(p, "(a U b)"))
- (([(a ; b);((d U c) U d)]p ^ q) | ~[b]s): op.Disj(op.Conj(op.Mod(p,"((a ; b) ; ((d U c) U d))"),q),op.Not(op.Mod(s,"b")))
- (p ^ q) -> [a]True: op.Impl(op.Disj(p,q),op.Mod(true,"a"))
- (p v [c]False): op.Disj(p, op.Mod(false,"c"))
The code is higly sentitive in particular to the format of the string passed in the modality operator. The semicolon (;) and union(U) are both binary, when used a whitespace is always required both before and after the symbol. White space must not be used anywhere else in the string (not at the beginning/end of the string and also not between parenthesis). If used in combination, each symbol must have the corresponding open and closed parenthesis also at the outer level. For instance this is the correct format of the string "((a ; b) ; ((d U c) U d))" any variations such as below will result in a mistake in the computation:
- ((a ; b) ; (d U c U d))
- (a ; b) ; ((d U c) U d)
- ((a; b) ; ((d Uc) U d))
- ((a ; b) ; ( (d U c) U d))
If none or only one symbol is used such as in "a ; b" or "a" the outer paranthesis can be left out if desired as they are not needed, however the whitespace use still follows the same rules mentioned above (before and after symbol and not at the begginning or end of the string).
To tests a specific formula of the type phi->psi the user can add the option --manual by it self in which then the user will be asked to "Enter phi:" and the to "Enther psi:".
Otherwise the user can choose to follow the option --manual by formula phi in between single quotes and then formula psi also in between single quotes. Where the formulas follow the format explained above.
Like so: main.py --manual 'op.Conj(p,q)' 'q'
If the sentence tested is valid the program will output a pdf image, which will be automatically opened which shows the proof of validity and the computed interpolant. The image is not saved automatically and must be manually saved, this is why the program only allows the user to input one full formula (one psi, one phi) at the time otherwise the proof will get overwritten and then lost.
The user can also decided to run an experiment with randomly generated formulas if so the user should add the option --random followed by one of the following options :
--propto generate sentences in propositional logic--modalto generate sentences in modal logic--PDLto generate sentences in PDL
and then add as final parameter an integer which is the number of sentences the program is going to test.
In this case the latex pdf proofs will not be generated because as mentioned before it will get overwritten.The program while testing will print the number of sentences tested, the number of valid sentences, the number of valid sentences for which the interpolant was computed and is valid. If it is the case that the program finds a sentence which is valid but the computed interpolant is not valid, the program stops and provides the latex pdf proof. We don't want this to happen.