Introduces Time-Stamped Claim Logic with a sound and complete sequent calculus for reducing sets of time-stamped claims and removing inconsistencies according to trust relations, illustrated via a cyber-attribution case study.
x⊴p a ∈ ΨR then there is a′ ∈ X′ A such that a′⊴p a ∈ ΨR
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Time-Stamped Claim Logic
Introduces Time-Stamped Claim Logic with a sound and complete sequent calculus for reducing sets of time-stamped claims and removing inconsistencies according to trust relations, illustrated via a cyber-attribution case study.