Scalable Knowledge Refactoring Using Constrained Optimisation
Authors: Minghao Liu, David M. Cerna, Filipe Gouveia, Andrew Cropper
AAAI 2025 | Venue PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Our empirical results on multiple domains show that our approach can refactor programs quicker and with more compression than the previous state-of-the-art approach, sometimes by 60%. 5 Experiments To test our claim that MAXREFACTOR can find better refactorings than current approaches, our experiments aim to answer the question: Q1: How does MAXREFACTOR compare against KNORF on the optimal knowledge refactoring problem? To answer Q1, we compare the compression rate of the refactored programs produced by MAXREFACTOR and KNORF given the same timeout. |
| Researcher Affiliation | Academia | 1University of Oxford, United Kingdom 2Czech Academy of Sciences Institute of Computer Science (CAS ICS), Prague, Czechia EMAIL, EMAIL, EMAIL, EMAIL |
| Pseudocode | No | No structured pseudocode or algorithm blocks are present in the provided text. The COP encoding is described in text but not in a pseudocode block. |
| Open Source Code | Yes | Code https://github.com/minghao-liu/Max Refactor |
| Open Datasets | Yes | Datasets We use two datasets, Lego and Strings, from the KNORF paper. ... Datasets. We evaluate the scalability of MAXREFACTOR on three real-world problems: Drug Drug (Dhami et al. 2018), Alzheimer (King, Sternberg, and Srinivasan 1995), and Word Net (Bordes et al. 2014). |
| Dataset Splits | Yes | Specifically, for every size in {200, 250, 300, .. . , 1000}, we uniformly sample 10 programs from each dataset and run MAXREFACTOR (calling Max SAT) to refactor them. |
| Hardware Specification | Yes | All experiments use a computer with 5.2GHz CPUs and 16GB RAM. We run MAXREFACTOR and KNORF on a single CPU. |
| Software Dependencies | No | We use two versions of MAXREFACTOR: one which uses the COP solver CP-SAT5 and another which uses the Max SAT solver UWr Max Sat (Piotr ow 2020). No specific version numbers are provided for CP-SAT or UWr Max Sat in the text. |
| Experiment Setup | Yes | We consider at most two invented rules in a refactoring, as we found it leads to good results. For KNORF, we run the code from its repository6 and use the same parameters as stated in that paper. ... The timeout for a single run is set to 3600s and the runtime is counted as 3600s if the limit is exceeded. |