1. Extended RDF: Computability and complexity issues

   • Anastasia Analyti
   • Carlos Viegas Damásio
   • Grigoris Antoniou

   OriginalPaper 24 March 2015 Pages: 267 - 334

2. A kd-tree algorithm to discover the boundary of a black box hypervolume

   • Jean-Baptiste Rouquier
   • Isabelle Alvarez
   • Pierre-Henri Wuillemin

   OriginalPaper 30 May 2015 Pages: 335 - 350

3. Probabilistic satisfiability: algorithms with the presence and absence of a phase transition

   • Marcelo Finger
   • Glauber De Bona

   OriginalPaper 25 June 2015 Pages: 351 - 389

4. An NP-complete fragment of fibring logic

   • Yin Wu
   • Min Jiang
   • Changle Zhou

   OriginalPaper 01 July 2015 Pages: 391 - 417

5. A theory of subtree matching and tree kernels based on the edit distance concept

   • Kilho Shin

   OriginalPaper 19 July 2015 Pages: 419 - 460