CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Automated Inference of Finite Unsatisfiability

Koen Claessen (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Ann Lillieström (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
Journal of Automated Reasoning (0168-7433). Vol. 47 (2011), 2, p. 111-132.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: Finite unsatisfiability, Automated theorem proving, Automated reasoning, theorem prover

Denna post skapades 2011-10-19. Senast ändrad 2017-12-01.
CPL Pubid: 147417


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)


Information Technology

Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Extending the Automated Reasoning Toolbox