I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that descr...
Jeremy J. Carroll, Christian Bizer, Patrick J. Hay...
This paper describes an extension of the Java language that provides “programmable security.” The approach augments the Java syntax with constructs for specifying various acce...
John Hale, Mauricio Papa, Oliver Bremer, Rodrigo C...
Current workflow management systems (WFMSs) are only applicable in a reliable and secure manner, if the business process (BP) to be supported is wellstructured. As ad hoc deviatio...
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...