{"total":20,"rows":[{"id":"2102.10556","title":"Inductive logic programming at 30","created":"2021-02-21","cited_by_count":47,"area":null},{"id":"2412.14814","title":"Answer Set Networks: Casting Answer Set Programming into Deep Learning","created":"2024-12-19","cited_by_count":6,"area":null},{"id":"2202.01030","title":"Too much information: why CDCL solvers need to forget learned clauses","created":"2022-02-01","cited_by_count":2,"area":null},{"id":"2401.13770","title":"AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems","created":"2024-01-24","cited_by_count":2,"area":null},{"id":"2511.14778","title":"Learning Interestingness in Automated Mathematical Theory Formation","created":"2025-11-05","cited_by_count":2,"area":null},{"id":"2109.13273","title":"Design of quantum optical experiments with logic artificial intelligence","created":"2021-09-27","cited_by_count":1,"area":null},{"id":"2212.02405","title":"Inverting Cryptographic Hash Functions via Cube-and-Conquer","created":"2022-12-05","cited_by_count":1,"area":null},{"id":"2312.10436","title":"Decomposing Hard SAT Instances with Metaheuristic Optimization","created":"2023-12-16","cited_by_count":1,"area":null},{"id":"2112.06917","title":"Branching Strategy Selection Approach Based on Vivification Ratio","created":"2021-12-11","cited_by_count":0,"area":null},{"id":"2209.05838","title":"SATViz: Real-Time Visualization of Clausal Proofs","created":"2022-09-13","cited_by_count":0,"area":null},{"id":"2408.03345","title":"Artifical intelligence and inherent mathematical difficulty","created":"2024-08-01","cited_by_count":0,"area":null},{"id":"2501.17201","title":"Smart Cubing for Graph Search: A Comparative Study","created":"2025-01-27","cited_by_count":0,"area":null},{"id":"2506.00674","title":"Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization","created":"2025-05-31","cited_by_count":0,"area":null},{"id":"2508.08442","title":"Solver-Aided Expansion of Loops to Avoid Generate-and-Test","created":"2025-08-11","cited_by_count":0,"area":null},{"id":"2508.14294","title":"Explaining Hitori Puzzles: Neurosymbolic Proof Staging for Sequential Decisions","created":"2025-08-19","cited_by_count":0,"area":null},{"id":"2604.21187","title":"Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery","created":"2026-04-23","cited_by_count":0,"area":null},{"id":"2606.20656","title":"Learning Splitting Heuristics for Parallel String Solvers","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2607.00815","title":"Streaming LRAT Certificates into Lean Theorems","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2608.11211","title":"A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph","created":"2026-07-13","cited_by_count":0,"area":null},{"id":"2609.20873","title":"The Refutation Gap: Certifying Both Halves of an Optimality Claim","created":"2026-09-16","cited_by_count":0,"area":null}],"next_cursor":null}