The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Executing temporal logic programs: preliminary version
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
A Calculus of Communicating Systems
(1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10235-3 · Cited by 4,633
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Clocksin, W. F., & Mellish, C. (1984) · Springer eBooks · doi:10.1007/978-3-642-55481-0 · Cited by 2,047
Kowalski, R., & Smoliar, S. (1982) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1005937.1005947 · Cited by 1,182
The temporal semantics of concurrent programs
Pnueli, A. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90110-9 · Cited by 699
Predicate Logic as Programming Language.
Kowalski, R. (1974) · IFIP Congress · Cited by 670
(1979) · Lecture notes in computer science · doi:10.1007/3-540-09237-4 · Cited by 648
McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., & Levin, M. I. (1962) · doi:10.21236/ad0406138 · Cited by 555
Synthesis of Communicating Processes from Temporal Logic Specifications
Manna, Z., & Wolper, P. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357233.357237 · Cited by 526
Goldblatt, R. (1986) · Journal of Symbolic Logic · doi:10.2307/2273958 · Cited by 427
Rescher, N., & Urquhart, A. (1971) · LEP Library of Exact Philosophy · doi:10.1007/978-3-7091-7664-1 · Cited by 394
A Temporal Logic for Multilevel Reasoning about Hardware
Moszkowski (1985) · Computer · doi:10.1109/mc.1985.1662795 · Cited by 365
The correctness problem in computer science
(1983) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(83)90038-1 · Cited by 354
PARLOG: parallel programming in logic
Clark, K., & Gregory, S. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5001.5390 · Cited by 324
Lucid, a nonprocedural language with iteration
Ashcroft, E. A., & Wadge, W. W. (1977) · Communications of the ACM · doi:10.1145/359636.359715 · Cited by 241
Introduction to logic programming
Hogger, C. J. (1984) · Cited by 164
Cited by
Specifying real-time properties with metric temporal logic
Koymans, R. (1990) · Real-Time Systems · doi:10.1007/bf01995674 · Cited by 1,180
Temporal logics in AI: Semantical and ontological considerations
Shoham, Y. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90052-x · Cited by 264
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117
“Logical perspective MetateM interpreter implements an “on the basis of the past, do the future” behaviour based upon the methodology of temporal logic as an executable imperative language presented by Moszkowski [259].”
Method
Metadata
- Authors
- Moszkowski, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1985
- Pages
- 111-130
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1497559908
- Cited by
- 397
- References
- 18
- FWCI
- 3.61
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.