9532 search results - page 125 / 1907 » Logic, Graphs, and Algorithms |
ALGORITHMICA
2004
14 years 11 months ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
LATA
2012
Springer
13 years 6 months ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
119
click to vote
TABLEAUX
2005
Springer
15 years 4 months ago
2005
Springer
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extensio...
102
click to vote
IJAR
2010
14 years 9 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
LFCS
2009
Springer
15 years 5 months ago
2009
Springer
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...