Finding Finite Models in Multi-sorted First-Order Logic-Reference-Cited by-同舟云学术

Finding Finite Models in Multi-sorted First-Order Logic

Published:2016 Issue: Volume: Page:323-341
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2016
language:
Short-container-title:

Author:

Reger Giles,Suda Martin,Voronkov Andrei

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-40970-2_20

Reference18 articles.

1. Barrett, C., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2010). http://www.SMT-LIB.org

2. Lecture Notes in Computer Science;JC Blanchette,2013

3. Claessen, K., Lillieström, A.: Automated inference of finite unsatisfiability. J. Autom. Reasoning 47(2), 111–132 (2011)

4. Lecture Notes in Computer Science;K Claessen,2011

5. Claessen, K., Sörensson, N.: New techniques that improve MACE-style model finding. In: CADE-19 Workshop: Model Computation - Principles, Algorithms and Applications (2003)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification;Proceedings of the ACM on Programming Languages;2024-01-05

2. New Techniques for Static Symmetry Breaking in Many-Sorted Finite Model Finding;IEEE Transactions on Software Engineering;2023

3. Practical Puzzles;Modelling Puzzles in First Order Logic;2021

4. Eliminating Models During Model Elimination;Lecture Notes in Computer Science;2021

5. PrideMM: Second Order Model Checking for Memory Consistency Models;Lecture Notes in Computer Science;2020