Closures and fairness in the semantics of programming logic
Data up to Jan 2025
Total Citations Per Year
Abstract
References (18)
A Machine-Oriented Logic Based on the Resolution Principle
1965 • 3,880 citations
A lattice-theoretical fixpoint theorem and its applications
1955 • 2,678 citations
Negation as Failure
1978 • 2,091 citations
The Semantics of Predicate Logic as a Programming Language
1976 • 1,489 citations
Logic for problem solving
1982 • 1,224 citations
Mathematical Theory of Computation
1972 • 707 citations
Automated Theorem Proving: A Logical Basis
1978 • 690 citations
Contributions to the Theory of Logic Programming
1982 • 592 citations
Program Flow Analysis: Theory and Application
1981 • 367 citations
Constructive versions of Tarski’s fixed point theorems
1979 • 249 citations
Semantic foundations of program analysis
1981 • 207 citations
Principles of programming languages
1982 • 173 citations
Principles of programming languages
2010 • 156 citations
Lectures on a Mathematical Theory of Computation
1982 • 145 citations
Automatic synthesis of optimal invariant assertions
1977 • 108 citations
A Unified Treatment of Resolution Strategies for Logic Programs.
1984 • 39 citations
Automatic synthesis of optimal invariant assertions
1977 • 31 citations
Negation and Semantics of Prolog Programs.
1982 • 8 citations