Finding Finite Models in Multi-Sorted First-Order Logic
- Submitting institution
-
The University of Manchester
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 64522475
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-319-40970-2_20
- Title of conference / published proceedings
- Theory and applications of satisfiability testing -- SAT 2016 : 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings
- First page
- 323
- Volume
- 9710
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
A - Computer Science
- Citation count
- 5
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- "Whilst the extension of finite model finding techniques to multi-sorted problems is straightforward in theory, this is the first approach to show how to do this in a practical way.
This work was implemented in the Vampire theorem prover and directly led to Vampire winning the FNT (finite non-theorems) division of the automated reasoning ''world cup'' every year since 2015. It also enabled Vampire to enter and win the UF division of SMT-COMP every year since 2017.
Used by Amazon Web Services in their Tiros tool to automate the checking of compliance certification."
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
