Automated Inference of Finite Unsatisfiability

Authors:
Koen Claessen;Ann Lillieström
Affiliations:
Chalmers University of Technology, Gothenburg, Sweden;Chalmers University of Technology, Gothenburg, Sweden
Venue:
Journal of Automated Reasoning
Year:
2011

Citing 8
Cited 2

Solution of the Robbins Problem

Journal of Automated Reasoning
S PASS Version 2.0

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
The state of CASC

AI Communications
E - a brainiac theorem prover

AI Communications - CASC
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Divvy: An ATP Meta-system Based on Axiom Relevance Ordering

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Automated Inference of Finite Unsatisfiability

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning

Sort it out with monotonicity: translating between many-sorted and unsorted first-order logic

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Encoding monomorphic and polymorphic types

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present Infinox, an automated tool for analyzing first-order logic problems, aimed at showing finite unsatisfiability, i.e., the absence of models with finite domains. Finite satisfiability is not a decidable problem (only semi-decidable), which means that such a tool can never be complete. Nonetheless, our hope is that Infinox be a useful complement to finite model finders in practice. Infinox uses several different proof techniques for showing infinity of a set, each of which requires the identification of a function or a relation with particular properties. Infinox enumerates candidates to such functions and relations, and subsequently uses an automated theorem prover as a sub-procedure to try to prove the resulting proof obligations. We have evaluated Infinox on the relevant problems from the TPTP benchmark suite, and we are able to automatically show finite unsatisfiability for over 25% of these problems.