We present four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs: big-step and small-step relational semant...
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Abstract. In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions. In this model, ...
Meta-level architectures for dynamic control of reasoning processes are quite powerful. In the literature many applications in reasoning systems modelling complex tasks are descri...
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...