Skip to main content

Research Repository

Advanced Search

Outputs (3164)

Software evolution in an interdisciplinary environment. (2003)
Presentation / Conference Contribution
Bennett, K., Bradley, S., Glover, G., & Barnes, D. (2003, September). Software evolution in an interdisciplinary environment. Presented at Software Technology and Engineering Practice, 11th. International Conference., Amsterdam

At Durham, an interdisciplinary team has implemented the UK?s first web-centred data base of adult mental health service provision (we regard interdisciplinary research to be taking place when two or more groups from different disciplines work togeth... Read More about Software evolution in an interdisciplinary environment..

Moral dominance relations for program comprehension (2003)
Journal Article
Shaw, S., Goldstein, M., Munro, M., & Burd, E. (2003). Moral dominance relations for program comprehension. IEEE Transactions on Software Engineering, 29(9), 851-863. https://doi.org/10.1109/tse.2003.1232289

Dominance trees have been used as a means for reengineering legacy systems into potential reuse candidates. The dominance relation suggests the reuse candidates which are identified by strongly directly dominated subtrees. We review the approach and... Read More about Moral dominance relations for program comprehension.

CASE tool evaluation : experiences from an empirical study (2003)
Journal Article
Budgen, D., & Thomson, M. (2003). CASE tool evaluation : experiences from an empirical study. Journal of Systems and Software, 67(2), 55-75. https://doi.org/10.1016/s0164-1212%2802%2900088-2

While research activity in software engineering often results in the development of software tools and solutions that are intended to demonstrate the feasibility of an idea or concept, any resulting conclusions about the degree of success attained ar... Read More about CASE tool evaluation : experiences from an empirical study.

On relativisation and complexity gap for resolution-based proof systems (2003)
Presentation / Conference Contribution
Dantchev, S., & Riis, S. (2003, August). On relativisation and complexity gap for resolution-based proof systems. Presented at 12th Annual Conference of the EACSL Computer Science Logic., Vienna, Austria

We study the proof complexity of Taut, the class of Second-Order Existential (SO∃) logical sentences which fail in all finite models. The Complexity-Gap theorem for Tree-like Resolution says that the shortest Tree-like Resolution refutation of any su... Read More about On relativisation and complexity gap for resolution-based proof systems.

Amalgamations of connected k-factorizations (2003)
Journal Article
Hilton, A., Johnson, M., Rodger, C., & Wantland, E. (2003). Amalgamations of connected k-factorizations. Journal of Combinatorial Theory, Series B, 88(2), 267-279. https://doi.org/10.1016/s0095-8956%2803%2900030-3

In this paper, necessary and sufficient conditions are found for a graph with exactly one amalgamated vertex to be the amalgamation of a k-factorization of K<sub>kn+1</sub> in which each k-factor is connected. From this result, necessary and sufficie... Read More about Amalgamations of connected k-factorizations.

The complexity of achievement and maintenance problems in agent-based systems (2003)
Journal Article
Stewart, I. (2003). The complexity of achievement and maintenance problems in agent-based systems. Artificial Intelligence, 146(2), 175-191. https://doi.org/10.1016/s0004-3702%2803%2900014-6

We completely classify the computational complexity of the basic achievement and maintenance agent design problems in bounded environments when these problems are parameterized by the number of environment states and the number of agent actions. The... Read More about The complexity of achievement and maintenance problems in agent-based systems.

Matching games : the least core and the nucleolus (2003)
Journal Article
Kern, W., & Paulusma, D. (2003). Matching games : the least core and the nucleolus. Mathematics of Operations Research, 28(2), 294-308. https://doi.org/10.1287/moor.28.2.294.14477

A matching game is a cooperative game defined by a graph G = (V, E). The player set is V and the value of a coalition S # V is defined as the size of a maximum matching in the subgraph induced by S. We show that the nucleolus of such games can be com... Read More about Matching games : the least core and the nucleolus.

Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey (2003)
Presentation / Conference Contribution
Krokhin, A., Bulatov, A., & Jeavons, P. (2003, May). Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. Presented at 33rd International Symposium on Multiple-Valued Logic (ISMVL'03)

Many computational problems arising in artificial intelligence, computer science and elsewhere can be represented as constraint satisfaction and optimization problems. In this short survey we discuss an approach that is related to the algebraic compo... Read More about Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey.

Some problems not definable using structure homomorphisms (2003)
Journal Article
Madelaine, F., & Stewart, I. (2003). Some problems not definable using structure homomorphisms. Ars combinatoria, 67, 153-159

We exhibit some problems definable in Feder and Vardi's logic MMSNP that are not in the class CSP of constraint satisfaction problems. Whilst some of these problems have previously been shown to be in MMSNP (that is, definable in MMSNP) but not in CS... Read More about Some problems not definable using structure homomorphisms.