Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
An Abductive Paraconsistent Semantics – MHp
September 2013
AbPeINAP13
We present a paraconsistent abdutive semantics for extended normal logic programs, the paraconsistent minimal hypotheses semantics MHP. The MHP is a semantics of total paraconsistent models wich combines the merits of two already existing semantics: it inherits the existence property of the abductive minimal hypotheses semantics MH, which is a semantics of total models, and the property of detection of support on contradiction of the paraconsistent well-founded semantics with explicit negation WFSX, which is a semantics of partial paraconsistent models. The MHP enjoys also the property of simple relevance, which permits top-down query answering for brave reasoning purposes. Besides, the MHP lends itself to various types of skeptical and brave reasoning, which include the possibility of drawing conclusions from inconsistent models in a nontrivial way. The MHP coincides with the MH on normal logic programs, and with the WFSXP on stratified extended programs.
In proceedings
Mário Abrantes, Luís Moniz Pereira
Ricardo Rocha
Local Procs. 20th Intl. Conf. on Applications of Declarative Programming and Knowledge Management (INAP'13)
The Kiel Declarative Programming Days 2013
Christian-Albrechts-University of Kiel
Kiel, Germany
-
-
-
-
http://centria.di.fct.unl.pt/~lmp/publications/online-papers/MHp.pdf
http://www.dcc.fc.up.pt/INAP-2013/
Export formats
Mário Abrantes and Luís Moniz Pereira, An Abductive Paraconsistent Semantics – MHp, in: Ricardo Rocha (eds), Local Procs. 20th Intl. Conf. on Applications of Declarative Programming and Knowledge Management (INAP'13), The Kiel Declarative Programming Days 2013, Christian-Albrechts-University of Kiel, Kiel, Germany, (http://www.dcc.fc.up.pt/INAP-2013/), http://centria.di.fct.unl.pt/~lmp/publications/online-papers/MHp.pdf, September 2013.
Mário Abrantes and <a href="/people/members/view.php?code=6175f826202ff877fba2ad77784cb9cb" class="author">Luís Moniz Pereira</a>, <b>An Abductive Paraconsistent Semantics – MHp</b>, in: Ricardo Rocha (eds), <u>Local Procs. 20th Intl. Conf. on Applications of Declarative Programming and Knowledge Management (INAP'13)</u>, The Kiel Declarative Programming Days 2013, Christian-Albrechts-University of Kiel, Kiel, Germany, (<a href="http://www.dcc.fc.up.pt/INAP-2013/" target="_blank">url</a>), <i>http://centria.di.fct.unl.pt/~lmp/publications/online-papers/MHp.pdf</i>, September 2013.
@inproceedings {AbPeINAP13, author = {M{\'a}rio Abrantes and Lu\'{\i}s Moniz Pereira}, editor = {Ricardo Rocha}, title = {An Abductive Paraconsistent Semantics – MHp}, booktitle = {Local Procs. 20th Intl. Conf. on Applications of Declarative Programming and Knowledge Management (INAP'13)}, series = {The Kiel Declarative Programming Days 2013}, publisher = {Christian-Albrechts-University of Kiel}, address = {Kiel, Germany}, note = {http://centria.di.fct.unl.pt/~lmp/publications/online-papers/MHp.pdf}, url = {http://www.dcc.fc.up.pt/INAP-2013/}, abstract = {We present a paraconsistent abdutive semantics for extended normal logic programs, the paraconsistent minimal hypotheses semantics MHP. The MHP is a semantics of total paraconsistent models wich combines the merits of two already existing semantics: it inherits the existence property of the abductive minimal hypotheses semantics MH, which is a semantics of total models, and the property of detection of support on contradiction of the paraconsistent well-founded semantics with explicit negation WFSX, which is a semantics of partial paraconsistent models. The MHP enjoys also the property of simple relevance, which permits top-down query answering for brave reasoning purposes. Besides, the MHP lends itself to various types of skeptical and brave reasoning, which include the possibility of drawing conclusions from inconsistent models in a nontrivial way. The MHP coincides with the MH on normal logic programs, and with the WFSXP on stratified extended programs.}, keywords = {Hypotheses, Semantics, Abduction, Total Paraconsistent Model, Partial Paraconsistent Model, Paraconsistency}, month = {September}, year = {2013}, }
Publication's urls
/publications/view.php?code=ef6d5e1c5ca1d7c88ddf19ba3065b063
/publications/view.php?code=AbPeINAP13
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT