Restricted Towers of Hanoi and Morphisms -- Collapsing Words: A Progress Report -- Locally Consistent Parsing and Applications to Approximate String Comparisons -- Central Sturmian Words: Recent Developments -- Reversible Cellular Automata -- Inexpressibility Results for Regular Languages in Nonregular Settings -- Complexity of Quantum Uniform and Nonuniform Automata -- Membership and Finitenes…
Short Tour Through the Book -- Simplicity & Uncertainty -- Universal Sequence Prediction -- Agents in Known Probabilistics Environments -- The Universal Algorithmic Agent AIXI -- Important Environmental Classes -- Computational Aspects -- Discussion.Decision Theory = Probability + Utility Theory + + Universal Induction = Ockham + Bayes + Turing = = A Unified View of Artificial Intelligence This…
Invited Papers -- On the Correctness of Operating System Kernels -- Alpha-Structural Recursion and Induction -- Regular Papers -- Shallow Lazy Proofs -- Mechanized Metatheory for the Masses: The PoplMark Challenge -- A Structured Set of Higher-Order Problems -- Formal Modeling of a Slicing Algorithm for Java Event Spaces in PVS -- Proving Equalities in a Commutative Ring Done Right in Coq -- A …
Completeness Theorems and ?-Calculus -- Completeness Theorems and ?-Calculus -- A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract -- Can Proofs Be Animated By Games? -- Contributed Papers -- Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs -- The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recu…
Preface -- Solving Over-Constrained Problems with SAT Technology -- A Symbolic Search Based Approach for Quantified Boolean Formulas -- Substitutional Definition of Satisfiability in Classical Propositional Logic -- A Clause-Based Heuristic for SAT Solvers -- Effective Preprocessing in SAT Through Variable and Clause Elimination -- Resolution and Pebbling Games -- Local and Global Complete Solu…
Invited Talks -- Algorithmic Game Semantics and Static Analysis -- From Typed Process Calculi to Source-Based Security -- Contributed Papers -- Widening Operators for Weakly-Relational Numeric Abstractions -- Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra -- Inference of Well-Typings for Logic Programs with Application to Termination Analysis -- Memory Space Conscious Loop…
Foundations -- Formal Concept Analysis as Mathematical Theory of Concepts and Concept Hierarchies -- Semiconcept and Protoconcept Algebras: The Basic Theorems -- Features of Interaction Between Formal Concept Analysis and Algebraic Geometry -- From Formal Concept Analysis to Contextual Logic -- Contextual Attribute Logic of Many-Valued Attributes -- Treating Incomplete Knowledge in Formal Conce…
Invited Papers -- Bayesian Networks -- Graphical Models -- Learning Causal Networks -- Planning -- Causality and Independence -- Preference Modelling and Decision -- Argumentation Systems -- Inconsistency Handling -- Belief Revision and Merging -- Belief Functions -- Fuzzy Models -- Many-Valued Logical Systems -- Uncertainty Logics -- Probabilistic Reasoning -- Reasoning Models Under Uncertaint…
Research Papers -- An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees -- Guiding Inference Through Relational Reinforcement Learning -- Converting Semantic Meta-knowledge into Inductive Bias -- Learning Teleoreactive Logic Programs from Problem Solving -- A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inver…
Invited Speakers -- A Rewriting Logic Sampler -- Codes and Length-Increasing Transitive Binary Relations -- Languages and Process Calculi for Network Aware Programming – Short Summary - -- Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks -- Component-Based Software Engineering -- Formal Languages -- Outfix-Free Regular Languages and Prime Outfix-Free Decomposi…