Abstract
One of the most important works in the investigation of logic programming is to define the semantics of the logic programs and to find the preferable answer set of them. There are so far three methods can be used to establish the semantics of the logic programs, i.e., the means of model, fixpoint and proof theory. According to the form of the rules contained in a logic program, different logic program classes can be defined. Although well-defined semantics exist for some restricted classes of programs like Horn and stratified Programs, the declarative semantics of the more general program classes are still the subject of research. In this paper, the properties of the basic disjunctive logic programming are studied, and the notion of double prioritization is introduced, that is, the prioritization on both literals and clauses, by which the most preferable answer set of a basic disjunctive logic program is defined. In order to obtain the most preferable answer set of a basic disjunctive logic program explicitly, a recursion-theoretic construction called tree method is given.
This work is supported by the National Natural Science Foundation (grant no. 60310213, 60573064), and the National 973 Programme (grants no. 2003CB317008 and G1999032701).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. Journal of Association for Computing Machinery 23(4), 733–742 (1976)
Dahr, M.: Deductive Databases: Theory and Applications. International Thomson Computer Press, London (1997)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New generation computing 9, 365–385 (1991)
Chandra, A., Harel, D.: Horn clause queries and generalizations. Journal of logic programming 2(1), 1–5 (1985)
Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of deductive databases and logic programming, pp. 89–148. Morgan Kaufmann, San Mateo (1988)
Van Gelder, A.: Negation as failure using tight derivations for general logic programs. In: Minker, J. (ed.) Foundations of deductive databases and logic programming, pp. 149–176. Morgan Kaufmann, San Mateo (1988)
Przymusinski, T.: On the declarative semantics of deductive databases and logic programs. In: Minker, J. (ed.) Foundations of deductive databases and logic programming, pp. 193–216. Morgan Kaufmann, San Mateo (1988)
Sakama, C., Inoue, K.: Representing priorities in logic programs
Zhang, Y., Foo, N.: Answer sets for prioritized logic programs. In: Maluszynski, J. (ed.) Logic Programming: Proc. of the Intl. Symposium (ILPS 1997), pp. 69–83. MIT Press, Cambridge (1997)
Soare, R.I.: Recursively enumerable sets and degrees. Springer, New York (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Sui, Y., Cao, C. (2006). A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_56
Download citation
DOI: https://doi.org/10.1007/11750321_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)