Logic for problem-solving
Describing Prolog by its interpretation and compilation
Communications of the ACM
A General Translation Program for Phrase Structure Languages
Journal of the ACM (JACM)
Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Simplified Format for the Model Elimination Theorem-Proving Procedure
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
On the relative efficiencies of context-free grammar
Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Sequential formula translation
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Natural Language Communication with Computers
Historical Remarks on Compiler Construction
Compiler Construction, An Advanced Course, 2nd ed.
ACM '69 Proceedings of the 1969 24th national conference
ACM SIGPLAN Notices - Special issue: History of programming languages conference
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACM SIGPLAN Notices
Constraint logic programming languages
Communications of the ACM
Notes on implementing sets in Prolog
Communications of the ACM
15th July 1972: a significant moment for logic programming
ACM SIGPLAN Notices
HOPL-II The second ACM SIGPLAN conference on History of programming languages
Efficient reordering of C-PROLOG
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Theory and Practice of Logic Programming
History of programming languages---II
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Inference systems for logical algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Extension of first-order theories into trees
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Hi-index | 48.25 |
Dealing with failure is easy: Work hard to improve. Success is also easy to handle: You've solved the wrong problem. Work hard to improve.