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:
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Year:
2009

Citing 4
Cited 4

The TPTP Problem Library

Journal of Automated Reasoning
Solution of the Robbins Problem

Journal of Automated Reasoning
The state of CASC

AI Communications
E - a brainiac theorem prover

AI Communications - CASC

Relational analysis of (Co)inductive predicates, (Co)algebraic datatypes, and (Co)recursive functions

TAP'10 Proceedings of the 4th international conference on Tests and proofs
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning
Automated Inference of Finite Unsatisfiability

Journal of Automated Reasoning
Relational analysis of (co)inductive predicates, (co)algebraic datatypes, and (co)recursive functions

Software Quality Control

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 a semi-decidable problem, which means that such a tool can never be complete. Nevertheless, our hope is that Infinox be a complement to finite model finders in practice. The implementation consists of 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, with very promising results.