Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the relationship between circumscription and well-founded semantics of logic programs
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
A three-valued semantics for deductive databases and logic programs
Journal of Computer and System Sciences
Three-valued formalization of logic programming: is it needed?
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An Extended Petri Net Model for Normal Logic Programs
IEEE Transactions on Knowledge and Data Engineering
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
Complexity of Recursive Normal Default Logic
Fundamenta Informaticae
A Classification Theory Of Semantics Of Normal Logic Programs: I. Strong Properties
Fundamenta Informaticae
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Hi-index | 0.00 |