Computational Aspects of Quasi-Classical Entailment
DOI10.3166/JANCL.11.295-312zbMATH Open1032.03025OpenAlexW2038349460WikidataQ126253330 ScholiaQ126253330MaRDI QIDQ4443010FDOQ4443010
Authors: Pierre Marquis, Nadège Porquet 
Publication date: 8 January 2004
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/jancl.11.295-312
Recommendations
paraconsistent logicautomated reasoningreasoning under inconsistencyquasi-classical logicquasi-classical entailmenttractable classes of formulas
Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Paraconsistent logics (03B53)
Cites Work
- Title not available (Why is that?)
- On the theory of inconsistent formal systems
- Renaming a Set of Clauses as a Horn Set
- Tractable reasoning via approximation
- Knowledge compilation and theory approximation
- A machine program for theorem-proving
- Title not available (Why is that?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Title not available (Why is that?)
- Reasoning with contradictory information using quasi-classical logic
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
- Title not available (Why is that?)
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)
