656 search results - page 7 / 132 » Graph Theoretical Characterization and Computation of Answer... |
14
Voted
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
ENC
2008
IEEE
14 years 1 months ago
2008
IEEE
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
ICCS
2004
Springer
14 years 26 days ago
2004
Springer
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
LPAR
2004
Springer
14 years 25 days 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...
AC
2000
Springer
13 years 12 months ago
2000
Springer
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 ...