Stratification and Knowledge Base Management
暂无分享,去创建一个
[1] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[2] Allen Van Gelder,et al. Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..
[3] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[4] Jean H. Gallier,et al. Logic Programming and Graph Rewriting , 1985, SLP.
[5] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, STOC '74.
[6] Jack Minker,et al. On Indefinite Databases and the Closed World Assumption , 1987, CADE.
[7] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..
[8] Vladimir Lifschitz,et al. On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..
[9] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, Symposium on the Theory of Computing.
[10] David Harel,et al. Horn Clauses Queries and Generalizations , 1985, J. Log. Program..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[13] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[14] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.