Extending the Automated Reasoning Toolbox
Doctoral thesis, 2019
Infinox aims to show finite unsatisfiability, i.e. the absence of models with finite domains, and is a useful complement to finite model-finding. Infinox can also be used to reason about the relative sizes of model domains in sorted first-order logic.
Monotonox uses a novel analysis that can identify sorts with extendable domains, improving on well-known existing translations between sorted and unsorted logic. This enables reasoning tools for unsorted logic to tackle problems in sorted logic. Conversely, finite model finders benefit from sort information which Monotonox can add to unsorted problems.
Equalox, the third tool in our toolbox, can improve the per- formance of first-order provers on problems involving transitive relations. The insight is that first-order provers are poor at applying the transitivity axiom effectively, but that the problem can always be transformed to safely remove the transitivity axiom.
Finally, we explore the field of computational linguistics as an application of automated reasoning. The tool Morfar uses a constraint solver to analyse the morphology of an input language. The result is a novel automatic method for segmentation and labelling that works well even when there is very little training data available.
integer linear programming
Chalmers, Computer Science and Engineering (Chalmers), Functional Programming
Language Technology (Computational Linguistics)
Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie: 4672
HC4, Hörsalsvägen 14
Opponent: Dr. Giles Reger, the University of Manchester