2356 search results - page 63 / 472 » Characterizations of postman sets |
105
click to vote
LPNMR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
ICFCA
2007
Springer
15 years 6 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
105
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
106
click to vote
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
116
click to vote
IJBRA
2010
14 years 10 months ago
2010
—We aim to determine the biological relevance of genes identified through microarray-mediated transcriptional profiling of Xenopus sensory organs and brain tissue. Genetic data...