We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
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 \observational content" of geometric logic is discussed and it is proposed that geometric logic is an appropriate basis for a Z-like speci cation language in which schema...
We provide a description of generalized default logic as a unified formalism for nonmonotonic reasoning. Special attention will be paid to the role of the monotonic logic underlyi...
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...