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…
LACL -- k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages -- Dependency Structure Grammars -- Towards a Computational Treatment of Binding Theory -- Translating Formal Software Specifications to Natural Language -- On the Selective Lambek Calculus -- Grammatical Development with Xmg -- Lambek-Calculus with General Elimination Rules and Continuation …
Invited Papers -- Nonmonotonic Reasoning in FLORA-2 -- Data Integration and Answer Set Programming -- Halo I: A Controlled Experiment for Large Scale Knowledge Base Development -- ASP Foundations -- Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates -- Loops: Relevant or Redundant? -- Approximating Answer Sets of Unitary Lifschitz-Woo Programs -- On Modular Translations and…
OWL: A Description Logic Based Ontology Language -- Preference Reasoning -- The G12 Project: Mapping Solver Independent Models to Efficient Solutions -- Use of Logic Programming for Complex Business Rules -- A Generator of Efficient Abstract Machine Implementations and Its Application to Emulator Minimization -- On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smod…
Independently Checkable Proofs from Decision Procedures: Issues and Progress -- Zap: Automated Theorem Proving for Software Analysis -- Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools -- Scaling Up: Computers vs. Common Sense -- A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem -- Disjunctive Constraint Lambda Calculi -- …
CERES in Many-Valued Logics -- A Decomposition Rule for Decision Procedures by Resolution-Based Calculi -- Abstract DPLL and Abstract DPLL Modulo Theories -- Combining Lists with Non-stably Infinite Theories -- Abstract Model Generation for Preprocessing Clause Sets -- Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying -- Applications of Gen…
Verification and Analysis -- Searching Semantically Equivalent Code Fragments in Logic Programs -- Determinacy Analysis for Logic Programs Using Mode and Type Information -- Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs -- Fully Automatic Binding-Time Analysis for Prolog -- Theory and Security -- Logical Mobility and Locality Types -- Unwinding Conditions for Securit…
Learning to Rank -- Ranking and Scoring Using Empirical Risk Minimization -- Learnability of Bipartite Ranking Functions -- Stability and Generalization of Bipartite Ranking Algorithms -- Loss Bounds for Online Category Ranking -- Boosting -- Margin-Based Ranking Meets Boosting in the Middle -- Martingale Boosting -- The Value of Agreement, a New Boosting Algorithm -- Unlabeled Data, Multiclass…