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

Andrew B. Baker

dblp:36/4685 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 1994
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-authorTheory of computation · 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.

Artificial intelligence
5 papers
Knowledge representation and reasoning · 93% Planning, search and constraint satisfaction · 7%
Theoretical computer science
2 papers
Automated reasoning and model checking · 54% Algorithms and data structures · 46%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
nonmonotonic reasoning
0.021991
Nonmonotonic Reasoning in the Framework of Situation Calculus · Artif. Intell. 1991
A Theorem Prover for Prioritized Circumscription · IJCAI 1989
Programming languages and type systems › control structures
backtracking
0.011994
The Hazards of Fancy Backtracking · AAAI 1994
Automated reasoning and model checking
satisfiability
0.011994
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems · AAAI 1994
Algorithms and data structures › exact algorithms
satisfiability algorithms
0.011994
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems · AAAI 1994
Knowledge, reasoning and agents › Knowledge representation and reasoning › nonmonotonic reasoning
circumscription
0.011991
Nonmonotonic Reasoning in the Framework of Situation Calculus · Artif. Intell. 1991
Knowledge, reasoning and agents › Knowledge representation and reasoning › reasoning about action and change › reasoning about actions
situation calculus
0.011991
Nonmonotonic Reasoning in the Framework of Situation Calculus · Artif. Intell. 1991
Knowledge, reasoning and agents › Knowledge representation and reasoning › reasoning about action and change
frame problem
0.011989
A Simple Solution to the Yale Shooting Problem · KR 1989
Knowledge, reasoning and agents › Knowledge representation and reasoning
reasoning about action and change
0.011989
A Simple Solution to the Yale Shooting Problem · KR 1989
Knowledge, reasoning and agents › Knowledge representation and reasoning
temporal reasoning
0.011989
Temporal Projection and Explanation · IJCAI 1989
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
scheduling
0.011994
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems · AAAI 1994
Automated reasoning and model checking
theorem proving
0.011989
A Theorem Prover for Prioritized Circumscription · IJCAI 1989

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

satisfiability solving · 0.0backtracking · 0.0temporal reasoning · 0.0circumscription · 0.0
YearPublicationVenuePosition
1994 The Hazards of Fancy Backtracking
Andrew B. Baker
AAAI1
1994 Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems
James M. Crawford, Andrew B. Baker
AAAI2
1991 Nonmonotonic Reasoning in the Framework of Situation Calculus
abstract
Most of the solutions proposed to the Yale shooting problem have either introduced new nonmonotonic reasoning methods (generally involving temporal priorities) or completely reformulated the domain axioms to represent causality explicitly. This paper presents a new solution based on the idea that since the abnormality predicate takes a situational argument, it is important for the meanings of the situations to be held constant across the various models being compared. This is accomplished by a simple change in circumscription policy: when Ab is circumscribed, Result (rather than Holds) is allowed to vary. In addition, we need an axiom ensuring that every consistent situation is included in the domain of discourse. Ordinary circumscription will then produce the intuitively correct answer. Beyond its conceptual simplicity, the solution proposed here has additional advantages over the previous approaches. Unlike the approach that uses temporal priorities, it can support reasoning backward in time as well as forward. And unlike the causal approach, it can handle ramifications in a natural manner.
Andrew B. Baker
Artif. Intell.1
1989 A Theorem Prover for Prioritized Circumscription
Andrew B. Baker, Matthew L. Ginsberg
IJCAI1
1989 Temporal Projection and Explanation
Andrew B. Baker, Matthew L. Ginsberg
IJCAI1
1989 A Simple Solution to the Yale Shooting Problem
Andrew B. Baker
KR1