Isoinitial Semantics for Logic Programs
暂无分享,去创建一个
[1] Alberto Bertoni,et al. On the power of model theory in specifying abstract data types and in capturing their recursiveness , 1983 .
[2] Kung-Kiu Lau,et al. Steadfast Logic Programs , 1999, J. Log. Program..
[3] Maurizio Gabbrielli,et al. A Compositional Semantics for Logic Programs , 1994, Theor. Comput. Sci..
[4] Krzysztof R. Apt,et al. Logic Programming and Negation: A Survey , 1994, The Journal of Logic Programming.
[5] Juliana Küster Filipe Bowles,et al. On Dynamic Aspects of OOD Frameworks in Component-Based Software Development in Computational Logic , 1999, LOPSTR.
[6] Antonio Brogi,et al. Modular logic programming , 1994, TOPL.
[7] Fernando Orejas,et al. An Algebraic Framework for the Definition of Compositional Semantics of Normal Logic Programs , 1999, J. Log. Program..
[8] Evelina Lamma,et al. Modularity in Logic Programming , 1994, J. Log. Program..
[9] Raymond Reiter. On Closed World Data Bases , 1977, Logic and Data Bases.
[10] Wilfrid Hodges,et al. Logical features of Horn Clauses , 1993 .
[11] Danny De Schreye,et al. Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..
[12] Pierangelo Miglioli,et al. Constructive Theories with Abstract Data Types for Program Synthesis , 1987 .
[13] David Chan,et al. Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.
[14] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .
[15] Pierangelo Miglioli,et al. Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods , 1994, J. Symb. Comput..
[16] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.