Discussion on “A consistency analysis of a class of concurrent transient implicit/explicit algorithms”, by C. Farhat and N. Sobh

Under relational models, epistemic logic agents are logically omniscient. A common strategy to avoid this has been to distinguish between implicit and explicit knowledge, and approaches based on relational models have used implicit knowledge as a ...

In this paper, we discuss the class of implicit–explicit (IMEX) methods for systems of ordinary differential equations where the explicit part has strong stability preserving (SSP) property, while the implicit part of the method has ...