Symmetric structure in logic programming

  • Authors:

  • Jin-Zhao Wu;Harald Fecher

  • Affiliations:

  • Chengdu Institute of Computer Applications, The Chinese Academy of Sciences, Chengdu 610041, P.R. China and Fakultät für Mathematik und Informatik, Universität Mannheim, D7, 27, 681 ...;Fakultät für Mathematik und Informatik, Universität Mannheim, D7, 27, 68131 Mannheim, Germany

  • Venue:
  • Journal of Computer Science and Technology
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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 newly-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.