Invited Lectures -- ?P Systems and Typed ?-Calculus -- P Automata -- Asynchronous P Systems and P Systems Working in the Sequential Mode -- Evolution and Oscillation in P Systems: Applications to Biological Phenomena -- An Approach to Computational Complexity in Membrane Computing -- LMNtal: A Language Model with Links and Membranes -- Regular Presentations -- Executable Specifications of P Sys…
A Portrait of a Scientist: Logic, AI and Politics -- A Portrait of a Scientist: Logic, AI and Politics -- Logic and Deduction -- Some Reflections on Proof Transformations -- Rewrite and Decision Procedure Laboratory: Combining Rewriting, Satisfiability Checking, and Lemma Speculation -- SAT-Based Decision Procedures for Automated Reasoning: A Unifying Perspective -- Temporal Dynamics of Support…
Invited Lectures -- Algorithmic Randomness, Quantum Physics, and Incompleteness -- On the Complexity of Universal Programs -- Finite Sets of Words and Computing -- Universality and Cellular Automata -- Leaf Language Classes -- Selected Contributions -- Computational Completeness of P Systems with Active Membranes and Two Polarizations -- Computing with a Distributed Reaction-Diffusion Model -- …
Invited Talks -- Data Analysis in the Life Sciences — Sparking Ideas — -- Machine Learning for Natural Language Processing (and Vice Versa?) -- Statistical Relational Learning: An Inductive Logic Programming Perspective -- Recent Advances in Mining Time Series Data -- Focus the Mining Beacon: Lessons and Challenges from the World of E-Commerce -- Data Streams and Data Synopses for Massive D…
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…
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 …