Automatic theorem proving in paraconsistent logics: Theory and implementation
From MaRDI portal
Recommendations
Cites work
- A Unifying View of Some Linear Herbrand Procedures
- Bilattices and the theory of truth
- Four valued semantics and the Liar
- scientific article; zbMATH DE number 4174348 (Why is no real title available?)
- scientific article; zbMATH DE number 4181307 (Why is no real title available?)
- scientific article; zbMATH DE number 4057054 (Why is no real title available?)
- scientific article; zbMATH DE number 3659568 (Why is no real title available?)
- scientific article; zbMATH DE number 3777462 (Why is no real title available?)
- scientific article; zbMATH DE number 4128792 (Why is no real title available?)
- scientific article; zbMATH DE number 3219316 (Why is no real title available?)
- scientific article; zbMATH DE number 3320385 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- On the theory of inconsistent formal systems
- Paraconsistent logic programming
- Quantitative deduction and its fixpoint theory
Cited in
(14)- A case study in automated theorem proving: Finding sages in combinatory logic
- Paraconsistent disjunctive deductive databases
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
- Automatic reasoning in paraconsistent logic
- Paraconsistent reasoning based on XML
- scientific article; zbMATH DE number 4164174 (Why is no real title available?)
- Reasoning Support for Casl with Automated Theorem Proving Systems
- The Paraconsistent Logics PJ
- scientific article; zbMATH DE number 1269574 (Why is no real title available?)
- scientific article; zbMATH DE number 2019878 (Why is no real title available?)
- scientific article; zbMATH DE number 3894495 (Why is no real title available?)
- scientific article; zbMATH DE number 7594098 (Why is no real title available?)
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
- \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
This page was built for publication: Automatic theorem proving in paraconsistent logics: Theory and implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488523)