Results 151 to 160 of about 9,610 (197)
Some of the next articles are maybe not open access.

Proof-complexity results for nonmonotonic reasoning

ACM Transactions on Computational Logic, 2001
It 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, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pfeifer, Niki, Kleiter, Gernot D.
openaire   +2 more sources

Formalizing nonmonotonic reasoning systems

Artificial Intelligence, 1987
The 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, 1993
This 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

Multifault diagnosis of digital systems using nonmonotoning reasoning (for nonmonotoning read nonmonotonic)

[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

Nonmonotonic Reasoning and Databases

1984
A 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

Nonmonotonic Reasoning

Annual Review of Computer Science, 1987
Michael R. Genesereth, Nils J. Nilsson
openaire   +2 more sources

Nonmonotonic reasoning in FLORID

1997
The advantages of [[Florid]] as a deductive object-oriented database system are the rich object-oriented modeling facilities of its language F-logic. The focus of this paper is on [[Florid's]] multiple inheritance mechanism which turns out to be a useful means to adapt various examples of nonmonotonic reasoning in the object-oriented setting.
openaire   +1 more source

Nonmonotonic reasoning

Artificial Intelligence Review, 1990
Francesco Donini   +4 more
openaire   +2 more sources

Nonmonotonic reasoning and logic programming

Knowledge-Based Systems, 1990
Inference 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

Home - About - Disclaimer - Privacy