TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic
From MaRDI portal
Publication:1332639
DOI10.1007/BF00881843zbMath0804.68135OpenAlexW1968708002MaRDI QIDQ1332639
Publication date: 12 January 1995
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00881843
theorem provinglogic programmingtableaumany-valued logicsmodel eliminationclassical logicsfour-valued logic L4non Horn reasoning with case analysisthree- valued logic L3
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Near-Horn prolog and beyond
- Non-Horn clause logic programming without contrapositives
- A simplified problem reduction format
- A sequent-style model elimination strategy and a positive refinement
- N-Prolog: An extension of Prolog with hypothetical implications. I.
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
- A comparison of three PROLOG extensions
- A Simplified Format for the Model Elimination Theorem-Proving Procedure
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic
