CICLing 2005 (www.CICLing.org) was the 6th Annual Conference on Intelligent Text Processing and Computational Linguistics. It was intended to provide a balanced view of the cutting-edge developments in both the theoretical foundations of computational linguistics and the practice of natural-language text processing with its numerous applications. A feature of CICLing conferences is their wide s…
Topology and Calculus -- Limits and Topology -- Differentiability -- Inverse and Implicit Functions -- Integration -- The Fundamental Theorem of Calculus and Fubini’s Theorem -- Vector Fields -- Fixpoints -- Main Theorem of ODEs -- Third Advanced Topic -- Selected Higher Subjects -- Categories -- Splines -- Fourier Theory -- Wavelets -- Fractals -- Neural Networks -- Probability Theory -- Lam…
Prologue -- Generalizing Proofs-as-Programs -- Functional Program Synthesis -- The Curry-Howard Protocol -- Imperative Proofs-as-Programs -- Intuitionistic Hoare Logic -- Properties of Intuitionistic Hoare Logic -- Proofs-as-Imperative-Programs -- Structured Proofs-as-Programs -- Reasoning about Structured Specifications -- Proof-theoretic Properties of SSL -- Structured Proofs-as-Programs -- G…
Full Papers -- Verifying the Incorrectness of Programs and Automata -- Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains -- Synthesizing Plans for Multiple Domains -- Abstract Policy Evaluation for Reactive Agents -- Implementing an Abstraction Framework for Soft Constraints -- Transforming and Refining Abstract Constraint Specifications -- Learning Regular Expres…
Probabilistic guarded commands and their refinement logic -- to pGCL: Its logic and its model -- Probabilistic loops: Invariants and variants -- Case studies in termination: Choice coordination, the dining philosophers, and the random walk -- Probabilistic data refinement: The steam boiler -- Semantic structures -- Theory for the demonic model -- The geometry of probabilistic programs -- Proved…
Algorithmic Problems & Their Complexity -- Fundamental Complexity Classes -- Reductions — Algorithmic Relationships Between Problems -- The Theory of NP-Completeness -- NP-complete and NP-equivalent Problems -- The Complexity Analysis of Problems -- The Complexity of Approximation Problems — Classical Results -- The Complexity of Black Box Problems -- Additional Complexity Classes and Relat…
Invited Talk -- When Abstraction Fails -- Compilation -- Source-Level Debugging for Multiple Languages with Modest Programming Effort -- Compilation of Generic Regular Path Expressions Using C++ Class Templates -- XML Goes Native: Run-Time Representations for Xtatic -- Parallelism -- Boosting the Performance of Multimedia Applications Using SIMD Instructions -- Task Partitioning for Multi-core …
Towards Generic Pattern Mining -- Conceptual Exploration of Semantic Mirrors -- Towards a Formal Concept Analysis Approach to Exploring Communities on the World Wide Web -- Automatic Selection of Noun Phrases as Document Descriptors in an FCA-Based Information Retrieval System -- Combining Spatial and Lattice-Based Information Landscapes -- Explaining the Structure of FrameNet with Concept Latt…
Keynote Talks -- Formal Aids for the Growth of Software Systems -- Formal Methods and Testing: Hypotheses, and Correctness Approximations -- The Natural History of Bugs: Using Formal Methods to Analyse Software Related Failures in Space Missions -- Object Orientation -- Modular Verification of Static Class Invariants -- Decoupling in Object Orientation -- Controlling Object Allocation Using Cre…
Classification and Model Estimation -- On ECOC as Binary Ensemble Classifiers -- Incremental Classification Rules Based on Association Rules Using Formal Concept Analysis -- Parameter Inference of Cost-Sensitive Boosting Algorithms -- Finite Mixture Models with Negative Components -- MML-Based Approach for Finite Dirichlet Mixture Estimation and Selection -- Principles of Multi-kernel Data Mini…