Table of Contents

• OWL: A Description Logic Based Ontology LanguageIan Horrocks. 1-4 [doi]
• Preference ReasoningFrancesca Rossi. 5-8 [doi]
• The G12 Project: Mapping Solver Independent Models to Efficient SolutionsPeter J. Stuckey, Maria J. García de la Banda, Michael J. Maher, Kim Marriott, John K. Slaney, Zoltan Somogyi, Mark Wallace, Toby Walsh. 9-13 [doi]
• Use of Logic Programming for Complex Business RulesWalter G. Wilson. 14-20 [doi]
• A Generator of Efficient Abstract Machine Implementations and Its Application to Emulator MinimizationJosé F. Morales, Manuel Carro, Germán Puebla, Manuel V. Hermenegildo. 21-36 [doi]
• On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels)Enrico Giunchiglia, Marco Maratea. 37-51 [doi]
• Towards an Integration of Answer Set and Constraint SolvingSabrina Baselice, Piero A. Bonatti, Michael Gelfond. 52-66 [doi]
• A Comparison of CLP(FD) and ASP Solutions to NP-Complete ProblemsAgostino Dovier, Andrea Formisano, Enrico Pontelli. 67-82 [doi]
• Guard and Continuation Optimization for Occurrence Representations of CHRJon Sneyers, Tom Schrijvers, Bart Demoen. 83-97 [doi]
• Coordination of Many AgentsJoxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu. 98-112 [doi]
• Parallelizing Union-Find in Constraint Handling Rules Using Confluence AnalysisThom W. Frühwirth. 113-127 [doi]
• An Optimised Semantic Web Query Language Implementation in PrologJan Wielemaker. 128-142 [doi]
• A Distributed and Probabilistic Concurrent Constraint Programming LanguageLuca Bortolussi, Herbert Wiklicky. 143-158 [doi]
• HYPROLOG: A New Logic Programming Language with Assumptions and AbductionHenning Christiansen, Verónica Dahl. 159-173 [doi]
• Abduction of Linear Arithmetic ConstraintsMichael J. Maher. 174-188 [doi]
• Towards Implementations for Advanced Equivalence Checking in Answer-Set ProgrammingHans Tompits, Stefan Woltran. 189-203 [doi]
• Hybrid Probabilistic Logic Programs with Non-monotonic NegationEmad Saad, Enrico Pontelli. 204-220 [doi]
• Reducing Inductive Definitions to Propositional SatisfiabilityNikolay Pelov, Eugenia Ternovska. 221-234 [doi]
• Symbolic Support Graph: A Space Efficient Data Structure for Incremental Tabled EvaluationDiptikalyan Saha, C. R. Ramakrishnan. 235-249 [doi]
• Dynamic Mixed-Strategy Evaluation of Tabled Logic ProgramsRicardo Rocha, Fernando M. A. Silva, Vítor Santos Costa. 250-264 [doi]
• Nondeterminism Analysis of Functional Logic ProgramsBernd Braßel, Michael Hanus. 265-279 [doi]
• Techniques for Scaling Up Analyses Based on Pre-interpretationsJohn P. Gallagher, Kim S. Henriksen, Gourinath Banda. 280-296 [doi]
• Deductive Multi-valued Model CheckingAjay Mallya. 297-310 [doi]
• Polynomial Interpretations as a Basis for Termination Analysis of Logic ProgramsManh Thang Nguyen, Danny De Schreye. 311-325 [doi]
• Testing for Termination with Monotonicity ConstraintsMichael Codish, Vitaly Lagoon, Peter J. Stuckey. 326-340 [doi]
• A Well-Founded Semantics with DisjunctionJoão Alcântara, Carlos Viegas Damásio, Luís Moniz Pereira. 341-355 [doi]
• Semantics of Framed Temporal Logic ProgramsZhenhua Duan, Xiaoxiao Yang, Maciej Koutny. 356-370 [doi]
• Practical Higher-Order Pattern Unification with On-the-Fly RaisingGopalan Nadathur, Natalie Linnell. 371-386 [doi]
• Small Proof Witnesses for LFSusmit Sarkar, Brigitte Pientka, Karl Crary. 387-401 [doi]
• A Type System for CHREmmanuel Coquery, François Fages. 402-403 [doi]
• Decision Support for Personalization on Mobile DevicesThomas Kleemann, Alex Sinner. 404-406 [doi]
• A Generic Framework for the Analysis and Specialization of Logic ProgramsGermán Puebla, Elvira Albert, Manuel V. Hermenegildo. 407-409 [doi]
• The Need for Ancestor Resolution When Answering Queries in Horn Clause LogicOliver Ray. 410-411 [doi]
• Modeling Systems in CLPJoxan Jaffar, Andrew E. Santosa, Razvan Voicu. 412-413 [doi]
• A Sufficient Condition for Strong Equivalence Under the Well-Founded SemanticsChristos Nomikos, Panos Rondogiannis, William W. Wadge. 414-415 [doi]
• IMPACT: Innovative Models for Prolog with Advanced Control and TablingRicardo Rocha, Ricardo Lopes, Fernando M. A. Silva, Vítor Santos Costa. 416-417 [doi]
• Using CLP to Characterise Linguistic Lattice Boundaries in a Text Mining ProcessAlexandre S. Saidi. 418-420 [doi]
• Hybridization of Genetic Algorithms and Constraint Propagation for the BACPTony Lambert, Carlos Castro, Eric Monfroy, María-Cristina Riff, Frédéric Saubion. 421-423 [doi]
• The MYDDAS Project: Using a Deductive Database for Traffic CharacterizationMichel Ferreira. 424-426 [doi]
• Open World Reasoning in DatalogGergely Lukácsy, Zsolt Nagy. 427-428 [doi]
• Optimizing Queries for Heterogeneous Information SourcesAndrás Gyorgy Békés. 429-430 [doi]
• Denotational Semantics Using Horn Concurrent Transaction LogicMarcus Vinicius Santos. 431-432 [doi]
• Gentra4cp: A Generic Trace Format for Constraint ProgrammingLudovic Langevine. 433-434 [doi]
• Analyses, Optimizations and Extensions of Constraint Handling Rules: Ph.D. SummaryTom Schrijvers. 435-436 [doi]
• Formalization and Verification of Interaction ProtocolsFederico Chesani. 437-438 [doi]
• PS-LTL for Constraint-Based Security Protocol AnalysisRicardo Corin, Ari Saptawijaya, Sandro Etalle. 439-440 [doi]
• Concurrent Methodologies for Global OptimizationLuca Bortolussi. 441-443 [doi]
• A Temporal Programming Language for Heterogeneous Information SystemsVítor Nogueira. 444-445 [doi]
• Nonmonotonic Logic Programs for the Semantic WebRoman Schindlauer. 446-447 [doi]
• ICLP 2005 Doctoral ConsortiumRémy Haemmerlé. 448-449 [doi]
• Analysis and Optimization of CHR ProgramsJon Sneyers. 450-451 [doi]