Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae

@article{Arieli2007ParaconsistentRA,
  title={Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae},
  author={Ofer Arieli},
  journal={ACM Trans. Comput. Log.},
  year={2007},
  volume={8},
  pages={18}
}
We introduce a uniform approach of representing a variety ofparaconsistent nonmonotonic formalisms by quantified Booleanformulae (QBFs) in the context of multiple-valued logics. We showthat this framework provides a useful platform for capturing, in asimple and natural way, a wide range of methods for preferentialreasoning. The outcome is a subtle approach to represent theunderlying formalisms, which induces a straightforward way tocompute the corresponding entailments: By incorporatingoff-the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Introduction to Metamathematics

  • S. C. Kleene
  • Van Nostrand.
  • 1950
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…