9532 search results - page 27 / 1907 » Logic, Graphs, and Algorithms |
99
Voted
IJCAI
2001
15 years 1 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
117
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
DAC
2003
ACM
16 years 1 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
109
click to vote
INFORMATICALT
2007
15 years 14 days ago
2007
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
97
Voted
CORR
2008
Springer
15 years 19 days ago
2008
Springer
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...