Results 1 
5 of
5
Adventure Games: A Challenge for Cognitive Robotics
 IN AAAI 2002 WORKSHOP ON COGNITIVE ROBOTICS
, 2002
"... This paper presents a set of challenges for cognitive robotics in the context of a textbased adventure game. Games in this class have many challenging properties for cognitive robotics, including incompletely specified goals, an environment revealed only through exploration, actions whose preco ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
This paper presents a set of challenges for cognitive robotics in the context of a textbased adventure game. Games in this class have many challenging properties for cognitive robotics, including incompletely specified goals, an environment revealed only through exploration, actions whose preconditions and effects are not known a priori, and the need of commonsense knowledge for determining what actions are likely to be available or effective. These qualities require an agent that is able to use commonsense knowledge, make assumptions about unavailable knowledge, revise its beliefs, and learn what actions are appropriate. At the same time, more traditional robotics problems arise, including sensing, object classification, focusing on relevant features on a situation, reasoning within context, and decisionmaking, all within a large state space. In this paper we introduce the game and its environment, elaborate upon the properties of both as they pertain to cognitive robotics, and argue that this is a highly advantageous venue for exploring cognitive robotics issues.
A Causal Theory of Abduction
 in "7th Int. Symposium on Logical Formalizations of Common Sense Reasoning
"... The paper provides a uniform representation of abductive reasoning in the logical framework of causal inference relations. The representation covers in a single framework not only traditional, ‘classical ’ forms of abduction, but also abductive reasoning in diagnosis, theories of actions and change, ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The paper provides a uniform representation of abductive reasoning in the logical framework of causal inference relations. The representation covers in a single framework not only traditional, ‘classical ’ forms of abduction, but also abductive reasoning in diagnosis, theories of actions and change, and abductive logic programming. 1
Complexity of nested circumscription and nested abnormality theories
 ACM Transactions on Computational Logic
, 2005
"... Circumscription has been recognized as an important principle for knowledge representation and commonsense reasoning. The need for a circumscriptive formalism that allows for simple yet elegant modular problem representation has led Lifschitz (AIJ, 1995) to introduce nested abnormality theories (NA ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Circumscription has been recognized as an important principle for knowledge representation and commonsense reasoning. The need for a circumscriptive formalism that allows for simple yet elegant modular problem representation has led Lifschitz (AIJ, 1995) to introduce nested abnormality theories (NATs) as a tool for modular knowledge representation, tailored for applying circumscription to minimize exceptional circumstances. Abstracting from this particular objective, we propose LCIRC, which is an extension of generic propositional circumscription by allowing propositional combinations and nesting of circumscriptive theories. As shown, NATs are naturally embedded into this language, and are in fact of equal expressive capability. We then analyze the complexity of LCIRC and NATs, and in particular the effect of nesting. The latter is found to be a source of complexity, which climbs the Polynomial Hierarchy as the nesting depth increases and reaches PSPACEcompleteness in the general case. We also identify meaningful syntactic fragments of NATs which have lower complexity. In particular, we show that the generalization of Horn circumscription in the NAT framework remains coNPcomplete, and that Horn NATs without fixed letters can be efficiently transformed into an equivalent Horn CNF, which implies polynomial solvability of principal reasoning tasks. Finally, we also study extensions of NATs and briefly address the complexity in the firstorder case. Our results give insight into the “cost ” of using LCIRC (resp. NATs) as a host language for expressing other formalisms such as action theories, narratives, or spatial theories.
M.: Automatabased abduction for tractable diagnosis
 In: Proceedings of the DL Home 23rd International Workshop on Description Logics
, 2010
"... Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its inherent computational complexity. This paper presents a novel, tractable abduction procedure for the lightweight descri ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its inherent computational complexity. This paper presents a novel, tractable abduction procedure for the lightweight description logic EL. The proposed approach extends recent research on automatabased axiom pinpointing (which is in some sense dual to our problem) by assuming information from a predefined abducible part of the domain model if necessary, while the remainder of the domain is considered to be fixed. Our research is motivated by the need for efficient diagnostic reasoning for largescale industrial systems where observations are partially incomplete and often sparse, but nevertheless the largest part of the domain such as physical structures is known. Technically, we introduce a novel patternbased definition of abducibles and show how to construct a weighted automaton that commonly encodes the definite and abducible part of the domain model. We prove that its behavior provides a compact representation of all possible hypotheses explaining an observation, and is in fact computable in PTime. 1
Abduction in Annotated Probabilistic Temporal Logic ∗
"... Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn) rules of the form “formula G becomes true K time units after formula F became true with L to U % probability. ” In this paper, we develop a theory of abduc ..."
Abstract
 Add to MetaCart
Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn) rules of the form “formula G becomes true K time units after formula F became true with L to U % probability. ” In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Π, a set of formulas H that can be “added ” to Π, and a goal G, is there a subset S of H such that Π ∪ S is consistent and entails the goal G? In this paper, we study the complexity of the Basic APT Abduction Problem (BAAP). We then leverage a geometric characterization of BAAP to suggest a set of pruning strategies when solving BAAP and use these intuitions to develop a sound and complete algorithm.