A possibilistic intuitionistic logic

Authors:
Oscar Estrada;José Arrazola;Mauricio Osorio
Affiliations:
Benemérita Universidad Autónoma de Puebla;Benemérita Universidad Autónoma de Puebla;Universidad de las Américas - Puebla
Venue:
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
Year:
2010

Citing 11
Cited 0

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Equivalence in Answer Set Programming

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Characterization of strongly equivalent logic programs in intermediate logics

Theory and Practice of Logic Programming
Possibilistic uncertainty handling for answer set programming

Annals of Mathematics and Artificial Intelligence
Ground Nonmonotonic Modal Logic S5: New Results

Journal of Logic and Computation
Introduction to Mathematical Logic

Introduction to Mathematical Logic
Possibilistic Well-Founded Semantics

MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Pstable semantics for possibilistic logic programs

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define what we call "Possibilistic Intuitionistic Logic (PIL)"; We present results analogous to those of the well-known intuitionistic logic, such as a Deduction Theorem, a Generalized version of the Deduction Theorem, a Cut Rule, a weak version of a Refutation Theorem, a Substitution Theorem and Glivenko's Theorem.