## An Encompassing Framework for Paraconsistent Logic Programs (2003)

### Cached

### Download Links

- [centria.di.fct.unl.pt]
- [centria.fct.unl.pt]
- DBLP

### Other Repositories/Bibliography

Venue: | J. Applied Logic |

Citations: | 9 - 5 self |

### BibTeX

@ARTICLE{Alcantara03anencompassing,

author = {Joao Alcantara and Carlos Viegas Damasio and Luis Moniz Pereira},

title = {An Encompassing Framework for Paraconsistent Logic Programs},

journal = {J. Applied Logic},

year = {2003},

volume = {3},

pages = {67--95}

}

### OpenURL

### Abstract

We propose a framework which extends Antitonic Logic Programs [13] to an arbitrary complete bilattice of truth-values, where belief and doubt are explicitly represented. Inspired by Ginsberg and Fitting 's bilattice approaches, this framework allows a precise de nition of important operators found in logic programming, such as explicit and default negation. In particular, it leads to a natural semantical integration of explicit and default negation through the Coherence Principle [38], according to which explicit negation entails default negation. We then de ne Coherent Answer Sets, and the Paraconsistent Well-founded Model semantics, generalising many paraconsistent semantics for logic programs. In particular, Paraconsistent Well-Founded Semantics with eXplicit negation (WFSXp ) [3, 11]. The framework is an extension of Antitonic Logic Programs for most cases, and is general enough to capture Probabilistic Deductive Databases, Possibilistic Logic Programming, Hybrid Probabilistic Logic Programs, and Fuzzy Logic Programming. Thus, we have a powerful mathematical formalism for dealing simultaneously with default, paraconsistency, and uncertainty reasoning. Results are provided about how our semantical framework deals with inconsistent information and with its propagation by the rules of the program.