Fujipress Home | Search | About FINDER

Paper:
Language: English:

A Recursively Axiomatizable Subsystem of Levesque\'s Logic of Only Knowing


Ho Ngoc Duc


Institute for Information Systems, University of Luebeck, Ratzeburger Allee 160, 23562 Luebeck, Germany


Received: August 26, 2003

Accepted: September 1, 2003


Keywords: only-knowing, non-monotonic reasoning, knowledge representation

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.7, No.3 pp. 283-288, 2003

Abstract



A complete, recursive axiomatization of a subsystem of Levesque\'s only-knowing logic is given. The sublogic is obtained by relaxing some of Levesque\'s semantic conditions while keeping the most important definitions unchanged. The axiom system is obtained by adding an axiom of Humberstone to a subset of the set of Levesque\'s axioms. The completeness result is proved using the subordination method of Hughes and Cresswell.
preview Preview (PDF)  full text Full Text (PDF 3984KB)

Reference

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here:

adobe reader

Terms and Conditions | Privacy Policy | Recruit | Advertising Information | Contact Us