The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A logic-based calculus of events
Abstract
Abstract Formal Logic can be used to represent knowledge of many kinds for many purposes. It can be used to formalize programs, program specifications, databases, legislation, and natural language in general. For many such applications of logic a representation of time is necessary. Although there have been several attempts to formalize the notion of time in classical first-order logic, it is still widely believed that classical logic is not adequate for the representation of time and that some form of non-classical Temporal Logic is needed. In this paper, we shall outline a treatment of time, based on the notion of event, formalized in the Horn clause subset of classical logic augmented with negation as failure. The resulting formalization is executable as a logic program.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593 · cited 5×
“10 May 1970 Fig. 1 After update ( 1 ) Similarly after updates (2), (3) and (4), it is possible to make the conclusions shown in pictorial terms in Figs.”
BackgroundInfluential
Cited by
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
Fox, M., & Long, D. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1129 · Cited by 1,741
Knowledge Representation and Reasoning
(2024) · Encyclopedia of Computer Graphics and Games · doi:10.1007/978-3-031-23161-2_300700 · Cited by 819
Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., & Turner, H. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2002.12.001 · Cited by 454
A propositional modal logic of time intervals
Halpern, J. Y., & Shoham, Y. (1991) · Journal of the ACM · doi:10.1145/115234.115351 · Cited by 443
Shanahan, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48317-9_17 · Cited by 440
Metadata
- Authors
- Kowalski, R., & Sergot, M.
- Venue
- New Generation Computing
- Published
- 1986-03
- Volume
- 4
- Issue
- 1
- Pages
- 67-95
- ISSN
- 0288-3635 (ISSN-L)
- 1882-7055
- OpenAlex
- W2135319067
- Cited by
- 1,690
- References
- 1
- FWCI
- 15.23
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A logic-based calculus of events. https://app.cochat.ai/papers/10.1007/bf03037383
- The paper
- Kowalski, R., & Sergot, M. (1986). A logic-based calculus of events. New Generation Computing. https://doi.org/10.1007/bf03037383
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.
