Proving quantified literals in defeasible logic

https://doi.org/10.1016/S0020-0255(98)10093-2Get rights and content

Abstract

Defeasible Logic is a nonmonotonic reasoning approach which has an efficient implementation. Currently Defeasible Logic can only prove ground literals. We describe a version of Defeasible Logic which is capable of proving existentially and universally closed literals, as well as ground literals. The intuition motivating the formalism is presented, and some of its properties are proved. We also discuss and justify the claim that existentially and universally closed literals can be proved.

References (16)

There are more references available in the full text version of this article.

Cited by (0)

1

Fax: +61 7 3875 5051

View full text