CSL 2007 - PDF Preprint Papers

CSL 2007 Workshop on Computer Science Logic

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CSL-2007 Paper

click to vote

CSL
2007
Springer

212views Automated Reasoning» more CSL 2007»

Proofs, Programs and Abstract Complexity

14 years 6 months ago

Download math.ipm.ac.ir

Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being �...

Arnold Beckmann

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	212	Proofs, Programs and Abstract Complexity	claim
2	178	On Acyclic Conjunctive Queries and Constant Delay Enumeration	claim
3	158	Articulatory feature recognition using dynamic Bayesian networks	claim
4	156	From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic	claim
5	151	Automatic phonetic transcription of large speech corpora	claim
6	151	On noise masking for automatic missing data speech recognition: A survey and discussion	claim
7	146	Clique-Width and Parity Games	claim
8	145	On the Complexity of Reasoning About Dynamic Policies	claim
9	140	Propositional Logic for Circuit Classes	claim
10	134	A Cut-Free and Invariant-Free Sequent Calculus for PLTL	claim
11	134	Comparing the Expressive Power of Well-Structured Transition Systems	claim
12	133	Forest Expressions	claim
13	133	Accessing speech data using strategic fixation	claim
14	126	Focusing and Polarization in Intuitionistic Logic	claim
15	126	Partially observable Markov decision processes for spoken dialog systems	claim
16	125	Unbounded Proof-Length Speed-Up in Deduction Modulo	claim
17	125	The Theory of Calculi with Explicit Substitutions Revisited	claim
18	121	The Ackermann Award 2007	claim
19	120	Incorporating Tables into Proofs	claim
20	119	Discriminative n-gram language modeling	claim
21	117	Game Characterizations and the PSPACE-Completeness of Tree Resolution Space	claim
22	116	Iterative reconstruction of speech from short-time Fourier transform phase and magnitude spectra	claim
23	114	Speaker-adaptive learning of resonance targets in a hidden trajectory model of speech coarticulation	claim
24	111	Model-Checking First-Order Logic: Automata and Locality	claim
25	109	Linear Realizability	claim
26	107	Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping	claim
27	107	Discriminative semi-parametric trajectory model for speech recognition	claim
28	106	Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete	claim
29	102	Classical and Intuitionistic Logic Are Asymptotically Identical	claim
30	102	'Early recognition' of polysyllabic words in continuous speech	claim
31	97	Synthesized speech intelligibility and persuasion: Speech rate and non-native listeners	claim
32	96	Continuous Previsions	claim
33	96	Integrating Linear Arithmetic into Superposition Calculus	claim
34	96	MSO on the Infinite Binary Tree: Choice and Order	claim
35	94	The Power of Counting Logics on Restricted Classes of Finite Structures	claim
36	93	Building Decision Procedures in the Calculus of Inductive Constructions	claim
37	93	Qualitative Temporal and Spatial Reasoning Revisited	claim
38	93	Typed Normal Form Bisimulation	claim
39	93	Lambda Theories of Effective Lambda Models	claim
40	92	A Games Model of Bunched Implications	claim
41	92	Structure Theorem and Strict Alternation Hierarchy for FO2 on Words	claim
42	91	Bad Variables Under Control	claim
43	89	Classical Program Extraction in the Calculus of Constructions	claim
44	89	Ginisupport vector machines for segmental minimum Bayes risk decoding of continuous speech	claim
45	87	Omega-Regular Half-Positional Winning Conditions	claim
46	84	Tightening the Exchange Rates Between Automata	claim
47	77	Logical Refinements of Church's Problem	claim
48	76	Not Enough Points Is Enough	claim
49	76	Soft indexing of speech content for search in spoken documents	claim
50	75	Satisfiability of a Spatial Logic with Tree Variables	claim
51	75	Modeling durations of syllables using neural networks	claim
52	73	Relativizing Small Complexity Classes and Their Theories	claim
53	69	Stochastic and syntactic techniques for predicting phrase breaks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers