Sciweavers

360 search results - page 25 / 72
» Explanations and Proof Trees
Sort
View
CSL
2008
Springer
14 years 11 months ago
Characterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
Thomas Place
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
14 years 9 months ago
On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups
This note deals with a formula due to G. Labelle for the summed cycle indices of all rooted trees, which resembles the well-known formula for the cycle index of the symmetric grou...
Stephan G. Wagner
PPSWR
2005
Springer
15 years 3 months ago
Descriptive Typing Rules for Xcerpt
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
Sacha Berger, Emmanuel Coquery, Wlodzimierz Draben...
ILC
2007
Springer
15 years 3 months ago
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
Jacques Duparc, Alessandro Facchini
CADE
2008
Springer
15 years 10 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard