This paper explores the computational and descriptive complexity of fitting problems, specifically when dealing with logic-based hypothesis classes over infinite structures. It investigates how to determine if a given finite sample of inputs and outputs can be explained by a function within a particular class. The research focuses on decidable structures like the real ordered field and Presburger arithmetic, as well as broader classes defined by combinatorial or model-theoretic properties, examining the role of queries in this fitting process. AI
RANK_REASON The cluster contains a single academic paper discussing theoretical computer science concepts. [lever_c_demoted from research: ic=1 ai=0.4]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →