Arrow Research search

Author name cluster

Hector J. Levesque

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

58 papers
2 author rows

Possible papers

58

AAAI Conference 2022 Conference Paper

Toward a New Science of Common Sense

  • Ronald J. Brachman
  • Hector J. Levesque

Common sense has always been of interest in AI, but has rarely taken center stage. Despite its mention in one of John McCarthy's earliest papers and years of work by dedicated researchers, arguably no AI system with a serious amount of general common sense has ever emerged. Why is that? What's missing? Examples of AI systems' failures of common sense abound, and they point to AI's frequent focus on expertise as the cause. Those attempting to break the brittleness barrier, even in the context of modern deep learning, have tended to invest their energy in large numbers of small bits of commonsense knowledge. But all the commonsense knowledge fragments in the world don't add up to a system that actually demonstrates common sense in a human-like way. We advocate examining common sense from a broader perspective than in the past. Common sense is more complex than it has been taken to be and is worthy of its own scientific exploration.

KR Conference 2020 Conference Paper

A First-Order Logic of Limited Belief Based on Possible Worlds

  • Gerhard Lakemeyer
  • Hector J. Levesque

In a recent paper Lakemeyer and Levesque proposed a first-order logic of limited belief to characterize the beliefs of a knowledge base (\KB). Among other things, they show that their model of belief is expressive, eventually complete, and tractable. This means, roughly, that a \KB\ may consist of arbitrary first-order sentences, that any sentence which is logically entailed by the \KB\ is eventually believed, given enough reasoning effort, and that reasoning is tractable under reasonable assumptions. One downside of the proposal is that epistemic states are defined in terms of sets of clauses, possibly containing variables, giving the logic a distinct syntactic flavour compared to the more traditional possible-world semantics found in the literature on epistemic logic. In this paper we show that the same properties as above can be obtained by defining epistemic states as sets of three-valued possible worlds. This way we are able to shed new light on those properties by recasting them using the more familiar notion of truth over possible worlds.

KR Conference 2020 Conference Paper

Changing Beliefs about Domain Dynamics in the Situation Calculus

  • Toryn Q. Klassen
  • Sheila A. McIlraith
  • Hector J. Levesque

Agents change their beliefs about the plausibility of various aspects of domain dynamics -- effects of physical actions, results of sensing, and action preconditions -- as a consequence of their interactions with the world. In this paper we propose a way to conveniently represent domain dynamics in the situation calculus to support such belief change. Furthermore, we suggest patterns to follow when writing the axioms that describe the effects of actions, and prove how these patterns can control the extent to which observations change the agent's beliefs about action effects. We also discuss the relation of our work to the AGM postulates for belief revision. Finally, we show how beliefs about domain dynamics can be incorporated into a form of regression rewriting to support reasoning.

IJCAI Conference 2019 Conference Paper

A Tractable, Expressive, and Eventually Complete First-Order Logic of Limited Belief

  • Gerhard Lakemeyer
  • Hector J. Levesque

In knowledge representation, obtaining a notion of belief which is tractable, expressive, and eventually complete has been a somewhat elusive goal. Expressivity here means that an agent should be able to hold arbitrary beliefs in a very expressive language like that of first-order logic, but without being required to perform full logical reasoning on those beliefs. Eventual completeness means that any logical consequence of what is believed will eventually come to be believed, given enough reasoning effort. Tractability in a first-order setting has been a research topic for many years, but in most cases limitations were needed on the form of what was believed, and eventual completeness was so far restricted to the propositional case. In this paper, we propose a novel logic of limited belief, which has all three desired properties.

KR Conference 2018 Conference Paper

Specifying Plausibility Levels for Iterated Belief Change in the Situation Calculus

  • Toryn Q. Klassen
  • Sheila A. McIlraith
  • Hector J. Levesque

We investigate augmenting a theory of belief and actions with qualitative plausibility levels. Shapiro et al. created a framework for modeling iterated belief revision and update which integrated those features with the well-developed theory of action in the situation calculus. However, applying their technique requires associating plausibility levels with initial situations, for which no very convenient mechanism had been proposed. Schwering and Lakemeyer proposed deriving these initial plausibility levels from a set of conditionals, similarly to how models are ranked in Pearl’s System Z. However, their approach inherits some limitations of System Z. We consider alternatives, and argue that a perspicuous approach is to measure plausibility by counting the abnormalities in a situation (similarly to cardinality-based circumscription). By allowing abnormalities to change over time, we can also model changing plausibility levels in a natural and simple way, which gives us a flexible approach for handling belief change about predicted and unpredicted exogenous actions.

KR Conference 2014 Conference Paper

Decidable Reasoning in a Fragment of the Epistemic Situation Calculus

  • Gerhard Lakemeyer
  • Hector J. Levesque

further restrictions on the inference mechanism to retain decidability. The approach by Liu and Levesque (2005) restricts the representation of what holds in the current situation to literals. Such knowledge bases can then be queried efficiently using a sound but incomplete evaluation-based reasoner proposed in (Levesque 1998). When actions have only local effects, the result of an action can be represented by progressing the current knowledge base to a new set of literals. In (Claßen and Lakemeyer 2009), the restriction to literals is relaxed by allowing disjunctions in the representation of the initial situation. Queries about what holds after actions have been performed are evaluated by first regressing them to a query about the initial situation and then appealing to a logic of limited belief for static knowledge bases with disjunctions developed by Liu et al. (2004). Here a major limitation is that sensing actions cannot be dealt with. The last two approaches have in common that they separate the reasoning task into two parts: one which addresses the dynamics of actions using progression and regression, respectively, and another which deals with querying a static knowledge base using existing techniques. A downside of this separation is that certain desirable features seem to get lost. For example, it is not at all clear how to handle sensing actions in the case of (Claßen and Lakemeyer 2009). In order to avoid such limitations, we propose a new model of limited belief, which avoids the above separation by incorporating actions directly into the model. The starting point is the model of limited belief for the static case proposed in (Lakemeyer and Levesque 2013), which itself is based on (Liu et al. 2004). The general idea behind logics of limited belief is to capture, in a semantically perspicuous way, weaker forms of logical entailment. Other examples of such approaches are (Levesque 1984b; Konolige 1986; Vardi 1986; Fagin and Halpern 1988; Fagin et al. 1990; Lakemeyer 1996; Cadoli and Schaerf 1992; Delgrande 1995). In the case of (Liu et al. 2004; Lakemeyer and Levesque 2013), the semantic primitive is a setup, a possibly infinite set of ground clauses closed under unit propagation. Roughly, the clauses in a setup can be viewed as those which the agent believes explicitly. Setups are used to give meaning to a sequence of modalities Bk, for k ≥ 0, where Bk φ should be read as “φ is believed at level k. ” For example, given a clause c, B0 c is satisfied by a setup s just in case The situation calculus is a popular formalism for reasoning about actions and change. Since the language is first-order, reasoning in the situation calculus is undecidable in general. An important question then is how to weaken reasoning in a principled way to guarantee decidability. Existing approaches either drastically limit the representation of the action theory or neglect important aspects such as sensing. In this paper we propose a model of limited belief for the epistemic situation calculus, which allows very expressive knowledge bases and handles both physical and sensing actions. The model builds on an existing approach to limited belief in the static case. We show that the resulting form of limited reasoning is sound with respect to the original epistemic situation calculus and eventually complete for a large class of formulas. Moreover, reasoning is decidable.

IJCAI Conference 2013 Conference Paper

A Formal Account of Nondeterministic and Failed Actions

  • James P. Delgrande
  • Hector J. Levesque

Nondeterminism is pervasive in all but the simplest action domains: an agent may flip a coin or pick up a different object than intended, or an action may fail and may fail in different ways. In this paper we provide a qualitative theory of nondeterminism. The account is based on an epistemic extension to the situation calculus that accommodates sensing actions. Our position is that nondeterminism is an epistemic phenomenon, and that the world is most usefully regarded as deterministic. Nondeterminism arises from an agent’s limited awareness and perception. The account offers several advantages: an agent has a set of categorical (as opposed to probabilistic) beliefs, yet can deal with equallylikely outcomes (such as in flipping a fair coin) or with outcomes of differing plausibility (such as an action that may on rare occasion fail).

IJCAI Conference 2013 Conference Paper

Decidable Reasoning in a Logic of Limited Belief with Introspection and Unknown Individuals

  • Gerhard Lakemeyer
  • Hector J. Levesque

There are not very many existing logics of belief which have both a perspicuous semantics and are computationally attractive. An exception is the logic SL, proposed by Liu, Lakemeyer, and Levesque, which allows for a decidable and often even tractable form of reasoning. While the language is first-order and hence quite expressive, it still has a number of shortcomings. For one, beliefs about beliefs are not addressed at all. For another, the names of individuals are rigid, that is, their identity is assumed to be known. In this paper, we show how both shortcomings can be overcome by suitably extending the language and its semantics. Among other things, we show that determining the beliefs of a certain kind of fully introspective knowledge bases is decidable and that unknown individuals in the knowledge base can be accommodated in a decidable manner as well.

IJCAI Conference 2013 Conference Paper

Reasoning about Continuous Uncertainty in the Situation Calculus

  • Vaishak Belle
  • Hector J. Levesque

Among the many approaches for reasoning about degrees of belief in the presence of noisy sensing and acting, the logical account proposed by Bacchus, Halpern, and Levesque is perhaps the most expressive. While their formalism is quite general, it is restricted to fluents whose values are drawn from discrete countable domains, as opposed to the continuous domains seen in many robotic applications. In this paper, we show how this limitation in their approach can be lifted. By dealing seamlessly with both discrete distributions and continuous densities within a rich theory of action, we provide a very general logical specification of how belief should change after acting and sensing in complex noisy domains.

UAI Conference 2013 Conference Paper

Reasoning about Probabilities in Dynamic Systems using Goal Regression

  • Vaishak Belle
  • Hector J. Levesque

Reasoning about degrees of belief in uncertain dynamic worlds is fundamental to many applications, such as robotics and planning, where actions modify state properties and sensors provide measurements, both of which are prone to noise. With the exception of limited cases such as Gaussian processes over linear phenomena, belief state evolution can be complex and hard to reason with in a general way. This paper proposes a framework with new results that allows the reduction of subjective probabilities after sensing and acting, both in discrete and continuous domains, to questions about the initial state only. We build on an expressive probabilistic first-order logical account by Bacchus, Halpern and Levesque, resulting in a methodology that, in principle, can be coupled with a variety of existing inference solutions.

KR Conference 2012 Conference Paper

Only-Knowing Meets Nonmonotonic Modal Logic

  • Gerhard Lakemeyer
  • Hector J. Levesque

made it possible to study autoepistemic reasoning within a classical monotonic logic, leading, among other things, to an axiomatic characterization of the logic in the propositional case, and a first-order account that handles quantifying-in. In subsequent work by Lakemeyer and Levesque, henceforth called LL, [2005; 2006], only-knowing was extended to capture other forms of nonmonotonic reasoning, and in particular, the default logic (DL) proposed by Reiter [1980] and a variant of AEL due to Konolige [1988]. As described by Reiter, a default rule α: β / γ has an intuitive reading of “if α is believed and it is consistent to believe β then infer that γ is true. ” Hence Konolige proposed translating the default rule into a sentence of AEL of the form Only-knowing was originally introduced by Levesque to capture the beliefs of an agent in the sense that its knowledge base is all the agent knows. When a knowledge base contains defaults Levesque also showed an exact correspondence between only-knowing and autoepistemic logic. Later these results were extended by Lakemeyer and Levesque to also capture a variant of autoepistemic logic proposed by Konolige and Reiter’s default logic. One of the benefits of such an approach is that various nonmonotonic formalisms can be compared within a single monotonic logic leading, among other things, to the first axiom system for default logic. In this paper, we will bring another large class of nonmonotonic systems, which were first studied by McDermott and Doyle, into the only-knowing fold. Among other things, we will provide the first possible-world semantics for such systems, providing a new perspective on the nature of modal approaches to nonmonotonic reasoning. Kα ∧ Mβ ⊃ γ. is valid, which can be read as “if we only know that P (a) or P (b), then we know that something is a P, but not what. ” Levesque also showed that, when the KB itself is allowed to mention K, then O captures the autoepistemic logic (AEL) proposed by Moore [1985], in the sense that the beliefs entailed by only-knowing KB are precisely those which are in all stable expansions of KB. This connection In the simplest case, M is understood as the dual of K in the sense that Mβ stands for ¬K¬β. To properly characterize DL, however, a more complex treatment of the M is needed. Nonetheless, LL were able to present a variant of only-knowing that did the job and allowed the properties of DL to be understood in terms of an underlying model of belief in a classical monotonic logic: a model theory based on possible worlds, and later, a proof theory based on axioms and rules of inference [Lakemeyer and Levesque, 2005; 2006]. 2 In this paper, we continue this work and bring another large class of nonmonotonic systems into the only-knowing fold. We investigate the so-called nonmonotonic modal systems (NMS) first introduced by McDermott and Doyle [1980], and reconstructed by Marek et al. [1993]. Roughly speaking, an NMS starts with a classical modal system of belief (like the system K or K45 or T, in the terminology of Chellas [1980]), and declares a set of formulas to be an expansion of α in the NMS if it consists of the formulas that can be derived in the modal system from α together with the assumptions ¬Kβ for those β that cannot be derived. Marek et al. show various properties of these NMS based on a variety of modal logics, including how different modal systems λ1 and λ2 can sometimes give rise to the same NMS (that is, where the λ1 -expansions coincide with the λ2 -expansions). Copyright c 2012, Association for the Advancement of Artificial Intelligence (www. aaai. org). All rights reserved. 1 In this paper, we use the terms “knowledge” and “belief” interchangeably to mean belief. 2 We remark that other nonmonotonic logics with two distinct modalities were proposed that also capture DL such as [Lin and Shoham, 1990; Lifschitz, 1994]. See [Lakemeyer and Levesque, 2005] for a discussion how these relate to LL’s work.

IJCAI Conference 2011 Conference Paper

A Correctness Result for Reasoning about One-Dimensional Planning Problems

  • Yuxiao Hu
  • Hector J. Levesque

A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness of such generalized plans is non-trivial to define and verify, especially when it comes to whether or not a plan works for all of the infinitely many instances of the problem. In this paper, we give a precise definition of a generalized plan representation called an FSA plan, with its semantics defined in the situation calculus. Based on this, we identify a class of infinite planning problems, which we call one-dimensional (1d), and prove a correctness result that 1d problems can be verified by finite means. We show that this theoretical result leads to an algorithm that does this verification practically, and a planner based on this verification algorithm efficiently generates provably correct plans for 1d problems.

IJCAI Conference 2011 Conference Paper

Efficient Reasoning in Proper Knowledge Bases with Unknown Individuals

  • Giuseppe De Giacomo
  • Yves Lesp
  • eacute; rance
  • Hector J. Levesque

This work develops an approach to efficient reasoning in first-order knowledge bases with incomplete information. We build on Levesque's proper knowledge bases approach, which supports limited incomplete knowledge in the form of a possibly infinite set of positive or negative ground facts. We propose a generalization which allows these facts to involve unknown individuals, as in the work on labeled null values in databases. Dealing with such unknown individuals has been shown to be a key feature in the database literature on data integration and data exchange. In this way, we obtain one of the most expressive first-order open-world settings for which reasoning can still be done efficiently by evaluation, as in relational databases. We show the soundness of the reasoning procedure and its completeness for queries in a certain normal form.

IJCAI Conference 2009 Conference Paper

  • Gerhard Lakemeyer
  • Hector J. Levesque

In previous work, we proposed a modal fragment of the situation calculus called ES, which fully captures Reiter’s basic action theories. ES also has epistemic features, including only-knowing, which refers to all that an agent knows in the sense of having a knowledge base. While our model of onlyknowing has appealing properties in the static case, it appears to be problematic when actions come into play. First of all, its utility seems to be restricted to an agent’s initial knowledge base. Second, while it has been shown that only-knowing correctly captures default inferences, this was only in the static case, and undesirable properties appear to arise in the presence of actions. In this paper, we remedy both of these shortcomings and propose a new dynamic semantics of only-knowing, which is closely related to Lin and Reiter’s notion of progression when actions are performed and where defaults behave properly.

KR Conference 2008 Conference Paper

First-Order Strong Progression for Local-Effect Basic Action Theories

  • Stavros Vassos
  • Gerhard Lakemeyer
  • Hector J. Levesque

In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in the situation calculus. The idea is to replace an initial database by a new set of sentences which reflect the changes due to an action. Unfortunately, progression requires second-order logic in general. In this paper, we introduce the notion of strong progression, a slight variant of Lin and Reiter that has the intended properties, and we show that in case actions have only local effects, progression is always first-order representable. Moreover, for a restricted class of local-effect axioms we show how to construct a new database that is finite.

IJCAI Conference 2003 Conference Paper

A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases

  • Yongmei Liu
  • Hector J. Levesque

In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was sufficient to make full logical de­ duction undecidable, he also proposed an alterna­ tive reasoning scheme with desirable logical prop­ erties. He also claimed (without proof) that this reasoning could be implemented efficiently using database techniques such as projections and joins. In this paper, we substantiate this claim and show how to adapt a bottom-up database query evalu­ ation algorithm for this purpose, thus obtaining a tractability result comparable to those that exist for databases.

IJCAI Conference 1999 Conference Paper

Projection using Regression and Sensors

  • Giuseppe De Giacomo
  • Hector J. Levesque

In this paper, we consider the projection task (determining what does or does not hold after performing a sequence of actions) in a general setting where a solution to the frame problem may or may not be available, and where online information from sensors may or may not be applicable. We formally characterize the projection task for actions theories of this sort, and show how a generalized form of regression produces correct answers whenever it can be used. We characterize conditions on action theories, sequences of actions, and sensing information that are sufficient to guarantee that regression can be used, and present a provably correct regressionbased procedure in Prolog for performing the task under these conditions.

IJCAI Conference 1999 Conference Paper

Query Evaluation and Progression in AOL Knowledge Bases

  • Gerhard Lakemeyer
  • Hector J. Levesque

Recently Lakemeyer and Levesque proposed the logic AOC, which amalgamates both the situation calculus and Levesque\s logic of only knowing. While very expressive the practical relevance of the formalism is unclear because it heavily relies on second-order logic. In this paper we demonstrate that the picture is not as bleak as it may seem. In particular, we show that for large classes of AOL knowledge bases and queries, including epistemic ones, query evaluation requires first-order reasoning only. We also provide a simple semantic definition of progressing a knowledge base. For a particular class of knowledge bases, adapted from earlier results by Lin and Reiter, we show that progression is first-order representable and easy to compute.

AAAI Conference 1996 Conference Paper

What Is Planning in the Presence of Sensing?

  • Hector J. Levesque

Despite the existence of programs that are able to generate so-called conditional plans, there has yet to emerge a clear and general specification of what it is these programs are looking for: what exactly is a plan in this setting, and when is it correct? In this paper, we develop and motivate a specification within the situation calculus of conditional and iterative plans over domains that include binary sensing actions. The account is built on an existing theory of action which includes a solution to the frame problem, and an extension to it that handles sensing actions and the effect they have on the knowledge of a robot. Plans are taken to be programs in a new simple robot program language, and the planning task is to find a program that would be known by the robot at the outset to lead to a final situation where the goal is satisfied. This specification is used to analyze the correctness of a small example plan, as well as variants that have redundant or missing sensing actions. We also investigate whether the proposed robot program language is powerful enough to serve for any intuitively achievable goal.

AAAI Conference 1990 Conference Paper

On Acting Together

  • Hector J. Levesque

Joint action by a team does not consist merely of simultaneous and coordinated individual actions; to act together, a team must be aware of and care about the status of the group effort as a whole. We present a formal definition of what it could mean for a group to jointly commit to a common goal, and explore how these joint commitments relate to the individual commitments of the team members. We then consider the case of joint intention, where the goal in question involves the team performing some action. In both cases, the theory is formulated in a logical language of belief, action, and time previously used to characterize individual commitment and intention. An important consequence of the theory is the types of communication among the team members that it predicts will often be necessary.

TARK Conference 1988 Conference Paper

A Tractable Knowledge Representation Service with Full Introspection

  • Gerhard Lakemeyer
  • Hector J. Levesque

A Knowledge Representation service for a knowledge-based system (or agent) can be viewed as providing, at the very least, two operations that (a) give precise information about what is and is not believed (ASg) and (b) add new facts to the knowledge base when they become available (TELL). An appropriate model of belief for such operations should support the notion that onlycertain facts are believed, in particular those that have been added to a knowledge base via TELL. For logically omniscient and fully introspective agents, models of this kind lead to intractable ASKand TELLoperations. In this paper, we show that tractability can be retained by giving up logical omniscience, but without sacrificing full introspection. This is done within the framework of a propositional logic of belief. In particular, the logic allows us to express that onlya sentence (or finite set of them) is believed. We show that the validity of certain classes of sentences involving belief can be decided efficiently. These results are then applied to the specification of efficient TELL and ASKoperations. aFellowof The Canadian Institute for AdvancedResearch

AAAI Conference 1987 Conference Paper

All I Know: An Abridged Report

  • Hector J. Levesque

Current approaches to formalizing non-monotonic reasoning using logics of belief require new metalogical properties over sets of sentences to be defined. This research attempts to show how some of these patterns of reasoning can be captured using only the classical notions of logic (satisfiability, validity, implication). This is done by extending a logic of belief so that it is possible to say that only a certain proposition (or finite set of them) is believed. This research also extends previous approaches to handle quantifiers and equality, provides a semantic account of certain types of non-monotonicity, and through a simple proof theory, allows formal derivations to be generated.

IJCAI Conference 1985 Conference Paper

An Essential Hybrid Reasoning System: Knowledge and Symbol Level Accounts of KRYPTON

  • Ronald J. Brachman
  • Victoria Pigman Gilbert
  • Hector J. Levesque

Hybrid inference systems are an important way to address the fact that intelligent systems have muiltifaceted representational and reasoning competence. KRYPTON is an experimental prototype that competently handles both terminological and assertional knowledge; these two kinds of information are tightly linked by having sentences in an assertional component be formed using structured complex predicates denned in a complementary terminological component. KRYPTON is unique in that it combines in a completely integrated fashion a frame-based description language and a first-order resolution theorem-prover. We give here both a formal Knowledge Level view of the user interface to KRYPTON and the technical Symbol Level details of the integration of the two disparate components, thus providing an essential picture of the abstract function that KRYPTON computes and the implementation technology needed to make it work. We also illustrate the kind of complex question the system can answer.

AAAI Conference 1984 Conference Paper

A Logic of Implicit and Explicit Belief

  • Hector J. Levesque

As part of an on-going project to understand the foundations of Knowledge Representation, we are attempting to characterize a kind of belief that forms a more appropriate basis for Knowledge Representation systems than that captured by the usual possible-world formalizations begun by Hintikka. In this paper, we point out deficiencies in current semantic treatments of knowledge and belief (including recent syntactic approaches) and suggest a new analysis in the form of a logic that avoids these shortcomings and is also more viable computationally.