Disjunctive Logic Programs with Inheritance

Simple item page
dc.creatorBuccafurri, Francesco
dc.creatorFaber, Wolfgang
dc.creatorLeone, Nicola
dc.date2001-05-30
dc.date2001-06-28
dc.date.accessioned2026-07-07T09:22:07Z
dc.date.available2026-07-07T09:22:07Z
dc.descriptionThe paper proposes a new knowledge representation language, called DLP<, which extends disjunctive logic programming (with strong negation) by inheritance. The addition of inheritance enhances the knowledge modeling features of the language providing a natural representation of default reasoning with exceptions. A declarative model-theoretic semantics of DLP< is provided, which is shown to generalize the Answer Set Semantics of disjunctive logic programs. The knowledge modeling features of the language are illustrated by encoding classical nonmonotonic problems in DLP<. The complexity of DLP< is analyzed, proving that inheritance does not cause any computational overhead, as reasoning in DLP< has exactly the same complexity as reasoning in disjunctive logic programming. This is confirmed by the existence of an efficient translation from DLP< to plain disjunctive logic programming. Using this translation, an advanced KR system supporting the DLP< language has been implemented on top of the DLV system and has subsequently been integrated into DLV.
dc.description28 pages; will be published in Theory and Practice of Logic Programming
dc.identifierhttps://arxiv.org/abs/cs/0105036
dc.identifierhttp://arxiv.org/abs/cs/0105036
dc.identifierTheory and Practice of Logic Programming 2(3):293-321, 2002
dc.identifierdoi:10.1017/S1471068402001394
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155267
dc.subjectLogic in Computer Science
dc.subjectArtificial Intelligence
dc.subjectD.1.6; I.2.3; I.2.4
dc.titleDisjunctive Logic Programs with Inheritance
dc.typetext

Files

Collections

arXiv