Abstract
In this paper, We propose a general default logic. It extends Reiter’s default logic by adding rule connectives like disjunction in logic programming, and Ferraris’s general logic program by allowing arbitrary propositional formulas to be the base in forming logic programs. We show the usefulness of this logic by applying it to formalizing rule constraints, generalized closed world assumptions, and conditional defaults.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–132 (1980)
Ferraris, P.: Answer Sets for Propositional Theories. In: Baral, C., et al. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 119–131. Springer, Heidelberg (2005)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. Fifth International Conference and Symposium on Logic Programming, pp. 1070–1080 (1988)
Gelfond, M., Lifschitz, V., Przymusinska, H.: Disjunctive Defaults. In: Allen, J., Fikes, R., Sandewall, B. (eds.) Proceedings of the second Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Massachusetts, Morgan Kaufmann, San Francisco (1991)
Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25(3-4), 369–389 (1999)
Pearce, D.: Equilibrium logic: an extension of answer set programming for nonmonotonic reasoning. In: Proccedings of WLP2000, p. 17 (2000)
Gelfond, M.: Logic programming and reasoning with incomplete information. Ann. Math. Artif. Intell. 12(1-2), 89–116 (1994)
Chan, E.P.F.: A possible world semantics for disjunctive databases. Knowledge and Data Engineering 5(2), 282–292 (1993), citeseer.ist.psu.edu/chan99possible.html
Delgrande, J., Schaub, T.: Compiling reasoning with and about preferences into default logic. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI–97), pp. 168–174. Morgan Kaufmann, San Mateo (1997)
Lin, F., Shoham, Y.: A logic of knowledge and justified assumptions. Artificial Intelligence 57, 271–289 (1992)
Lin, F., Zhou, Y.: From answer set logic programming to circumscription via logic of gk. In: Proceedings of the IJCAI’07 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zhou, Y., Lin, F., Zhang, Y. (2007). General Default Logic. In: Baral, C., Brewka, G., Schlipf, J. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2007. Lecture Notes in Computer Science(), vol 4483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72200-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72199-4
Online ISBN: 978-3-540-72200-7
eBook Packages: Computer ScienceComputer Science (R0)