On the measure of incoherence in extended residuated logic programs

Authors:
Nicolás Madrid;Manuel Ojeda-Aciego
Affiliations:
School of Computer Science, University of Málaga, Málaga, Spain;School of Computer Science, University of Málaga, Málaga, Spain
Venue:
FUZZ-IEEE'09 Proceedings of the 18th international conference on Fuzzy Systems
Year:
2009

Citing 11
Cited 1

Properties of measures of information in evidence and possibility theories

Fuzzy Sets and Systems
A logic-based theory of deductive arguments

Artificial Intelligence
Signed Systems for Paraconsistent Reasoning

Journal of Automated Reasoning
Logic Programs for Querying Inconsistent Databases

PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Quasi-classical Logic: Non-trivializable classical reasoning from incosistent information

ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
A Logical Framework for Querying and Repairing Inconsistent Databases

IEEE Transactions on Knowledge and Data Engineering
Meta Many-Valued Logic Programming for Incomplete and Locally Inconsistent Databases

IDEAS '04 Proceedings of the International Database Engineering and Applications Symposium
A paraconsistent logic programming approach for querying inconsistent databases

International Journal of Approximate Reasoning
Distance-based paraconsistent logics

International Journal of Approximate Reasoning
Towards a Fuzzy Answer Set Semantics for Residuated Logic Programs

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Introduction to inconsistency tolerance

Inconsistency Tolerance

A core language for fuzzy answer set programming

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we continue analyzing the introduction of negation into the framework of residuated logic programming [18], [19]; specifically, we focus on extended programs, in which strong negation is introduced. The classical approach to extended logic programs consists in considering negated literals as new, independent, ones and, then apply the usual monotonic approach (based on the fix-point semantics and the TP operator); if the least fix-point so obtained is inconsistent, then the approach fails and no meaning is attached to the program. This paper introduces several approaches to considering consistence (under the term coherence) into a fuzzy setting, and studies some of their properties.