Bibliographic record
Abstract
Computationally hard search and optimization problems occur widely in engineering, business, science and logistics, in domains ranging from hardware and software design and verification, to drug design, planning and scheduling.Most of these problems are NP-complete, so no known polynomial-time algorithms exist.Usually, the available solution for a user facing such problems involves mathematical programming for example, integer-linear programming tools, constraint logic programming tools and development of custom-designed implementations of algorithms for solving NP-hard problems.Successful use of these approaches normally requires a deep knowledge of programming, and is often time consuming.Another approach to attack NP search problems is to utilize the knowledge of users to produce precise descriptions of the (search) problem in a declarative specification or modelling language.A solver then takes a specification, together with an instance of the problem, and produces a solution to the problem, if there is any.Model expansion (MX), the logical task of expanding a given (mathematical) structure by new relations, is one of the well-studied directions of this approach.Formally, in MX, the user axiomatizes their problem in a language.This axiomatization describes the relationship between an instance of the problem (a given finite structure, i.e., a universe together with some relations and functions), and its solutions (certain expansions of that structure).This thesis presents the Enfragmo system for specifying and solving combinatorial search problems.Enfragmo takes a problem specification, in which the axioms are expressed in an extension of first-order logic, and a problem instance as its input and produces a propositional conjunctive normal form formula that is sent to a propositional satisfiability (SAT) solver.In this thesis, we describe several techniques that we have developed in order to build our well performing solver, Enfragmo.I would like to gratefully thank Dr. Eugenia Ternovska for her guidance, support, and her friendship during my graduate studies at Simon Fraser University.I thank her for having confidence in my abilities to handle such an intricate research topic.Without her critical reviews and intellectual inputs, this thesis would not have been possible in the present form.I would also like to
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.013 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.001 | 0.006 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.005 | 0.008 |
| Open science | 0.005 | 0.008 |
| Research integrity | 0.002 | 0.006 |
| Insufficient payload (model declined to judge) | 0.031 | 0.010 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".