Results 1  10
of
446
Another perspective on Default Reasoning
 Ann. Math. Artif. Intell
, 1992
"... The lexicographic closure of any given finite set D of normal defaults is defined. A conditional assertion a b is in this lexicographic closure if, given the defaults D and the fact a, one would conclude b. The lexicographic closure is essentially a rational extension of D, and of its rational ..."
Abstract

Cited by 98 (0 self)
 Add to MetaCart
The lexicographic closure of any given finite set D of normal defaults is defined. A conditional assertion a b is in this lexicographic closure if, given the defaults D and the fact a, one would conclude b. The lexicographic closure is essentially a rational extension of D, and of its rational
A Deductive System for Nonmonotonic Reasoning
 In
, 1997
"... Abstract. Disjunctive Deductive Databases (DDDBs) functionfree disjunctive logic programs with negation in rule bodies allowed have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research as been spent on issues like semantics and comple ..."
Abstract

Cited by 109 (21 self)
 Add to MetaCart
Abstract. Disjunctive Deductive Databases (DDDBs) functionfree disjunctive logic programs with negation in rule bodies allowed have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research as been spent on issues like semantics
Optimising Tableaux Decision Procedures For Description Logics
, 1997
"... DLs form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description language is formally defined, so that the subsumption relationship between two concept descriptions can be computed by a suitable algorithm. D ..."
Abstract

Cited by 122 (22 self)
 Add to MetaCart
soundness and completeness. The wide range of novel and adapted optimisation techniques employed by FaCT is also described and their effectiveness is evaluated by extensive empirical testing using both a large realistic knowledge base (from the GALEN project) and randomly generated satisfiability problems
Skeptical Rational Extensions
, 1995
"... In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justifications are never used together in constructing a set of default consequences of a theory; (2) the reasoning formalized by our logic is related to the traditional ske ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
skeptical mode of default reasoning. Our logic is based on the concept of a skeptical rational extension. We give characterization results for skeptical rational extensions and an algorithm to compute them. We present some complexity results. Our main goal is to characterize cases when the class
Process And Policy: ResourceBounded NonDemonstrative Reasoning
, 1993
"... This paper investigates the appropriateness of formal dialectics as a basis for nonmonotonic reasoning and defeasible reasoning that takes computational limits seriously. Rules that can come into conflict should be regarded as policies, which are inputs to deliberative processes. Dialectical protoc ..."
Abstract

Cited by 98 (4 self)
 Add to MetaCart
reasoning; the review of logics of dialogue and proposed extensions; and the preformal and initial formal discussion of aspects and variations of dialectical systems with nondemonstrative reasons. 1. ARGUMENTS AND DEMONSTRATION
Preferential reasoning for modal logics
 Electronic Notes in Theoretical Computer Science, 278:55–69, 2011. Proc. of the Workshop on Methods for Modalities
"... Modal logic is the foundation for a versatile and wellestablished class of knowledge representation formalisms in artificial intelligence. Enriching modal logics with nonmonotonic reasoning capabilities such as preferential reasoning as developed by Lehmann and colleagues would therefore constitu ..."
Abstract

Cited by 13 (11 self)
 Add to MetaCart
Modal logic is the foundation for a versatile and wellestablished class of knowledge representation formalisms in artificial intelligence. Enriching modal logics with nonmonotonic reasoning capabilities such as preferential reasoning as developed by Lehmann and colleagues would therefore
Programming Rational Agents in a Modal Action Logic
 Annals of Mathematics and Artificial Intelligence, Special issue on LogicBased Agent Implementation
, 2004
"... Abstract. In this paper we describe a language for reasoning about actions that can be used for modelling and for programming rational agents. We propose a modal approach for reasoning about dynamic domains in a logic programming setting. Agent behavior is specified by means of complex actions which ..."
Abstract

Cited by 36 (30 self)
 Add to MetaCart
Abstract. In this paper we describe a language for reasoning about actions that can be used for modelling and for programming rational agents. We propose a modal approach for reasoning about dynamic domains in a logic programming setting. Agent behavior is specified by means of complex actions
Logical Omniscience and Rational Belief
, 1999
"... To what extent is the logic of rational belief an extension of classical logic? Bayesians explicate the notion of rational belief via the theory of subjective probability, and the axioms of probability imply that logical truths (respectively falsehoods) are given probability 1 (respectively 0), s ..."
Abstract
 Add to MetaCart
To what extent is the logic of rational belief an extension of classical logic? Bayesians explicate the notion of rational belief via the theory of subjective probability, and the axioms of probability imply that logical truths (respectively falsehoods) are given probability 1 (respectively 0
Semantics For Constrained And Rational Default Logics
, 2001
"... The default nonmonotonic reasoning was formalised by a class of logical systems: default logics (classical, justified, constrained, rational), based on the same syntax which utilises nonmonotonic inference rules: defaults, but with diffent semantics for the defaults. In this paper we introduce a uni ..."
Abstract
 Add to MetaCart
The default nonmonotonic reasoning was formalised by a class of logical systems: default logics (classical, justified, constrained, rational), based on the same syntax which utilises nonmonotonic inference rules: defaults, but with diffent semantics for the defaults. In this paper we introduce a
A Logic for Reasoning about Rational Agents: Yet Another Attempt
"... Abstract. We propose a new version of ATLP (“ATL with plausibility”), a logic for reasoning about the outcome of rational play in gamelike scenarios. Unlike in [8], where two different extensions of ATL were used for specifying rationality and reasoning about agents ’ behavior, we now propose that ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We propose a new version of ATLP (“ATL with plausibility”), a logic for reasoning about the outcome of rational play in gamelike scenarios. Unlike in [8], where two different extensions of ATL were used for specifying rationality and reasoning about agents ’ behavior, we now propose
Results 1  10
of
446