Proving quantified literals in defeasible logic

Authors:
David Billington
Affiliations:
-
Venue:
Information Sciences: an International Journal
Year:
1999

Citing 6
Cited 0

Defeasible reasoning and decision support systems

Decision Support Systems
Unification revisited

Foundations of deductive databases and logic programming
Controlling expert system recommendations with defeasible logic

Decision Support Systems
Nonmonotonic reasoning: logical foundations of common sense

Nonmonotonic reasoning: logical foundations of common sense
Defeasible logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Prolog programming in depth

Prolog programming in depth

Quantified Score

Hi-index	0.07

Visualization

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.