On the basis of Reiter’s default theory and Zhang Mingyi’s auto compatible default theory, a research on the characters of clausal default theory, especially the closed auto compatible default theory, is carried out...On the basis of Reiter’s default theory and Zhang Mingyi’s auto compatible default theory, a research on the characters of clausal default theory, especially the closed auto compatible default theory, is carried out. First, the theorem of monotonicity with extension number is presented. Second, the proof theory of normal default theory on auto compatible default theory is extended. Some important results are proposed.展开更多
In this paper sonic propertics of belief logic arc studied. Under a detinition of belief entail the belief logic is nonnlonotonic. Several necessary and sufficient conditions of monotony for belief logic are given. A ...In this paper sonic propertics of belief logic arc studied. Under a detinition of belief entail the belief logic is nonnlonotonic. Several necessary and sufficient conditions of monotony for belief logic are given. A default theory corresponds to a belief theory by using a bclicf opcrator. It is porved that an extension to a default theory is exactly a set of an Cntailnlents ofa belief fornirlula in the corresponding belief theory. Tins is a simple and intuitive cxplanation for an extension to a default theory.展开更多
In the previous paper, some important properties of extensions of general default theories were given. In order to further explore default logic, a characterization of extensions is presented. And a class of defaults,...In the previous paper, some important properties of extensions of general default theories were given. In order to further explore default logic, a characterization of extensions is presented. And a class of defaults, so-called Auto-compatible Default Theory, is also iotroduced. All these essentially develop the theories of Reiter and his followers.展开更多
Logic programming under the stable model semantics is proposed as a non-monotonic language for knowledge representation and reasoning in artificial intelligence. In this paper, we explore and extend the notion of comp...Logic programming under the stable model semantics is proposed as a non-monotonic language for knowledge representation and reasoning in artificial intelligence. In this paper, we explore and extend the notion of compatibility and the A operator, which were first proposed by Zhang to characterize default theories. First, we present a new characterization of stable models of a logic program and show that an extended notion of compatibility can characterize stable submodels. We further propose the notion of weak auto-compatibility which characterizes the Normal Forward Chaining Construction proposed by Marek, Nerode and Remmel. Previously, this construction was only known to construct the stable models of FC-normal logic programs, which turn out to be a proper subclass of weakly auto-compatible logic programs. We investigate the properties and complexity issues for weakly auto-compatible logic programs and compare them with some subclasses of logic programs.展开更多
文摘On the basis of Reiter’s default theory and Zhang Mingyi’s auto compatible default theory, a research on the characters of clausal default theory, especially the closed auto compatible default theory, is carried out. First, the theorem of monotonicity with extension number is presented. Second, the proof theory of normal default theory on auto compatible default theory is extended. Some important results are proposed.
文摘In this paper sonic propertics of belief logic arc studied. Under a detinition of belief entail the belief logic is nonnlonotonic. Several necessary and sufficient conditions of monotony for belief logic are given. A default theory corresponds to a belief theory by using a bclicf opcrator. It is porved that an extension to a default theory is exactly a set of an Cntailnlents ofa belief fornirlula in the corresponding belief theory. Tins is a simple and intuitive cxplanation for an extension to a default theory.
文摘In the previous paper, some important properties of extensions of general default theories were given. In order to further explore default logic, a characterization of extensions is presented. And a class of defaults, so-called Auto-compatible Default Theory, is also iotroduced. All these essentially develop the theories of Reiter and his followers.
基金supported by the National Natural Science Foundation of China under Grant Nos. 60963009 and 90718009Yi-Song Wang was also partially supported by Scientific Research Fund for Talents Recruiting of Guizhou University under Grant No.(2007)042+1 种基金the Science and Technology Foundation of Guizhou Province under Grant No. [2008]2119the Natural Science Foundation of Educational Commission of Guizhou Province under Grant No. (2008)011
文摘Logic programming under the stable model semantics is proposed as a non-monotonic language for knowledge representation and reasoning in artificial intelligence. In this paper, we explore and extend the notion of compatibility and the A operator, which were first proposed by Zhang to characterize default theories. First, we present a new characterization of stable models of a logic program and show that an extended notion of compatibility can characterize stable submodels. We further propose the notion of weak auto-compatibility which characterizes the Normal Forward Chaining Construction proposed by Marek, Nerode and Remmel. Previously, this construction was only known to construct the stable models of FC-normal logic programs, which turn out to be a proper subclass of weakly auto-compatible logic programs. We investigate the properties and complexity issues for weakly auto-compatible logic programs and compare them with some subclasses of logic programs.
