First interactive protocol for Davis-Putnam resolution that is competitive with BDD methods for certifying UNSAT.
Making IP = PSPACE practical: Efficient interactive protocols for BDD algorithms
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
representative citing papers
New orthologic entailment algorithm and synthetic benchmarks from normalization equivalence improve SAT solving on some EPFL arithmetic circuit instances.
PtrTrans builds a Pointer Knowledge Graph with points-to flows, struct abstractions, and Rust annotations to guide LLMs toward project-level C-to-Rust translations that cut unsafe code by 99.9% and raise functional correctness by 29.3%.
ACToR improves C-to-Rust translation correctness via an adversarial LLM-agent loop that generates differential fuzz tests to drive iterative refinements, achieving over 90% pass rates on 63 real-world utilities.
Deciding synchronizability for mailbox systems under round-based policy with no round-size limit is PSPACE-complete.
citing papers explorer
-
A Resolution-Based Interactive Proof System for UNSAT
First interactive protocol for Davis-Putnam resolution that is competitive with BDD methods for certifying UNSAT.
-
Orthologic for SAT Solving
New orthologic entailment algorithm and synthetic benchmarks from normalization equivalence improve SAT solving on some EPFL arithmetic circuit instances.
-
Project-Level C-to-Rust Translation via Pointer Knowledge Graphs
PtrTrans builds a Pointer Knowledge Graph with points-to flows, struct abstractions, and Rust annotations to guide LLMs toward project-level C-to-Rust translations that cut unsafe code by 99.9% and raise functional correctness by 29.3%.
-
Adversarial Agent Collaboration for Correctness Improvements of C to Safe Rust Translation
ACToR improves C-to-Rust translation correctness via an adversarial LLM-agent loop that generates differential fuzz tests to drive iterative refinements, achieving over 90% pass rates on 63 real-world utilities.
-
An automata-based approach for synchronizable mailbox communication
Deciding synchronizability for mailbox systems under round-based policy with no round-size limit is PSPACE-complete.