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

Steven A. Vere

dblp:72/4777 · DBLP profile ↗
← Back
6ranked-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 · 5 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory 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.

Artificial intelligence
4 papers
Planning, search and constraint satisfaction · 66% Knowledge representation and reasoning · 34%
Theoretical computer science
1 paper
Automata and formal languages · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 77% Programming languages and type systems · 23%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
scheduling
0.011983
Planning in Time: Windows and Durations for Activities and Goals · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
temporal planning
0.011983
Planning in Time: Windows and Durations for Activities and Goals · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge-based systems › rule-based systems
production systems
0.011977
Relational Production Systems · Artif. Intell. 1977
Knowledge, reasoning and agents › Knowledge representation and reasoning
relational learning
0.011977
Induction of Relational Productions in the Presence of Background Information · IJCAI 1977
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
deterministic planning
0.011983
Planning in Time: Windows and Durations for Activities and Goals · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Compilers and program optimization › compiler construction
syntax-directed translation
0.011970
On Syntax-Directed Transduction and Tree Transducers · STOC 1970
Automata and formal languages › formal translations
syntax-directed translation
0.011970
On Syntax-Directed Transduction and Tree Transducers · STOC 1970
Automata and formal languages
tree transducers
0.011970
On Syntax-Directed Transduction and Tree Transducers · STOC 1970
Knowledge, reasoning and agents › Knowledge representation and reasoning
background knowledge
0.011977
Induction of Relational Productions in the Presence of Background Information · IJCAI 1977
Data models and query languages
relational model
0.011977
Relational Production Systems · Artif. Intell. 1977
Programming languages and type systems › language semantics
formal semantics
0.011970
On Syntax-Directed Transduction and Tree Transducers · STOC 1970

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

constraint propagation · 0.0PERT scheduling · 0.0
YearPublicationVenuePosition
1990 A basic agent
abstract
A basic agent has been constructed which integrates limited natural language understanding and generation, temporal planning and reasoning, plan execution, simulated symbolic perception, episodic memory, and some general world knowledge. The agent is cast as a robot submarine operating in a two‐dimensional simulated “Seaworld” about which it has only partial knowledge. It can communicate with people in a vocabulary of about 800 common English words using a medium coverage grammar. The agent maintains an episodic memory of events in its life and has a limited ability to reflect on those events. A person can make statements to the agent, ask it questions, and give it commands. In response to commands, a temporal task planner is invoked to synthesize a plan, which is then executed at an appropriate future time. A large variety of temporal references in natural language are interpreted with respect to agent time. The agent can form and retain compound future plans, and replan in response to new information or new commands. Natural language verbs are represented in a state transition semantics for compatibility with the planner. The agent is able to give terse answers to questions about its past experiences, present activities and perceptions, future intentions, and general knowledge. No other artificial intelligence artifact with this range of capabilities has previously been constructed.
Steven A. Vere, Timothy W. Bickmore
Comput. Intell.1
1983 Planning in Time: Windows and Durations for Activities and Goals
abstract
A general purpose automated planner/scheduler is described which generates parallel plans to achieve goals with imposed time con-straints. Both durations and start time windows may be specified for sets of goal conditions. The parallel plans consist of not just actions but also of events (triggered by circumstances), inferences, and scheduled events (completely beyond the actor's control). Deterministic dura-tions of all such activities are explicitly modeled, and may be any com-putable function of the activity variables. A start time window for each activity in the plan is updated dynamically during plan generation, in order to maintain consistency with the windows and durations of adja-cent activities and goals. The plans are tailored around scheduled events. The final plan network resembles a PERT chart. From this a schedule of nominal start times for each activity is generated. Ex-amples are drawn from the traditional blocksworld and also from a real-istic ``Spaceworld,'' in which an autonomous spacecraft photographs objects in deep space and transmits the information to Earth. The author is with the Information Systems Research Section, Jet Propulsion Laboratory, Pasadena, CA 91109.
Steven A. Vere
IEEE Trans. Pattern Anal. Mach. Intell.1
1980 Multilevel Counterfactuals for Generalizations of Relational Concepts and Productions
Steven A. Vere
Artif. Intell.1
1977 Induction of Relational Productions in the Presence of Background Information
Steven A. Vere
IJCAI1
1977 Relational Production Systems
Steven A. Vere
Artif. Intell.1
1970 On Syntax-Directed Transduction and Tree Transducers
abstract
Several topics of theoretical and practical importance to the field of translator writing systems are presented in this paper. These are
David F. Martin, Steven A. Vere
STOC2