Similar Items: Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
- Honey, I Shrunk the Hypothesis Space (Through Logical Preprocessing)
- Work-Efficient Query Evaluation in Constant Time with PRAMs
- First Order Logic on Pathwidth Revisited Again
- An Empirical Comparison of Cost Functions in Inductive Logic Programming
- Bridging Domain Invariance and Diversity: A Fine-Grained Risk Bound for Domain Generalization
- Encoding Peano Arithmetic in a Minimal Fragment of Separation Logic