hought of as abstract interpretation for the heap How we talk about the heap Program var X points to U that has an N field pointing to V We use first order predicate logic ¡...
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination ...
Jeffrey Pound, Lubomir Stanchev, David Toman, Gran...