915 search results - page 22 / 183 » Maximally Abstract Retrenchments |
DLOG
2009
13 years 5 months ago
2009
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We investigate the structure of the set of gapped motifs (repeated patterns with don’t cares) of a given string of symbols. A natural equivalence classification is int...
FUIN
2002
13 years 7 months ago
2002
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
To maximize efficiency in time and space, allocations and deallocations, in the exact linear algebra library LinBox, must always occur in the founding scope. This provides a simpl...
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...