The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for matings with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1976-2006 (15)
Publication types (Num. hits)
article(6) incollection(1) inproceedings(8)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12 occurrences of 12 keywords

Results
Found 15 publication records. Showing 15 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
132Peter B. Andrews Transforming Matings into Natural Deduction Proofs. Search on Bibsonomy CADE The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
115Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder Theorem Proving Using Equational Matings and Rigid E-Unification. Search on Bibsonomy J. ACM The full citation details ... 1992 DBLP  DOI  BibTeX  RDF Knuth-Bendix procedure, matings, NP-completeness, unification, automated theorem proving, equational reasoning
82Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke Satisfiability Checking of Non-clausal Formulas Using General Matings. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
82Reinhold Letz Using Matings for Pruning Connection Tableaux. Search on Bibsonomy CADE The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
49Matthew Bishop A Breadth-First Strategy for Mating Search. Search on Bibsonomy CADE The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
33Mitsuhiro Shishikura, Tan Lei A Family of Cubic Rational Maps and Matings of Cubic Polynomials. Search on Bibsonomy Exp. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
33Jean H. Gallier Unification procedures in automated deduction methods based on matings: A survey. Search on Bibsonomy Tree Automata and Languages The full citation details ... 1992 DBLP  BibTeX  RDF
33Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder Rigid E-Unification: NP-Completeness and Applications to Equational Matings Search on Bibsonomy Inf. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
33Sunil Issar Path-Focused Duplication: A Search Procedure for General Matings. Search on Bibsonomy AAAI The full citation details ... 1990 DBLP  BibTeX  RDF
33Jean H. Gallier, Stan Raatz, Wayne Snyder Theorem Proving Using Rigid E-Unification Equational Matings Search on Bibsonomy LICS The full citation details ... 1987 DBLP  BibTeX  RDF
33Wolfgang Bibel Matings in Matrices. Search on Bibsonomy Commun. ACM The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
33Peter B. Andrews Theorem Proving via General Matings. Search on Bibsonomy J. ACM The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
33Peter B. Andrews Refutations by Matings. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1976 DBLP  DOI  BibTeX  RDF clause-occurrence, mating, unsatisfiability, first-order logic, resolution, merge, cycle, Automatic theorem proving, refutation
33Dale Miller 0001 Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs. Search on Bibsonomy CADE The full citation details ... 1984 DBLP  DOI  BibTeX  RDF Expansion Trees, ET-proofs, Matings, Higher-order Logic, Natural Deduction
25Bernhard Beckert A Completion-Based Method for Mixed Universal and Rigid E-Unification. Search on Bibsonomy CADE The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #15 of 15 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license