Defeasible logic

Encyclopedia : D : DE : DEF : Defeasible logic

---

Defeasible logic is a non-monotonic logic proposed by Donald Nute to formalize defeasible reasoning. In defeasible logic, there are three different types of propositions:

hard rules

specify that a fact is always consequence of another;

defeasible rules

specify that a fact is typically consequence of another;

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 hard rules are always applied, while a defeasible rule can be applied only if no defeater of an higher priority specifies that it should not.

See also

• Common sense
• Non-monotonic logic
• Default logic
• Defeasible reasoning

References

• D. Nute (1994). Defeasible logic. In Handbook 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.

 

---

From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.

Search Titles

0

1

2

3

4

5

6

7

8

9

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

?