More on representation theory for default logic

Authors:
Kaile Su
Affiliations:
Institute of Logic and Cognition, Zhongshan University, Guangzhou, 510275, People's Republic of China, State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, Peop ...
Venue:
Information and Computation
Year:
2001

Citing 0
Cited 3

On the expressive power of semi-normal defaults in some semantic variants of default logic

AI Communications - Special issue on Artificial intelligence advances in China
Fixed-parameter tractability of disjunction-free default reasoning

Journal of Computer Science and Technology
On the expressive power of semi-normal defaults in some semantic variants of default logic

AI Communications - Artificial Intelligence Advances in China

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the representability of a family of theories as the set of extensions of a default theory. First, we present both new necessary conditions and sufficient ones for the representability by means of general default theories, which improves on similar results known before. Second, we show that one always obtains representable families by eliminating countably many theories from a representable family. Finally, we construct two examples of denumerable, representable families; one is not supercompactly nonincluding, and the other consists of mutually inconsistent theories but fails to be represented by a normal default theory.