Abstract
We present a theory that copes with the dynamics of inconsistent information. A method is set forth to represent possibly inconsistent information by a finite state. Next, finite operations for expansion and contraction of finite states are given. No extra-logical element — a choice function or an ordering over (sets of) sentences — is presupposed in the definition of contraction. Moreover, expansion and contraction are each other's duals. AGM-style characterizations of these operations follow.
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 callDisclaimer: 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.
