CSL 2008 - PDF Preprint Papers

CSL 2008 Workshop on Computer Science Logic

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CSL-2008 Paper

click to vote

CSL
2008
Springer

164views Automated Reasoning» more CSL 2008»

On Counting Generalized Colorings

13 years 7 months ago

Download www.cs.technion.ac.il

Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...

Tomer Kotek, Johann A. Makowsky, Boris Zilber

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	164	On Counting Generalized Colorings	claim
2	143	Applying an analysis of acted vocal emotions to improve the simulation of synthetic speech	claim
3	141	Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars	claim
4	140	The Descriptive Complexity of Parity Games	claim
5	140	A stopping criterion for active learning	claim
6	135	User simulation in a stochastic dialog system	claim
7	134	Characterization of Logics over Ranked Tree Languages	claim
8	131	A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic	claim
9	131	Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T	claim
10	128	Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence	claim
11	123	Explicit modelling of session variability for speaker verification	claim
12	121	Model Transformations in Decidability Proofs for Monadic Theories	claim
13	121	An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games	claim
14	121	Design and evaluation of prosodically-sensitive concatenative units for a Korean TTS system	claim
15	120	Quantitative Languages	claim
16	110	On the Almighty Wand	claim
17	110	On the Relations between the Syntactic Theories of lambda-mu-Calculi	claim
18	105	The Computability Path Ordering: The End of a Quest	claim
19	103	Type-Based Termination with Sized Products	claim
20	102	Tone-enhanced generalized character posterior probability (GCPP) for Cantonese LVCSR	claim
21	101	On maximum mutual information speaker-adapted training	claim
22	100	The Ackermann Award 2008	claim
23	99	Quantified Positive Temporal Constraints	claim
24	98	Superposition for Fixed Domains	claim
25	96	Proving Infinitude of Prime Numbers Using Binomial Coefficients	claim
26	96	Quantitative Game Semantics for Linear Logic	claim
27	94	Pure Pointer Programs with Iteration	claim
28	92	Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint	claim
29	88	An Infinite Automaton Characterization of Double Exponential Time	claim
30	83	Extensional Uniformity for Boolean Circuits	claim
31	80	Syntactic Metatheory of Higher-Order Subtyping	claim
32	80	A Tight Karp-Lipton Collapse Result in Bounded Arithmetic	claim
33	78	Recursion Schemata for NCk	claim
34	76	Molecules as Automata	claim
35	75	On Isomorphisms of Intersection Types	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers