Computational Aspects of Quasi-Classical Entailment
From MaRDI portal
Publication:4443010
Recommendations
Cites work
- scientific article; zbMATH DE number 3986613 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1198948 (Why is no real title available?)
- A machine program for theorem-proving
- Knowledge compilation and theory approximation
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- On the theory of inconsistent formal systems
- Reasoning with contradictory information using quasi-classical logic
- Renaming a Set of Clauses as a Horn Set
- Tractable reasoning via approximation
Cited in
(7)- Reasoning with contradictory information using quasi-classical logic
- Quasi-classical description logic
- Quasi-classical reasoning in paraconsistent databases
- Inconsistency-tolerant reasoning with OWL DL
- On quasi-inconsistency and its complexity
- An Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics
- scientific article; zbMATH DE number 1844496 (Why is no real title available?)
This page was built for publication: Computational Aspects of Quasi-Classical Entailment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443010)