Document Type

Conference Proceeding

Publication Date

12-1-1999

Find this in a Library

Catalog Record

Abstract

Several important classes of normal logic programs, including the classes of acyclic, acceptable, and locally hierarchical programs, have the property that every program in the class has a unique two-valued supported model. In this paper, we call such classes unique supported model classes. We analyse and characterize these classes by means of operators on three-valued logics. Our studies will motivate the definition of a larger unique supported model class which we call the class of Phi-accessible programs. Finally, we show that the class of Phi -accessible programs is computationally adequate in that every partial recursive function can be implemented by such a program.

Comments

Presented at the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, El Paso, TX, December 2-4, 1999.

Attached is the unpublished, peer-reviewed authors' version of this proceeding.