In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
The scalability problem is a major impediment to the use of hardware evolution for real-world circuit design problems. A potential solution is to model the map between genotype an...
Abstract. This paper is on the automation of knowledge-intensive tasks in engineering domains; here, the term “task” relates to analysis and synthesis tasks, such as diagnosis ...
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...
We present a tool for commonsense reasoning in the classical logic event calculus using satisfiability. We describe the tool, which takes event calculus reasoning problems as inpu...