Minimum and maximum predicates in logic programming
暂无分享,去创建一个
[1] Allen Van Gelder,et al. The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..
[2] S. Sudarshan,et al. Aggregation and Relevance in Deductive Databases , 1991, VLDB.
[3] Alan van Gelser. Negation as failure using tight derivations for general logic programs , 1989 .
[4] Alberto O. Mendelzon,et al. Low Complexity Aggregation in GraphLog and Datalog , 1993, Theor. Comput. Sci..
[5] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[6] Teodor C. Przymusinski,et al. Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.
[7] Hamid Pirahesh,et al. The Magic of Duplicates and Aggregates , 1990, VLDB.
[8] Carlo Zaniolo,et al. Stable models and non-determinism in logic programs with negation , 1990, PODS.
[9] Jeffrey D. Ullman,et al. Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.
[10] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.