2002/07/25 by Michael J. Maher, Maher, Michael J.
Computer Science · #Advanced Algebra and Logic #F.4.1 #FOS: Computer and information sciences #I.2.3 #I.2.4 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0207086
14 pages. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/)
arxiv created 2002/07/25 · openalex publication_date 2002/07/25 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Defeasible logic is an efficient logic for defeasible reasoning. It is defined through a proof theory and, until now, has had no model theory. In this paper a model-theoretic semantics is given for defeasible logic. The logic is sound and complete with respect to the semantics. We also briefly outline how this approach extends to a wide range of defeasible logics.