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.
? Tutorial for this page

Michael C. Tanner

dblp:34/270 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 1993
0000-0003-0243-8113ORCID · corroborated

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

Artificial intelligence and machine learning · 4Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1Theory of computation · 1

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
3 papers
Computational complexity · 91% Logic in computer science · 9%
Artificial intelligence
3 papers
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
abductive reasoning
0.021991
Some Results Concerning the Computational Complexity of Abduction · KR 1989
The Computational Complexity of Abduction · Artif. Intell. 1991
Computational complexity › complexity of reasoning
abduction complexity
0.011991
The Computational Complexity of Abduction · Artif. Intell. 1991

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

complexity analysis · 0.0abduction · 0.0
YearPublicationVenuePosition
1993 The role of policy in requirements definition
abstract
Three significant challenges facing the discipline of software engineering are understanding how software designers reason about policy, understanding how they define requirements based on this reasoning, and providing machine-based intelligent tools that support reasoning about policy. The authors are developing the concept of a policy workbench: knowledge-based tools that support reasoning about such properties of policies as consistency, completeness, and correctness, and the implications of policy for the behavior of a system. They discuss how such a workbench might help software designers reason about the relationships between policies and requirements.>
Edgar H. Sibley, Richard L. Wexelblat, James Bret Michael, Michael C. Tanner, David C. Littman
RE4
1991 The Computational Complexity of Abduction
Tom Bylander, Dean Allemang, Michael C. Tanner, John R. Josephson
Artif. Intell.3
1989 Some Results Concerning the Computational Complexity of Abduction
Tom Bylander, Dean Allemang, Michael C. Tanner, John R. Josephson
KR3
1987 Computational Complexity of Hypothesis Assembly
Dean Allemang, Michael C. Tanner, Tom Bylander, John R. Josephson
IJCAI2
1987 A Mechanism for Forming Composite Explanatory Hypotheses
abstract
A general problem-solving mechanism is described that is especially suited for performing a particular form of abductive inference, or best explanation finding. A problem solver embodying this mechanism synthesizes composite hypotheses by combining simple hypotheses to satisfy explanatory goals. These simple hypotheses are formed by instantiating prestored explanatory "concepts." In this way the problem solver is able to arrive at complex integrated conclusions which are not prestored. A computationally feasible task-specific problem-solving mechanism is presented for a particular information-processing task which is, nevertheless, of very great generality. The task is that of synthesizing coherent composite explanatory hypotheses based upon a prestored and possibly vast collection of hypothesis-generating concepts. This is seemingly a common task of intelligence and potentially a major component of diagnostic reasoning, especially where single-fault assumptions are inappropriate. The mechanism is described both functionally and structurally; that is, the why and what of the main computations are described, together with algorithms that show how each of these computations can be accomplished. The mechanism integrates a classification machine, used for selecting plausible hypotheses, with a specialized means-ends machine, used for assembling a best explanation from the plausible hypotheses thus selected and for pointedly investigating alternative explanations. There are also two other specialized mechanisms for the subsidiary functions of recognizing the applicability of a hypothesis to the situation and of interpreting the situation-specific raw data to satisfy the informational needs of the other components.
John R. Josephson, B. Chandrasekaran 0001, Jack W. Smith, Michael C. Tanner
IEEE Trans. Syst. Man Cybern.4
1985 Uncertainty Handling in Expert Systems: Uniform vs. Task-Specific Formalisms
B. Chandrasekaran 0001, Michael C. Tanner
UAI2