121
click to vote
CSL
15 years 6 months ago
2003 Springer 
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
128
click to vote
CSL
15 years 6 months ago
2003 Springer 
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
106
click to vote
CSL
15 years 6 months ago
2003 Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
120
click to vote
CSL
15 years 6 months ago
2003 Springer
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
121
click to vote
CSL
15 years 6 months ago
2003 Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
|
Automated Reasoning