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...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...