Tableaux for logic programming with strong negation

DOI10.1007/BFb0027403zbMath1412.68030MaRDI QIDQ4610313

Seiki Akama

Publication date: 15 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Knowledge representation (68T30) Mechanization of proofs and logical operations (03B35) Logic programming (68N17)

Related Items (1)

Paraconsistent constructive logic with strong negation as a contraction-free relevant logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subformula semantics for strong negation systems
• Constructive predicate logic with strong negation and model theory
• An improved refutation system for intuitionistic predicate logic
• Curry's paradox in contractionless constructive logic
• Constructible falsity and inexact predicates
• On the Proof Method for Constructive Falsity
• Logic Programming with Strong Negation and Inexact Predicates
• Logic programming with strong negation
• A semantical study of constructible falsity
• Constructible falsity

This page was built for publication: Tableaux for logic programming with strong negation