Abstract
In this paper, the representability of a family of theories as the set of extensions of a default theory is studied. First, a new necessary condition is given for the representability by means of general default theories; then a sufficient one is presented. The families of theories represented by default theories are also fully characterized. Finally, the paper gives an example of denumerable families of mutually inconsistent theories that are represented by a default theory but not by normal ones.
Similar content being viewed by others
References
Reiter R. A logic for default reasoning.Artif. Intell., 1980, 12: 81–132.
Etherington D W. Reasoning with Incomplete Information. London: Pitman, 1988.
Besnard P. An Introduction to Default Logic. Berlin: Springer-Verlag, 1989.
Brewka G. Nonmonotonic Reasoning: Logical Foundation of Commonsense. Cambridge University Press, Cambridge, UK, 1991.
Su K, Ding D. Default logic about assertions.Science in China (Series A), 1994, 37(11): 1399–1408.
Cadoli M. Tractable Reasoning in Artificial Intelligence. Berlin: Springer-Verlag, 1995.
Su K, Chen H. A solution to a problem of Marek and Truszczyński. InProceedings of the 6th Asian Logic Conference, Singapore: World Scientific Publishing Co. Ltd., 1998, pp.247–254.
Zhang M. A new research into default logic.Information and Computation, 1996, 129(2): 73–85.
Antoniou G. Nonmonotonic Reasoning. London MA: The MIT Press, 1997.
Su K, Li W. Computation of extensions of seminormal default theories.Fundamenta Informaticae, 1999, 40(1): 79–102.
Marek W, Truszczyński M. Nonmonotonic Logic: Context-dependent Reasoning. Heiderberg: Spring-Verlag, 1993.
Marek W, Treur J, Truszczyński M. Representation theory for default logic.Annals of Mathematics and Artificial Intelligence, 1997, 21(2–4): 343–358.
Schaub T. On constrained default theories. InProceedings of the 11th European Conference on Artificial Intelligence, ECAI’92, John Wiley and Sons, 1992, pp.304–308.
Bonatti P A, Eiter T. Querying disjunctive databases through nonmonotonic logics.Theoretical Computer Science, 160(1–2): 321–363.
de Kleer J. Local methods for localizing in electronic circuits. InMIT AI Memo 394, Cambridge, MA, 1976.
Reiter R. A theory of diagnosis from first principles.Artif. Intell., 1987, 32: 57–95.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported in part by the National natural Science Foundation of China under grant Nos.60073056 and 69733020, in part by the Guangdong Provincial Natural Science Foundation under grant No. 001174, in part by the Foundation for University Key Teachers by The Ministry of Education, China and in part by the National ‘863’ High-Tech Programme of China (No. 863-306-ZT06-03-1).
Part of Section 5 in this paper has appeared inProceedings of the Sixth Asian Logic Conference.
SU Kaile was born in 1964. He received his Ph.D. degree from Nanjing University in 1995. Then, he worked as a postdoctoral researcher at the National Key Lab. of Parallel and Distributed Computing in National University of Defense Technology. Since 1999, he has been working in Department of Computer Science, Zhongshan University, where he is now a professor.
Professor Su has been engaged in theoretic research of artificial intelligence for ten years. He has published more than 30 reviewed journal papers, including two papers in Science in China and several papers in famous international journals such as Information and Computation, Journal of Logic and Computation, and Fundamenta Informaticae.
Rights and permissions
About this article
Cite this article
Su, K. Constraints on extensions of a default theory. J. Comput. Sci. & Technol. 16, 329–340 (2001). https://doi.org/10.1007/BF02948981
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02948981