English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Symmetries in logic programs

MPS-Authors
/persons/resource/persons45763

Wu,  Jinzhao
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-I-1999-2-005.pdf
(Any fulltext), 41MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Wu, J.(1999). Symmetries in logic programs (MPI-I-1999-2-005). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-6F5E-A
Abstract
We investigate the structures and above all, the applications of a class of symmetric groups induced by logic programs. After establishing the relationships between minimal models of logic programs and their simplified forms, and models of their completions, we show that in general when deriving negative information, we can apply the CWA, the GCWA, and the completion procedure directly from some simplified forms of the original logic programs. The least models and the results of SLD-resolution stay invariant for definite logic programs and their simplified forms. The results of SLDNF-resolution, the standard or perfect models stay invariant for hierarchical, stratified logic programs and some of their simplified forms, respectively. We introduce a new proposal to derive negative information termed OCWA, as well as the new concepts of quasi-definite, quasi-hierarchical and quasi-stratified logic programs. We also propose semantics for them.