Author:
Gallier Jean H.,Raatz Stan
Reference28 articles.
1. Theorem Proving via General Matings;Andrews;J. Assoc. Comput. Mach.,1981
2. Contributions to the Theory of Logic Programming;Apt;J. Assoc. Comput. Mach.,1982
3. Towards a Theory of Declarative Knowledge;Apt,1985
4. Model Theory;Chang,1978
5. Using Rewriting Rules for Connection Graphs to Prove Theorems;Chang;Artificial Intelligence,1979
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Elementary classes of graphs in a language without equality predicate;Journal of Physics: Conference Series;2020-05-01
2. Transforming specifications of observable behaviour into programs;Logic Program Synthesis and Transformation — Meta-Programming in Logic;1994
3. Parsing as non-Horn deduction;Artificial Intelligence;1993-10
4. Logics for Negation as Failure;Mathematical Sciences Research Institute Publications;1992
5. The Wivenhoe Computational Model: In Search of More Parallelisms;Logic Programming New Frontiers;1992