Time-stamped claim logic

Journal Article · 18 March 2020 · Logic Journal of the IGPL

DOI: https://doi.org/10.1093/jigpal/jzaa001 · OSTI ID:1605299

Rasga, João ^[1]; Sernadas, Cristina ^[1]; Karafili, Erisa ^[2]; Viganò, Luca ^[3]

---

1. Departamento de Matemática, Instituto Superior Técnico and CMAFcIO, ULisboa, Portugal
2. Electronics and Computer Science, University of Southampton, UK
3. Department of Informatics, King’s College London, UK

Abstract The main objective of this paper is to define a logic for reasoning about distributed time-stamped claims. Such a logic is interesting for theoretical reasons, i.e. as a logic per se, but also because it has a number of practical applications, in particular when one needs to reason about a huge amount of pieces of evidence collected from different sources, where some of the pieces of evidence may be contradictory and some sources are considered to be more trustworthy than others. We introduce the time-stamped claim logic including a sound and complete sequent calculus. In order to show how time-stamped claim logic can be used in practice, we consider a concrete cyber-attribution case study.

• Sponsoring Organization: USDOE Office of Nuclear Energy (NE), Nuclear Fuel Cycle and Supply Chain
• Grant/Contract Number: UIDB/04561/2020
• OSTI ID: 1605299
• Journal Information: Logic Journal of the IGPL, Journal Name: Logic Journal of the IGPL Vol. 29 Journal Issue: 3; ISSN 1367-0751
• Publisher: Oxford University PressCopyright Statement
• Country of Publication: Country unknown/Code not available
• Language: English