We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Luci...