Results 151 to 160 of about 9,538 (181)
Some of the next articles are maybe not open access.
Specification of Nonmonotonic Reasoning
Journal of Applied Non-Classical Logics, 1996Two levels of description of nonmonotonic reasoning are distinguished. For these levels semantical formalizations are given. The first Level is defined semantically by the notion of belief state frame, the second Level by the notion of reasoning frame. We introduce two specification languages to describe nonmonotonic reasoning at each of the Levels: (/)
Engelfriet, J., Treur, J.
openaire +5 more sources
Nonmonotonic reasoning is sometimes simpler
Journal of Logic and Computation, 1996Traditional logic is monotonic in the sense that if we deduce a statement \(Q\) from a theory \(T\), and then add a new statement \(S\) to this theory \(T\), then \(Q\) is still deducible from the extended theory \(T + \{S\}\). However, commonsense reasoning is often nonmonotonic: e.g., \(S\) may describe an exception to a general statement from the ...
Schwarz, Grigori, Truszczynski, Miroslaw
openaire +2 more sources
Nonmonotonic reasoning, nonmonotonic logics and reasoning about change
Artificial Intelligence Review, 1990In this paper we introduce nonmonotonic reasoning and the attempts at formalizing it using nonmonotonic logics. We examine and compare the best known of these. Despite the difference in motivation and technical construction there are strong similarities between these logics which are confirmed when they are finally shown to have a common basis. Finally
openaire +1 more source
Proof-complexity results for nonmonotonic reasoning
ACM Transactions on Computational Logic, 2001It is well-known that almost all nonmonotonic formalisms have a higher worst-case complexity than classical reasoning. In some sense, this observation denies one of the original motivations of nonmonotonic systems, which was the expectation taht nonmonotonic rules should help to speed-up the reasoning process, and ...
Egly, Uwe, Tompits, Hans
openaire +1 more source
Coherence and Nonmonotonicity in Human Reasoning
Synthese, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pfeifer, Niki, Kleiter, Gernot D.
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 in Design
Journal of Computing in Civil Engineering, 1993This paper contends that structural design is a dynamic process whose best example can be found in the active, conjectural, or even vacillating reasoning involved.
openaire +1 more source
[1991] Proceedings of the 30th IEEE Conference on Decision and Control, 2002
The authors present the design principles and the development of an expert system (called FAULT.ENT) for diagnosing multiple simultaneous faults in digital circuits (from first principles) using nonmonotonic reasoning and especially the default theory developed by R. Reiter. They give a detailed presentation of the algorithm, which has been implemented
S. Tzafestas, T. Chrisiou, Y.T. Yip
openaire +1 more source
The authors present the design principles and the development of an expert system (called FAULT.ENT) for diagnosing multiple simultaneous faults in digital circuits (from first principles) using nonmonotonic reasoning and especially the default theory developed by R. Reiter. They give a detailed presentation of the algorithm, which has been implemented
S. Tzafestas, T. Chrisiou, Y.T. Yip
openaire +1 more source
Nonmonotonic Reasoning and Databases
1984A system of nonmonotonic reasoning, called subimplication, has been defined in Bossu and Siegel [1981]. In this chapter we show that it is possible to set up a logical model of databases using subimplication and two sets of stable formulas. This model allows the construction of a system for creating, updating and querying databases that is totally ...
Genevieve Bossu, Pierre Siegel
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

