Show simple item record

dc.contributor.authorLILLIESTRÖM, ANN
dc.date.accessioned2010-03-04T12:17:59Z
dc.date.available2010-03-04T12:17:59Z
dc.date.issued2010-03-04T12:17:59Z
dc.identifier.urihttp://hdl.handle.net/2077/22058
dc.description.abstractInfinox is an automated reasoning tool that can disprove the existence of finite models of first-order theories. It is a tool of both theoretical and practical value and is especially well suited as a complement to finite model finders. The main idea behind Infinox is to search for function and predicate symbols with certain properties that imply the non-existence of finite models. A standard automated theorem prover is used to check if these properties hold. We describe the methods used to identify terms that possess the desired properties, and explain in detail how these can be combined and applied to concrete problems. Some very promising first results are presented; Infinox has classified a large number of problems from the TPTP problem library as finitely unsatisfiable. Many of these problems have never before been solved (nor classified) by an automated system.en
dc.language.isoengen
dc.relation.ispartofseries2009en
dc.relation.ispartofseries02en
dc.titleThe Infinox Infinity Inferrer - A Complement to Finite Model Findingen
dc.typetext
dc.setspec.uppsokTechnology
dc.type.uppsokH2
dc.contributor.departmentGöteborgs universitet/Institutionen för data- och informationsteknikswe
dc.contributor.departmentUniversity of Gothenburg/Department of Computer Science and Engineeringeng
dc.type.degreeStudent essay


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record