2713 search results - page 88 / 543 » Parameterized Tree Systems |
113
click to vote
SAT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
118
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
115
click to vote
CAV
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
133
Voted
ERSHOV
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
102
Voted
WISA
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we present a video fingerprinting system to identify the source of illegal copies. Content is distributed along a specified tree, with the seller as the root of the ...