Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
A theory of diagnosis from first principles
Artificial Intelligence
A logical framework for default reasoning
Artificial Intelligence
General theory of cumulative inference
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Paraconsistent logic programming
Theoretical Computer Science
RI: A logic for reasoning with inconsistency
Proceedings of the Fourth Annual Symposium on Logic in computer science
A skeptical theory of inheritance in nonmonotonic semantic networks
Artificial Intelligence
Nonmonotonic reasoning: logical foundations of common sense
Nonmonotonic reasoning: logical foundations of common sense
A logic for reasoning with inconsistent knowledge
Artificial Intelligence
Default theories of Poole-type and a method for constructing cumulative versions of default logic
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Reasoning in Inconsistent Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Restricted Access Logics for Inconsistent Information
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Resource-Bounded Paraconsistent Inference
Annals of Mathematics and Artificial Intelligence
A consistency-based approach for belief change
Artificial Intelligence
Computational methods for database repair by signed formulae*
Annals of Mathematics and Artificial Intelligence
Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
ACM Transactions on Computational Logic (TOCL)
Recovering Consistency by Forgetting Inconsistency
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Resource-bounded inference from inconsistent belief bases
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
On the measure of incoherence in extended residuated logic programs
FUZZ-IEEE'09 Proceedings of the 18th international conference on Fuzzy Systems
Handling contradictions in default theories
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Reasoning under inconsistency: A forgetting-based approach
Artificial Intelligence
PLINI: a probabilistic logic program framework for inconsistent news information
Logic programming, knowledge representation, and nonmonotonic reasoning
A fault-tolerant default logic
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Introduction to inconsistency tolerance
Inconsistency Tolerance
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
On the complexity of paraconsistent inference relations
Inconsistency Tolerance
Four-Valued semantics for default logic
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Parametric properties of ideal semantics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Contributions to personalizable knowledge integration
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Policy-based inconsistency management in relational databases
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
We present a novel approach to paraconsistent reasoning, that is, toreasoning from inconsistent information. The basic idea is the following. Wetransform an inconsistent theory into a consistent one by renaming allliterals occurring in the theory. Then, we restore some of the originalcontents of the theory by introducing progressively formal equivalenceslinking the original literals to their renamings. This is done as long asconsistency is preserved. The restoration of the original contents of thetheory is done by appeal to default logic. The overall approach provides uswith a family of paraconsistent consequence relations.Our approach is semantical because it works at the level of thepropositions; it deals with the semantical link between a proposition andits negation. The approach is therefore independent of the combination ofthe connectives that are actually applied to the propositions in order toform entire formulas.