301 search results - page 20 / 61 » On extensions of a theorem of Baxter |
88
Voted
JCT
2006
15 years 20 days ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
196
click to vote
CADE
2011
Springer
14 years 21 days ago
2011
Springer
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
112
click to vote
LATA
2012
Springer
13 years 8 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...
124
Voted
CADE
2008
Springer
15 years 2 months ago
2008
Springer
LogAnswer is an open domain question answering system which employs an automated theorem prover to infer correct replies to natural language questions. For this purpose LogAnswer o...
135
Voted
ENTCS
2006
15 years 21 days ago
2006
We study properties of functors on categories of sets (classes) together with set (class) functions. In particular, we investigate the notion of inclusion preserving functor, and ...