no code implementations • 16 Jan 2014 • Jos de Bruijn, Stijn Heymans
We subsequently establish two novel lower bounds, establishing that RDFS entailment is PTime-complete and that simple-D entailment is coNP-hard, when considering arbitrary datatypes, both in the size of the entailing graph.
no code implementations • 20 Dec 2013 • Vinay K. Chaudhri, Stijn Heymans, Michael Wessel, Tran Cao Son
Research on developing efficient and scalable ASP solvers can substantially benefit by the availability of data sets to experiment with.
