pdl-tableau is a prototypical implementation of a variation of the tableau calculus for
PDL in De Giacomo and Massacci (2000), "Combining
Deduction and Model Checking into Tableaux and Algorithms for
Converse-PDL" (Information and Computation 162, pp. 117-137).
Just type in a formula and some theory formulae, and press the Submit button.
At the moment there is no guarantee for the soundness of the procedure
for formulae containing nested occurrences of the star operator.
The formula input language
Names for propositional atoms and atomic action symbols must be
strings with lowercase first letters.
- The primitive connnectives are:
not(Fml), and(Fml1,Fml2), or(Fml1,Fml2),
- Defined connnectives are:
implies(Fml1,Fml2), implied(Fml1,Fml2), equiv(Fml1,Fml2)
- The primitive action connnectives are:
- Defined action connnectives are:
- A possibly empty list of formulae inside a pair of '[', ']' (the
brackets are important).
[ Fml1, ..., Fmln ]
What does the prover do?
The prover tests for satisfiability and interprets the input likes this:
The output is the derivation given by a list of the inference steps
performed. Each line has 3 items: the number of the inference step, a
formula and a justification for the formula. An unnumbered line is a
conclusion which is redundant. The items marked with `post' are the
results of ignorability tests.
We look forward to your feedback. Please send your comments and suggestions
Web Interactive Input Form
Renate A. Schmidt
FM Group |
Last modified: 15 Feb 12
Copyright © 2003-2004
Renate A. Schmidt,
School of Computer Science, Man Univ, email@example.com