Abstract
Defeasible logic is an efficient non-monotonic logic for defea- sible reasoning. It is defined through a proof theory, and has no model theory. In this paper a denotational semantics is given for defeasible logic, as a step towards a full model theory. The logic is sound and complete wrt this semantics, but the semantics is not completely satisfactory as a model theory. We indicate directions for research that might resolve these issues.
Cite
CITATION STYLE
Maher, M. J. (2000). A denotational semantics of defeasible logic. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 1861, pp. 209–222). Springer Verlag. https://doi.org/10.1007/3-540-44957-4_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
