Results 1 -
7 of
7
Minimal Belief and Negation as Failure
- Artificial Intelligence
, 1994
"... Fangzhen Lin and Yoav Shoham defined a propositional nonmonotonic logic which uses two independent modal operators. One of them represents minimal knowledge, the other is related to the ideas of justification (as understood in default logic) and of negation as failure. We describe a simplified versi ..."
Abstract
-
Cited by 79 (4 self)
- Add to MetaCart
version of that system, show how quantifiers can be included in it, and study its relation to circumscription and default logic, to logic programming, and to the theory of epistemic queries developed by Hector Levesque and Ray Reiter. 1 Introduction Lin and Shoham [16] defined a propositional
On the interactions of awareness and certainty
"... Abstract. We examine the interactions of knowledge and awareness in dynamic epistemic logic. Implicit knowledge describes the things that an agent could infer from what is known, if the agent were aware of the necessary concepts. Reasoning techniques that are robust to incomplete awareness are impor ..."
Abstract
- Add to MetaCart
are important when considering interactions of automated agents in complex dynamic environments, such as the semantic web. Here we revisit Hector Levesque’s original motivation of implicit knowledge and consider several contemporary realizations of implicit knowledge. We present a framework to compare different
Compiled Only Knowing
, 2002
"... We report on a sound and complete proof system, COOL, for the propositional fragment of Hector Levesque's nonmonotonic logic `The Logic of Only Knowing' [Lev90]. The proof system is devised using the framework of compiled labelled deductive systems [BrGaRu00], which enables a translation o ..."
Abstract
- Add to MetaCart
We report on a sound and complete proof system, COOL, for the propositional fragment of Hector Levesque's nonmonotonic logic `The Logic of Only Knowing' [Lev90]. The proof system is devised using the framework of compiled labelled deductive systems [BrGaRu00], which enables a translation
1 Guest Editorial The scientific legacy of Marco Cadoli in Artificial Intelligence
"... izio Lenzerini) if I could propose a master thesis work to him. I had just finished my first course as a pro-fessor. The course was about Software Engineering and Programming Languages, and during the lectures I had noticed Marco’s outstanding performance in the course, both in the part related to S ..."
Abstract
- Add to MetaCart
the computational complexity of a logical formalism is an essential tool for characterizing the properties of the formalism itself, at that time this kind of investigation was not so common. Only recently, people like Hector Levesque, Ron Brach-man, Ray Reiter and others had started pointing out the importance
Qualitative Spatial Reasoning in Interpreting Text and Narrative. Spatial Cognition and Computation. Forthcoming
"... Simple natural language texts and narratives often raise problems in commonsense spatial knowledge and reasoning of surprising logical complexity and geometric richness. In this paper, I consider a dozen short texts — five taken from literature, the remainder contrived as illustrations — and discuss ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
keynote speech given at COSIT 2011. Thanks to Max Egenhofer and Reinhard Moratz for the invitation to speak at COSIT; and to Antony Galton, Hector Levesque, and James Pustejovsky for helpful suggestions. 1 Lauder’s definition of “aorta ” is, “the personification of the benevolently paternal welfare State
Major Subject: Computer Science
, 2005
"... Modal logics with possible worlds semantics can be used to represent mental states such as belief, goal, and intention, allowing one to formally describe the rational behavior of agents. Agent’s beliefs and goals are typically represented in these logics by primitive modal operators. However, the re ..."
Abstract
- Add to MetaCart
, the representation of agent’s intentions varies greatly between theories. Some logics characterize intention as a primitive operator, while others define intention in terms of more primitive con-structs. Taking the latter approach is a theory due to Philip Cohen and Hector Levesque, under which intentions are a
Search Problems as Model Finding
"... ABSTRACT. Arguments for logic-based knowledge representation often emphasize the primacy of entailment in reasoning, and traditional logic-based formulations of AI tasks were frequently in terms of entailment. More recently, practical progress in satisfiability-based methods has encouraged formulati ..."
Abstract
- Add to MetaCart
for such a theory. We emphasize the role of model expansion for first order logic, with extensions, in specifying NP search problems, and describe the formalization of arithmetic in this context. This paper is dedicated to Hector J. Levesque.