925 search results - page 26 / 185 » Connectivity on Complete Lattices |
FSTTCS
2008
Springer
15 years 26 days ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
DEXA
2000
Springer
15 years 4 months ago
2000
Springer
The relational model, as proposed by Codd, contained the concept of relations as tables composed of tuples of single valued attributes taken from a domain. In most of the early lit...
LPNMR
2009
Springer
15 years 6 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
EUSFLAT
2007
15 years 1 months ago
2007
Fuzzy formal logics were introduced in order to handle graded truth values instead of only ‘true’ and ‘false’. A wide range of such logics were introduced successfully, li...
SEMWEB
2010
Springer
14 years 9 months ago
2010
Springer
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...