Approximate Pruning in Tabled Logic Programming
No abstract available.
Related papers
- Synthesizing MILP Constraints for Efficient and Robust Optimization PLDI 2023
- A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution VMCAI 2003
- Minimizing Row Displacement Dispatch Tables OOPSLA 1995
- Verifying a hash table and its iterators in higher-order separation logic CPP 2017
- Proof transfer for fast certification of multiple approximate neural networks OOPSLA 2022
- An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs TOPLAS 1998
- Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics OOPSLA 2024
- U-Turn: Enhancing Incorrectness Analysis by Reversing Direction POPL 2026