Paper:
Language: English:

Reasoning about Dynamic Preferences in Circumscriptive Theory by Logic Programming

Toshiko Wakaki^, Ken Satoh^ and Katsumi Nitta^

Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology, 4259 Nagatsuta, Midori-ku, Yokohama 226, Japan
Division of Electronics and Information Engineering, Hokkaido University, N-13 W-8, Kita-ku, Sapporo 060, Japan
Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology, 4259 Nagatsuta, Midori-ku, Yokohama 226, Japan

Received: October 3, 1997

Accepted: November 13, 1997

Keywords: Dynamic preferences, Policy axioms, Prioritized circumscription, Extended logic programs, Answer set semantics

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.1, No.2 pp. 121-129, 1997

Abstract

To treat dynamic preferences correctly is inevitably required in legal reasoning. In this paper, we present a method which enables us to handle some class of dynamic preferences in the framework of circumscription and to consistently compute its metalevel and object-level reasoning by expressing them in an extended logic program. This is achieved on the basis of policy axioms and priority axioms which permit as to describe circumscription policy by axioms and play a role in intervening between metalevel and object-level reasoning. Not only the preference information among rules and metarules but also relations between dynamic preferences and priority axioms in circumscription are represented by a normal logic program. Thus, priorities can be derived from the preferences dynamically, which allows us to compute objectlevel circumscriptive theory using logic programming based on Wakaki and Satoh\\'s method.

[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: