Extending the Automated Reasoning Toolbox
Licentiatavhandling, 2015

Due to the semi-decidable nature of first-order logic, it can be desirable to address a wider range of problems than the standard ones of satisfiability and derivability. We extend the automated reasoning toolbox by intro- ducing two new tools for analysing problems in first-order logic. Infinox is aimed at showing finite unsatisfiability, i.e. the absence of models with finite domains, and is a useful complement to finite model-finding. Monotonox, the second tool in our toolbox, uses a novel analysis that can identify sorts with extendable domains. Monotonox has successfully been used to improve on well-known existing translations between sorted and unsorted logic.

First-Order Logic

Sorted Logic

Automated Reasoning

Opponent: Dr. Peter Baumgartner


Ann Lillieström

Chalmers, Data- och informationsteknik, Programvaruteknik

Automated Inference of Finite Unsatisfiability

Journal of Automated Reasoning,; Vol. 47(2011)p. 111-132

Artikel i vetenskaplig tidskrift

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),; (2011)p. 207-221

Paper i proceeding


Informations- och kommunikationsteknik


Data- och informationsvetenskap

Technical report L - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University


Opponent: Dr. Peter Baumgartner

Mer information