DBpedia – Linked Data Fragments
DBpedia 2016-04
Query DBpedia 2016-04 by triple pattern
subject
predicate
object
Matches in DBpedia 2016-04 for
{ ?s ?p "Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies" }
Showing triples 1 to 1 of
1
with
100
triples per page.
SARA2005Kung.ps
title
"
Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies
"
.
