1. Arithmetic complexity of the perfect models of stratified logic programs;Apt;Proc. 5th Internat. Conf⧸Symp. on Logic Programming,1988
2. Towards a theory of declarative knowledge;Apt,1988
3. Decidability in the Herbrand base;Blair;Proc. Workshop on Foundations of Deductive Databases and Logic Programming,1986
4. Negation as failure;Clark,1978
5. On the adequacy of predicate circumscription for closed world reasoning;Etherington;Comput. Intelligence,1985