Titlebook: Non-Monotonic Reasoning; 2nd International Wo M. Reinfrank,J. Kleer,E. Sandewall Conference proceedings 1989 Springer-Verlag Berlin Heidelb

娘娘腔

越自我

Compiling circumscriptive theories into logic programs,an be sometimes transformed into a logic program II, so that, by running II, we can determine whether a given ground literal is provable in .. The method is applicable, in particular, to some formalizations of tree-structured inheritance systems with exceptions.

反復(fù)拉緊

A circumscriptive theorem prover,lt reasoning. In this paper, we show that these ideas can also be used to construct a theorem prover for a wide class of circumscriptive theories..The ideas to be discussed have been implemented, and the resulting system has been applied to the canonical birds flying example, to a non-separable circ

難取悅

不適當(dāng)

RECUR

An extended basic ATMS,ses . contexts simultaneously, but allows monotonic justifications only. The attempt to introduce non-monotonic justifications and defaults at higher levels of the system [de Kleer 86b] failed..We propose to integrate a new kind of node into the ATMS that allows the encoding of non-monotonic justifi

廣口瓶

A nonmonotonic logic for reasoning about speech acts and belief revision,ents. This process of attitude revision is an interesting domain for the application of nonmonotonic reasoning because speech acts have a conventional aspect that is readily represented by defaults, but that interacts with an agent‘s beliefs and intentions in many complex ways that may override the

neutralize

LARK

委托