We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
Dmitriy Zheleznyakov, Diego Calvanese, Evgeny Khar...
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
on of abstract strategies which is extensional in the sense that a strategy is defined explicitly of derivations of an abstract reduction system. We then move to a more intensional...
Tony Bourdier, Horatiu Cirstea, Daniel J. Doughert...