Search results for "Matings"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
132	Peter B. Andrews	Transforming Matings into Natural Deduction Proofs.	CADE	1980	DBLP DOI BibTeX RDF
115	Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder	Theorem Proving Using Equational Matings and Rigid E-Unification.	J. ACM	1992	DBLP DOI BibTeX RDF	Knuth-Bendix procedure, matings, NP-completeness, unification, automated theorem proving, equational reasoning
82	Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke	Satisfiability Checking of Non-clausal Formulas Using General Matings.	SAT	2006	DBLP DOI BibTeX RDF
82	Reinhold Letz	Using Matings for Pruning Connection Tableaux.	CADE	1998	DBLP DOI BibTeX RDF
49	Matthew Bishop	A Breadth-First Strategy for Mating Search.	CADE	1999	DBLP DOI BibTeX RDF
33	Mitsuhiro Shishikura, Tan Lei	A Family of Cubic Rational Maps and Matings of Cubic Polynomials.	Exp. Math.	2000	DBLP DOI BibTeX RDF
33	Jean H. Gallier	Unification procedures in automated deduction methods based on matings: A survey.	Tree Automata and Languages	1992	DBLP BibTeX RDF
33	Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder	Rigid E-Unification: NP-Completeness and Applications to Equational Matings	Inf. Comput.	1990	DBLP DOI BibTeX RDF
33	Sunil Issar	Path-Focused Duplication: A Search Procedure for General Matings.	AAAI	1990	DBLP BibTeX RDF
33	Jean H. Gallier, Stan Raatz, Wayne Snyder	Theorem Proving Using Rigid E-Unification Equational Matings	LICS	1987	DBLP BibTeX RDF
33	Wolfgang Bibel	Matings in Matrices.	Commun. ACM	1983	DBLP DOI BibTeX RDF
33	Peter B. Andrews	Theorem Proving via General Matings.	J. ACM	1981	DBLP DOI BibTeX RDF
33	Peter B. Andrews	Refutations by Matings.	IEEE Trans. Computers	1976	DBLP DOI BibTeX RDF	clause-occurrence, mating, unsatisfiability, first-order logic, resolution, merge, cycle, Automatic theorem proving, refutation
33	Dale Miller 0001	Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs.	CADE	1984	DBLP DOI BibTeX RDF	Expansion Trees, ET-proofs, Matings, Higher-order Logic, Natural Deduction
25	Bernhard Beckert	A Completion-Based Method for Mixed Universal and Rigid E-Unification.	CADE	1994	DBLP DOI BibTeX RDF