-
Notifications
You must be signed in to change notification settings - Fork 1
SDD-based modal theorem prover
License
tpagram/sddtab
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
=== SDDtab === Thomas Pagram u5163504@anu.edu.au == Description == SDDtab is an SDD-based modal theorem prover for logics K and S4. == Installation == To compile, enter 'make' in the terminal within the sddtab directory. This will create the binary bin/sddtab. SDDtab has been tested on both OSX and Ubuntu. == Usage == SDDtab reads modal formulae from standard input with the following options: -k Enabled by default. Solves the benchmark in modal logic K. Mutually exclusive with option -s4. -s4 Solves the benchmark in modal logic S4. Mutually exclusive with option -k. -v Enable verbose mode. -sat If enabled, SDDtab will decide satisfiability. If not enabled, SDDtab defaults to deciding validity. -size SDDtab returns the size of the initial SDD constructed and does not solve the formulae. -help Print a help message. SDDTab accepts formulae of the form: f :: prop ~f f | f f & f f => f f <=> f <>f []f (f) where prop is an alphanumeric sequence of characters. Example command: cat benchmarks/k/k_branch_n/3.txt.k | bin/sddtab -v == Benchmarking == The following scripts benchmark the highest instance solved and initial SDD size (respectively) for the LWB benchmark set. benchmark2.sh benchmark2_size.sh Instructions and example commands are included within the scripts as comments.
About
SDD-based modal theorem prover
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published