scispace - formally typeset
H

Hector J. Levesque

Researcher at University of Toronto

Publications -  202
Citations -  20981

Hector J. Levesque is an academic researcher from University of Toronto. The author has contributed to research in topics: Situation calculus & Knowledge representation and reasoning. The author has an hindex of 59, co-authored 200 publications receiving 20218 citations. Previous affiliations of Hector J. Levesque include Fairchild Semiconductor International, Inc. & Canadian Institute for Advanced Research.

Papers
More filters
Book ChapterDOI

Chapter 14 – Actions

TL;DR: This chapter explores reasoning about action along with the study how beliefs about a changing world that can be represented in a dialect of first-order logic (FOL) called the situation calculus are studied.
Journal ArticleDOI

A semantic characterization of a useful fragment of the situation calculus with knowledge

TL;DR: The situation calculus, as proposed by McCarthy and Hayes, and developed over the last decade by Reiter and co-workers, is reconsidered and a new logical variant called ES is proposed that captures much of the expressive power of the original, but where certain technical results are much more easily proved.
Journal ArticleDOI

Indexical knowledge and robot action—a logical account

TL;DR: A formal theory of knowledge and action, embodied in a modal logic, that handles the distinction between indexical and objective knowledge and allows a proper specification of the knowledge prerequisites and effects of action is presented.
Book ChapterDOI

A Situation Calculus Approach to Modeling and Programming Agents

TL;DR: The approach to building applications that involves designing a system as a collection of interacting agents is focused on, and any active entity whose behavior is usefully described through mental notions such as knowledge, goals, abilities, commitments, etc is taken.
Journal ArticleDOI

Support set selection for abductive and default reasoning

TL;DR: This work explores abduction tasks similar to that of the ATMS, but which return relatively small answers, and establishes for the first time a strong connection between computing abductive explanations and computing extensions in default logic.