Finding reductions automatically

Authors:
Michael Crouch;Neil Immerman;J. Eliot B. Moss
Affiliations:
Computer Science Dept., University of Massachusetts, Amherst;Computer Science Dept., University of Massachusetts, Amherst;Computer Science Dept., University of Massachusetts, Amherst
Venue:
Fields of logic and computation
Year:
2010

Citing 13
Cited 2

Programming with sets; an introduction to SETL

Programming with sets; an introduction to SETL
Languages that capture complexity classes

SIAM Journal on Computing
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Undirected ST-connectivity in log-space

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Why are there so many loop formulas?

ACM Transactions on Computational Logic (TOCL)
One-way log-tape reductions

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems: Refining Schaefer's theorem

Journal of Computer and System Sciences
SAT-based answer set programming

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence

Experimental descriptive complexity

Logic and Program Semantics
Experiments with reduction finding

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe our progress building the program Reduction-Finder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reductions between decision problems described in logic.