Mostra el registre d'ítem simple

dc.contributor.authorConfalonieri, Roberto
dc.contributor.authorPrade, Henri
dc.contributor.authorNieves Sánchez, Juan Carlos
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2011-12-12T12:05:28Z
dc.date.available2011-12-12T12:05:28Z
dc.date.created2011
dc.date.issued2011
dc.identifier.citationConfalonieri, R.; Prade, H.; NIEVES, J. C. Handling exceptions in logic programming without negation as failure. A: European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty. "11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty". Belfast: Springer, 2011, p. 509-520.
dc.identifier.isbn978-3-642-22151-4
dc.identifier.urihttp://hdl.handle.net/2117/14218
dc.description.abstractDefault rules, i.e. statements of the form normally a’s are b’s, are usually handled in Answer Set Programming by means of negation as failure which provides a way to capture exceptions to normal situations. In this paper we propose another approach which offers an operational counterpart to negation as failure, and which may be thought as a corresponding dual attitude. The approach amounts to an explicit rewriting of exceptions in default rules, together with the addition of completion rules that are consistent with current knowledge. It is shown that the approach can be applied to restore the consistency of inconsistent programs that implicitly involve specificity ordering between the rules. The approach is compared to previous works aiming at providing support to the rewriting of default rules. It is also shown how the proposed approach agrees with the results obtained in the classical way.
dc.format.extent12 p.
dc.language.isoeng
dc.publisherSpringer
dc.subjectÀrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
dc.subject.lcshDeclarative programming
dc.titleHandling exceptions in logic programming without negation as failure
dc.typeConference report
dc.subject.lemacProgramació declarativa
dc.contributor.groupUniversitat Politècnica de Catalunya. KEMLG - Grup d'Enginyeria del Coneixement i Aprenentatge Automàtic
dc.identifier.doi10.1007/978-3-642-22152-1_43
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.springerlink.com/content/1852k446u8608114/
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac8783296
dc.description.versionPostprint (published version)
local.citation.authorConfalonieri, R.; Prade, H.; NIEVES, J. C.
local.citation.contributorEuropean Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
local.citation.pubplaceBelfast
local.citation.publicationName11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
local.citation.startingPage509
local.citation.endingPage520


Fitxers d'aquest items

Imatge en miniatura

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple