Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Steven K. Winker

dblp:96/302 · also Steve Winker · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorTheory of computation · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Automated reasoning and model checking · 65% Logic in computer science · 21% Algorithms and data structures · 14%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics
RNA structure prediction
0.011990
Structure detection through automated covariance search · Comput. Appl. Biosci. 1990
Automated reasoning and model checking
automated theorem proving
0.011982
Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions · J. ACM 1982
Algorithms and data structures › computational biology
sequence analysis
0.011990
Structure detection through automated covariance search · Comput. Appl. Biosci. 1990
Automated reasoning and model checking › theorem proving
resolution theorem proving
0.011976
An Evaluation of an Implementation of Qualified Hyperresolution · IEEE Trans. Computers 1976
Automated reasoning and model checking
theorem proving
0.011976
An Evaluation of an Implementation of Qualified Hyperresolution · IEEE Trans. Computers 1976

Methods — techniques the papers use, named apart from their topics

covariation analysis · 0.0model verification · 0.0first-order axiom system · 0.0qualified hyperresolution · 0.0clause qualification · 0.0
YearPublicationVenuePosition
1990 Automated Reasoning Contributed to Mathematics and Logic
Larry Wos, Steven K. Winker, William McCune, Ross A. Overbeek, Ewing L. Lusk, Rick L. Stevens, Ralph M. Butler
CADE2
1990 Structure detection through automated covariance search
abstract
This paper summarizes our investigations into the computational detection of secondary and tertiary structure of ribosomal RNA. We have developed a new automated procedure that not only identifies potential secondary and tertiary structural interactions, but also provides the covariation evidence that supports the proposed bondings, and any counterevidence that can be detected in the known sequences. A small number of previously unknown higher-order structural features have been detected in individual RNA molecules (16S rRNA and 7S RNA) through the use of our automated procedure. We are systematically studying mitochondrial rRNA, seeking tertiary structure within 16S rRNA and quaternary structure between 16S and 23S rRNA. To test hypotheses suggested by an examination of our program's output, our colleagues in biology are sequencing key portions of the 23S ribosomal RNA for species in which the known 16S ribosomal RNA exhibits variation (from the dominant pattern) at the site of a proposed bonding. Our ultimate hope is that automated covariation analysis will contribute significantly to a refined picture of ribosomal structure.
Steven K. Winker, Ross A. Overbeek, Carl R. Woese, Gary J. Olsen, N. Pfluger
Comput. Appl. Biosci.1
1990 Robbins Algebra: Conditions That Make a Near-Boolean Algebra Boolean
Steven K. Winker
J. Autom. Reason.1
1984 A New Use of an Automated Reasoning Assistant: Open Questions in Equivalential Calculus and the Study of Infinite Domains
Larry Wos, Steven K. Winker, Barry Smith 0002, Robert Veroff, Lawrence J. Henschen
Artif. Intell.2
1982 Procedure Implementation Through Demodulation and Related Tricks
Steven K. Winker, Larry Wos
CADE1
1982 Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
abstract
Two open questions m ternary Boolean algebras have been answered with the aid of an existmg automated theorem-proving program without recourse to any additional programming.The new automated theorem-provmg techraques developed in answering the open questions are presented here.Essentially, the ex~stmg theorem prover is used m a nonstandard way to seek and verify small fmite models and counterexamples for a first-order axiom system Exhibiting a model of an axiom system proves it consment; this facility complements traditional theorem-provmg methods, which can only prove mconslstency.
Steven K. Winker
J. ACM1
1976 An Evaluation of an Implementation of Qualified Hyperresolution
abstract
A new inference rule for resolution based theorem proving, termed qualified hyperresolution, is presented from a practical point of view. The method of qualification is intended to deal with clause sets involving not-everywhere-defined functions. Two examples illustrating the effects of the method are discussed in detail. The potential practical value of the method is indicated by substantial improvements over the performance of ordinary hyperresolution obtained in five test problems.
Steven K. Winker
IEEE Trans. Computers1