Some Results on Order-Consistent Logic Programs

Logic programming is a prominent approach for knowledge representation and reasoning. Answer set semantics of logic programs provides a promising constraint programming paradigm. Consistency is a significant issue in answer set programming. We investigated the order consistent logic programs and showed that the class of order consistent logic programs is identical to the call consistent one for finite logic programs, order consistency is decidable in polynomial time and Lifschitz´s order consistency is identical to Sato´s definition.