3663 search results - page 544 / 733 » Problems in the ontology of computer programs |
171
click to vote
FOSSACS
2007
Springer
16 years 21 days ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
159
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
178
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
164
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
137
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...