Modeling and Verification of Real-Time Systems with the Event Calculus and s(CASP)
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The use of time in the knowledge base provides complications related to the ostensibly infinitely divisible nature of time.
“As mentioned above, the use of time in the knowledge base provides complications related to the ostensibly infinitely divisible nature of time (as posited by the famous Greek philosopher Zeno).”
From Autonomous Task Completion Based on Goal-directed Answer Set Programming (2025) · cites this paper as [18]
This is a known problem with representing continuous time in logic programming and would require the inclusion of event calculus.
“This is a known problem with representing continuous time in logic programming and would require the inclusion of event calculus [18].”
From Autonomous Task Completion Based on Goal-directed Answer Set Programming (2025) · cites this paper as [18]
Cited by
Sorted by citations
Autonomous Task Completion Based on Goal-directed Answer Set Programming
Tudor, A. R. (2025) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.416.39
- Authors
- Varanasi, S. C., Arias, J., Salazar, E., Li, F., Basu, K., & Gupta, G.
- Affiliations
- The University of Texas at Dallas (US)
- Universidad Rey Juan Carlos (ES)
- Corresponding author
- Varanasi, Sarat Chandra
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2022
- Pages
- 181-190
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W4205690016
- Cited by
- 7
- References
- 0
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 1 · 2023: 3
- FWCI
- 0.83
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
- Physical Sciences › Computer Science › Artificial Intelligence › Multi-Agent Systems and Negotiation
- Keywords
- event calculus, real-time systems, cyber-physical systems, safety verification, liveness detection, requirements specification, goal-directed reasoning
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
