Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Defeasible logic

From Wikipedia, the free encyclopedia
Non-monotonic logic of strict, defeasible rules and undercutting defeaters

Defeasible logic is anon-monotonic logic proposed byDonald Nute to formalizedefeasible reasoning. In defeasible logic, there are three different types of propositions:

strict rules
specify that a fact is always a consequence of another;
defeasible rules
specify that a fact is typically a consequence of another;
undercutting defeaters
specify exceptions to defeasible rules.

A priority ordering over the defeasible rules and the defeaters can be given. During the process of deduction, the strict rules are always applied, while a defeasible rule can be applied only if no defeater of a higher priority specifies that it should not.

See also

[edit]

References

[edit]
  • D. Nute (1994). Defeasible logic. InHandbook of logic in artificial intelligence and logic programming, volume 3: Nonmonotonic reasoning and uncertain reasoning, pages 353–395. Oxford University Press.
  • G. Antoniou, D. Billington, G. Governatori, and M. Maher (2001). Representation results for defeasible logic.ACM Transactions on Computational Logic, 2(2):255–287.


Stub icon

Thislogic-related article is astub. You can help Wikipedia byexpanding it.

Stub icon

Thisartificial intelligence-related article is astub. You can help Wikipedia byexpanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Defeasible_logic&oldid=1088379429"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp