Summary
- tuned output syntax: Hoare triples are now blocks
- tuned output syntax: INV and VAR are now blocks
- more precise slicing computation and output when not enough lemmas are available (e.g. with the 'only' syntax 'sledgehammer (lem1 lem2 lem3)')
- enable induction in one of Zipperposition's slices
- made sorting of Vampire facts more robust in the face of names that deviate from the standard scheme
- robustly handle empty proof blocks in Isar proof output
- propagate right result when enough proofs have been found
- correctly parse E proofs that assume '=' and '!=' bind more tightly than connectives
- don't lose error messages
- don't pass --auto-schedule to E indiscriminately -- use it instead of 'auto' in one slice
- careful with partial applications
- don't perform preplaying steps if preplaying is disabled
- adjust TPTP THF parser to give priority to @ over other operators, to parse Ehoh proofs
- tuned punctuation
- handle TPTP '!=' more gracefully in Isar proof reconstruction
- guard against duplicate lines in Zipperposition proofs
- tuning
- tuned NEWS
- compile HOL-TPTP
- compile Metis_Examples
- more NEWS
- compile mirabelle
- tweaked Auto Sledgehammer's behavior and output
- updated NEWS
- removed experimental prover z3_tptp
- print more verbose information
- run all installed provers by default
- update slice options centrally
- further work on new Sledgehammer slicing
- tweaked verbose output
- tweak padding of prover slice schedule to include all provers
- implemented 'max_proofs' mechanism
- document new option 'max_proofs'
- crude implementation of centralized slicing
- removed obscure E option
- take 'induction_rules' into consideration, as well as 'max_facts' even when 'only' is set
- rationalize slicing format
- thread slices through
- simplified 'best_slice' data structure and made minor changes to slices
- changed logic of 'slice' option to 'slices'
- updated documentation of 'slice' (now 'slices') option
- revised Sledgehammer documentation
- rationalized output for forthcoming slicing model
- use same default for FO and HO provers w.r.t. induction principles, based on evaluation -- this also simplifies the code
- disable slicing within ATP module (in preparation for refactoring)
- disable slicing within SMT (in preparation for factoring it out)
- generalized the 'slice' option towards more flexible slicing
- tuned -- fewer warnings;
Summary
- Strong soundness.
- Strong soundness.
- Fix LaTeX issue.
- Qualification required(?)
- merged
- more variants of the algorithm
- Added funding acknowledgments. Fixed broken BibTeX citation.
- Strong completeness for PAL systems.
The file was modified | thys/Public_Announcement_Logic/PAL.thy |
The file was modified | thys/Epistemic_Logic/Epistemic_Logic.thy |
The file was modified | thys/Public_Announcement_Logic/document/root.tex |
The file was modified | thys/Public_Announcement_Logic/PAL.thy |
The file was modified | thys/Gale_Shapley/Gale_Shapley1.thy |
The file was modified | thys/Banach_Steinhaus/Banach_Steinhaus_Missing.thy |
The file was modified | thys/Banach_Steinhaus/document/root.tex |
The file was modified | thys/Registers/document/root.tex |
The file was modified | thys/Epistemic_Logic/Epistemic_Logic.thy |
The file was modified | thys/Public_Announcement_Logic/PAL.thy |