Automated Inference of Finite Unsatisfiability
Artikel i vetenskaplig tidskrift, 2011

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.

Automated reasoning

Automated theorem proving

theorem prover

Finite unsatisfiability

Författare

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik

Ann Lillieström

Chalmers, Data- och informationsteknik, Programvaruteknik

Journal of Automated Reasoning

0168-7433 (ISSN) 1573-0670 (eISSN)

Vol. 47 2 111-132

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/s10817-010-9216-8