Journal of Logic Programming
Journal of Logic Programming
A logical analysis of modules in logic programming
Journal of Logic Programming
Paraconsistent logic programming
Theoretical Computer Science
Proceedings of the Fourth Annual Symposium on Logic in computer science
Logic programming with strong negation
Proceedings of the international workshop on Extensions of logic programming
Bilattices and the semantics of logic programming
Journal of Logic Programming
Combining explicit negation and negation by failure via Belnap's logic
Selected papers from the international workshop on Uncertainty in databases and deductive systems
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
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
Gentzen-type systems and resolution rules. Part I. Propositional logic
COLOG '88 Proceedings of the International Conference on Computer Logic
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Tableaux for Logic Programming with Strong Negation
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Combining Soft Linear Logic and Spatio-temporal Operators
Journal of Logic and Computation
Hi-index | 0.00 |
An extended first-order predicate sequent calculus PLK with two kinds of negation is introduced as a basis of a new resolution calculus PRC (paraconsistent resolution calculus) for handling the property of paraconsistency. Herbrand theorem, completeness theorem (with respect to a classical-like semantics) and cut-elimination theorem are proved for PLK. The correspondence between PLK and PRC is shown by using a faithful embedding of PLK into the sequent calculus LK for classical logic.