Quasi-Classical Model Semantics for Logic Programs --- A Paraconsistent Approach

Authors:
Zhihu Zhang;Zuoquan Lin;Shuang Ren
Affiliations:
School of Mathematical Sciences, Peking University, Beijing, China 100871;School of Mathematical Sciences, Peking University, Beijing, China 100871;School of Mathematical Sciences, Peking University, Beijing, China 100871
Venue:
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Year:
2009

Citing 11
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Paraconsistent logic programming

Theoretical Computer Science
What the lottery paradox tells us about default reasoning

Proceedings of the first international conference on Principles of knowledge representation and reasoning
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Paraconsistent logics

Handbook of defeasible reasoning and uncertainty management systems
A survey of paraconsistent semantics for logic programs

Handbook of defeasible reasoning and uncertainty management systems
Paraconsistent Declarative Semantics for Extended Logic Programs

Annals of Mathematics and Artificial Intelligence
Disjunctive Logic Programming: A Survey and Assessment

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Paraconsistent Logic Programs

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Distance-based paraconsistent logics

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new paraconsistent approach to logic programming, called Quasi-classical (QC for short) model semantics. The basic idea is the following. We define the QC base as a set of all atoms and their complements, which decouples the link between an atom and its complement at the level of interpretation. Then we define QC models for positive logic programs. The QC model semantics actually effecting on disjunctive programs imposes the link between each disjunction occurring in the head of a rule and its complement disjunct. This enhances the ability of paraconsistent reasoning. We also define weak satisfaction to perform reasoning under our approach. The fixpoint semantics with respect to the QC model semantics is also presented in the paper.