1650 search results - page 221 / 330 » The HOM problem is decidable |
159
click to vote
IJCAI
2003
15 years 7 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
139
click to vote
IJCAI
1989
15 years 7 months ago
1989
In this paper, we investigate technical methods to deal with exceptions, inconsistencies, and ambiguity. Existing reason maintenance systems are only suitable for some of these pr...
164
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
169
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
184
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...