Results 141 to 150 of about 474 (178)
Some of the next articles are maybe not open access.
Nonmonotonic inheritance reasoning in classifiers
Proceedings 1993 The First New Zealand International Two-Stream Conference on Artificial Neural Networks and Expert Systems, 2002The authors investigate the significance of classifier systems with respect to nonmonotonic inheritance reasoning by constructing a simple classifier system. The experiments show that classifier systems can perform useful inheritance reasoning and may be a viable alternative to expert systems when dealing with potentially nonmonotonic environments. >
Alex Young, Abdul Sattar 0001
openaire +1 more source
Worlds of knowing and nonmonotonic reasoning
IEEE Transactions on Systems, Man, and Cybernetics, 1989The project of formalizing nonmonotonic reasoning on the basis of historical and contemporary philosophical reflections on reasoning and knowing is examined. Some paradigmatic accounts of the prospects of formalizing reasoning, from the ancient beginnings of western epistemology up to contemporary debate about the reasonableness of scientific ...
openaire +1 more source
On Császár's condition in nonmonotonic reasoning. [PDF]
, 2004 Csaszar’s condition is a well-known property introduced about 50 years ago in the axiomatic theory of conditional probability. In recent years such condition has been reconsidered by some authors, who have studied its role in the coherence-based approach to conditional probability. In this paper we consider the probabilistic entailment of a conditional
openaire +2 more sources
Formalizing nonmonotonic reasoning systems
Artificial Intelligence, 1987The paper addresses the problem of existence of expansions of semi-normal default theories introduced by \textit{R. Reiter} [ibid. 13, 81-132 (1980; Zbl 0435.68069)]. Semi-normal default theory \(\Delta\) is defined as (D,W), where W is a set of first-order formulae, and D is a set of semi- normal defaults, i.e. rules of inference having the form: (*)\
openaire +1 more source
Nonmonotonic reasoning by inhibition nets
Artif. Intell., 2001In this paper we show that certain networks called `inhibition nets' may be regarded as cognitive agents drawing nonmonotonic inferences. It is proved that the system CL (introduced by KLM in Artificial Intelligence 44, 186-189 (1990)) of nonmonotonic logic is both sound and complete with respect to the inferences drawn by finite hierarchical ...
openaire +2 more sources
Nonmonotonic reasoning and logic programming
Knowledge-Based Systems, 1990Inference methods in knowledge-based systems are presented which are used for inferencing from incomplete information or in systems that model actions, i.e. systems that describe a time-varying world. In such cases, one is faced with nonmonotonic types of derivation when new information can lead to a revision of some statements accepted earlier.
openaire +1 more source
Strong Explanations for Nonmonotonic Reasoning
2019The ability to generate explanations for inferences drawn from a knowledge base is of utmost importance for intelligent systems. A central notion in this context are minimal subsets of the knowledge base entailing a certain formula. Such subsets are often referred to as justifications, and their identification is called axiom pinpointing.As observed by
Gerhard Brewka, Markus Ulbricht 0001
openaire +1 more source
Annual Review of Computer Science, 1987
Michael R. Genesereth, Nils J. Nilsson
openaire +2 more sources
Michael R. Genesereth, Nils J. Nilsson
openaire +2 more sources
Nonmonotonic reasoning formalizations and implementations
1987This paper presents the most influential formalizations of nonmonotonic reasoning: McDermott and Doyle's Nonmonotonic Logic I, Reiter's Default Logic, and McCarthy's Circumscription. Unfortunately all these formalizations are not semidecidable. In consequence implementations of nonmonotonic systems either must give up the idea of theoremhood and ...
openaire +1 more source