Abstract
It is argued that some symmetric structure in logic programs could be taken into account when implementing semantics in logic programming. This may enhance the declarative ability or expressive power of the semantics. The work presented here may be seen as representative examples along this line. The focus is on the derivation of negative information and some other classic semantic issues. We first define a permutation group associated with a given logic program. Since usually the canonical models used to reflect the common sense or intended meaning are minimal or completed models of the program, we expose the relationships between minimal models and completed models of the original program and its so-called G-reduced form newlt-derived via the permutation group defined. By means of this G reduced form, we introduce a rule to assume negative information termed G-CWA, which is actually a generalization of the GCWA. We also develop the notions of G-definite, G-hierarchical and G-stratified logic programs, which are more general than definite, hierarchical and stratified programs, and extend some well-known declarative and procedural semantics to them, respectively.
Similar content being viewed by others
References
Minker J. On Indefinite Databases and the Closed World Assumption. Readings in Nonmonotonic Reasoning, Ginsberg M L (ed.), Morgan Kaufmann, Los Altos, 1987, pp.326–333.
Va Emden M H, Kowalski R A. The semantics of predicate logic as a programming language.J. ACM, 1976 23: 733–742.
Clark K L. Negation as failure. Readings in Nonmonotonic Reasoning, Ginsberg M L (ed.), Morgan Kaufmann, Los Altos, 1987, pp.311–325.
Apt K R, Blair H A, Walker A. Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming, Minker J (ed.), Morgan Kaufmann, Los Altos, 1988, pp.89–148.
Gelfond M, Przymusinska H. Negation as failure: Careful closure of procedure.Artificial Intelligence, 1986, 30: 273–287.
Lukaszewicz W. Non-Monotonic Reasoning_— Formalization of Commonsense Reasoning. Ellis Horwood, 1990.
Przymusinski T C. On the declarative semantics of deductive databases and logic programs. Foundations of Deductive Databases and Logic Programming, Minker J (ed.), Morgan Kaufmann, Los Altos, 1988, pp.193–216.
Lloyd J W. Foundations of Logic Programming. Springer-Verlag, 1987.
Kunen K. Negation in logic programming.J. Logic Programming, 1987, 4: 289–308.
Cavedon L, Lloyd J W. A completeness theorem for SLDNF resolution.J. Logic Programming, 1989, 7(3): 177–191.
Barbuti R, Martelli M. Completeness of the SLDNF-Resolution for a class of logic programs. InProc. 3th Int. Conf. Logic Programming, Paris, France, 1986, pp.600–614.
Van Gelder A. Negation as Failures Using Tight Derivations for General Logic Programs. Foundations of Deductive Databases and Logic Programming, Minker J (ed.), Morgan Kaufmann, Los Altos, 1988, pp.149–176.
Decker H. On generalized cover axioms. InProc. 8th Int. Conf. Logic Programming, St Peterburg, Russia, 1991, pp.693–707.
Lobo J, Minker J, Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.
Bidoit N. Negation in rule-based database languages: A survey.Theoretical Computer Science, 1991, 78: 3–83.
Apt K R, Bol R N. Logic programming and negation: A survey.J. Logic Programming, 1994, 19/20: 9–71.
Shepherdson J C. Negation as Failure, Completion and Stratification. Handbook of Logic in Artificial Intelligence and Logic Programming, Dov M Gabbayet al. (eds.), 1998, 5: 356–419.
Rotman J J. An Introduction to the Theory of Groups. Springer-Verlag, New York, 1994.
Wu J. Symmetries in Logic Programs. Research Report MPI-I-1999-2-005, Max-Planck-Institut für Informatik, Germany, 1999.
Wu J. Logic programming_— Taking advantage of symmetry. InProc. ASCM, World Scientific Publ., 2000, pp.100–109.
Reiter R. On Closed World Data Bases. Readings in Nonmonotonic Reasoning, Ginsberg M L (ed.), Morgan Kaufmann, Los Altos, 1987, pp. 300–310.
Sato T. On the consistency of first order logic programs. Technical Report 87-12, Electrotechnical Laboratory, Ibarki, Japan, 1987.
Bachmair L, Ganzinger H. Perfect model semantics for logic programs with equality. InProc. Int. Conf. Logic Programming, Oxford Univ., U.K., 1991, pp.645–659.
Bossu G, Siegel P. Saturation, nonmonotonic reasoning and the closed world assumption.Artificial Intelligence, 1985, 25: 13–63.
Benhamou B, Sais L. Theoretical study of symmetries in propositional calculus and applications. InProc. 11th Int. Conf. Automated Deduction, Los Altos, USA, 1992, pp.281–294.
Egly U. A first order resolution calculus with symmetries. InProc. Int. Conf. Logic Programming and Automated Reasoning, 1993, pp.110–121.
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by the National Natural Science Foundation of China under Grant No.60373113.
Jin-Zhao Wu was born in 1965. He obtained his Ph.D. degree in 1994 from the Institute of Systems Science, the Chinese Academy of Sciences. From 1994 to 1999 he was a post-doctoral and research scientist in Peking University and Max-Planck Institute of Computer Science. Since 2000 he has been working on the Faculty of Mathematics and Computer Science, University of Mannheim.
Harald Fecher was born in 1972. He obtained his Ph.D. degree in 2003 from the Faculty of Mathematics and Computer Science, University of Mannheim. Since 2004 he has been research scientist in the Faculty of Computer Science, University of Kiel.
Rights and permissions
About this article
Cite this article
Wu, JZ., Fecher, H. Symmetric structure in logic programming. J. Comput. Sci. & Technol. 19, 803–811 (2004). https://doi.org/10.1007/BF02973443
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02973443