共 50 条
- [41] Quantitative Strongest Post A Calculus for Reasoning about the Flow of Quantitative Information [J]. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2022, 6 (OOPSLA):
- [43] CONSTRAINT LOGIC PROGRAMMING FOR REASONING ABOUT DISCRETE EVENT PROCESSES [J]. JOURNAL OF LOGIC PROGRAMMING, 1991, 11 (3-4): : 243 - 270
- [44] Reasoning About Promises in Weak Memory Models with Event Structures [J]. FORMAL METHODS, FM 2023, 2023, 14000 : 282 - 300
- [46] Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus [J]. IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 1221 - 1226
- [47] Modeling and Reasoning About Wireless Networks: A Graph-based Calculus Approach [J]. PROCEEDINGS 11TH 2017 INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING (TASE), 2017, : 133 - 140
- [50] Reconciling the event calculus with the situation calculus [J]. JOURNAL OF LOGIC PROGRAMMING, 1997, 31 (1-3): : 39 - 58