886 search results - page 61 / 178 » Reasoning with contextual graphs |
141
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the ļ¬rst parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ā...
152
click to vote
DLOG
2011
14 years 7 months ago
2011
The canonical standard description logic reasoning service is classiļ¬cation, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
151
click to vote
CADE
2012
Springer
13 years 6 months ago
2012
Springer
The problem of SPARQL query containment is deļ¬ned as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
146
click to vote
POPL
2012
ACM
13 years 11 months ago
2012
ACM
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languagesāthat is, languages that combine fea...
131
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origamiās and ary relation...