The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Parent-centric real-parameter crossover operators create the offspring in the neighbourhood of one of the parents, the female parent. The other parent, the male one, defines the r...
Abstract Large temporal Databases (TDBs) usually contain a wealth of data about temporal events. Aimed at discovering temporal patterns with during relationship (during-temporal pa...
One of the great benefits that Semantic Web (SW) technology offers is facilitating large scale integration and sharing of distributed data sources. Transferring this technology fro...
Harith Alani, Peter Chandler, Wendy Hall, Kieron O...