The Expressive Power of Unique Total Stable Model Semantics
暂无分享,去创建一个
[1] Phokion G. Kolaitis. Implicit definability on finite structures and unambiguous computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[2] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[3] Jörg Flum,et al. Total and Partial Well-Founded Datalog Coincide , 1997, ICDT.
[4] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[5] Domenico Saccà. Multiple Total Stable Models are Definitely Needed to Solve Unique Solution Problems , 1996, Inf. Process. Lett..
[6] Serge Abiteboul,et al. Non-deterministic languages to express deterministic transformations , 1990, PODS '90.
[7] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[8] John S. Schlipf,et al. The expressive powers of the logic programming semantics (extended abstract) , 1990, PODS.
[9] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..
[10] Andreas Blass,et al. On the Unique Satisfiability Problem , 1982, Inf. Control..
[11] Jeffrey D. Ullman,et al. Principles Of Database And Knowledge-Base Systems , 1979 .
[12] Christos H. Papadimitriou,et al. Why not Negation by Fixpoint? , 1991, J. Comput. Syst. Sci..
[13] John S. Schlipf,et al. The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..
[14] David Harel,et al. Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[15] Georg Gottlob,et al. Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics , 1994, IS/KI.
[16] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[17] Zoé Lacroix,et al. Generalized Implicit Definitions on Finite Structures , 1995, CSL.
[18] Leslie G. Valiant,et al. Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..
[19] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[20] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.