The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - February (1994 vol.6)
pp: 57-63
ABSTRACT
<p>Nonmonotonic logic is intended to apply specifically to situations where the initial information is incomplete. Using nonmonotonic reasoning procedures we shall be able to jump to conclusions, but withdraw them later when we gain additional information. A number of nonmonotonic logics have been introduced and widely discussed. Nonmonotonic logics tend to be introduced proof theoretically, and little attention is paid to their semantic characteristics or their computational tractability. We address both of these issues by presenting a nonmonotonic logic for the Herbrand subset of first-order predicate logic. This nonmonotonic logic is shown to be both sound and complete. Theories formulated in this logic can be executed in logic programming fashion.</p>
INDEX TERMS
nonmonotonic reasoning; logic programming; formal logic; computationally tractable nonmonotonic logic; incomplete information; nonmonotonic reasoning procedures; proof theoretically; semantic characteristics; Herbrand subset; first-order predicate logic; logic programming; knowledge representation; reasoning
CITATION
T.J. Weigert, J.J.-P. Tsai, "A Computationally Tractable Nonmonotonic Logic", IEEE Transactions on Knowledge & Data Engineering, vol.6, no. 1, pp. 57-63, February 1994, doi:10.1109/69.273025
533 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool