Abstract

In this expository paper, we discuss some applications of the paraconsistent annotated logics (PAL). PAL is a 2-sorted logic that can build a programming language allowing manipulated impreciseness, inconsistencies and paracompleteness in its interior. Also, with suitable rules, it is possible to deal with defesiable-deontic reasoning and many monotonic and non-monotonic reasoning. Also, it is useful to obtain logical frameworks for usual modal systems and in this paper we discuss aspects of them, showing the power of these logical systems.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.