Table of Contents

• Why Use Datalog to Analyze Programs?Monica S. Lam. 1 [doi]
• Semantic Web: The Story of the RIFt so FarChristopher A. Welty. 2 [doi]
• Overcoming Performance Barriers: Efficient Verification Techniques for Logical FrameworksBrigitte Pientka. 3-10 [doi]
• Tableau Calculi for Answer Set ProgrammingMartin Gebser, Torsten Schaub. 11-25 [doi]
• Declarative Semantics of Production Rules for Integrity MaintenanceLuciano Caroprese, Sergio Greco, Cristina Sirangelo, Ester Zumpano. 26-40 [doi]
• Modules for Prolog RevisitedRémy Haemmerlé, François Fages. 41-55 [doi]
• A Local Algorithm for Incremental Evaluation of Tabled Logic ProgramsDiptikalyan Saha, C. R. Ramakrishnan. 56-71 [doi]
• Memory Reuse for CHRJon Sneyers, Tom Schrijvers, Bart Demoen. 72-86 [doi]
• Overlapping Rules and Logic Variables in Functional Logic Programs Sergio Antoy, Michael Hanus. 87-101 [doi]
• Towards Propagation = Logic + Control Sebastian Brand, Roland H. C. Yap. 102-116 [doi]
• ACD Term RewritingGregory J. Duck, Peter J. Stuckey, Sebastian Brand. 117-131 [doi]
• Detecting Determinacy in Prolog ProgramsAndy King, Lunjin Lu, Samir Genaim. 132-147 [doi]
• Collapsing ClosuresXuan Li, Andy King, Lunjin Lu. 148-162 [doi]
• Reduced Certificates for Abstraction-Carrying CodeElvira Albert, Puri Arenas-Sánchez, Germán Puebla, Manuel V. Hermenegildo. 163-178 [doi]
• Proving Properties of Constraint Logic Programs by Eliminating Existential VariablesAlberto Pettorossi, Maurizio Proietti, Valerio Senni. 179-195 [doi]
• ::::Justifications:::: for Logic Programs Under Answer Set SemanticsEnrico Pontelli, Tran Cao Son. 196-210 [doi]
• Generality Relations in Answer Set ProgrammingKatsumi Inoue, Chiaki Sakama. 211-225 [doi]
• Cooperating Answer Set ProgrammingDavy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir. 226-241 [doi]
• Predicate Introduction Under Stable and Well-Founded SemanticsJohan Wittocx, Joost Vennekens, Maarten Mariën, Marc Denecker, Maurice Bruynooghe. 242-256 [doi]
• Improving the ISO Prolog Standard by Analyzing Compliance Test ResultsPeter Szabó, Péter Szeredi. 257-269 [doi]
• TOAST: Applying Answer Set Programming to SuperoptimisationMartin Brain, Tom Crick, Marina De Vos, John Fitch. 270-284 [doi]
• Modelling Biological Networks by Action Languages Via Answer Set ProgrammingSusanne Grell, Torsten Schaub, Joachim Selbig. 285-299 [doi]
• Using Answer Set Programming for the Automatic Compilation of Assessment TestsPetra Schwaiger, Burkhard Freitag. 300-314 [doi]
• Compositional Semantics for the Procedural Interpretation of LogicMaarten H. van Emden. 315-329 [doi]
• Coinductive Logic ProgrammingLuke Simon, Ajay Mallya, Ajay Bansal, Gopal Gupta. 330-345 [doi]
• Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium LogicPedro Cabalar, Sergei P. Odintsov, David Pearce, Agustín Valverde. 346-360 [doi]
• The Semantics of Nominal Logic ProgramsJames Cheney. 361-375 [doi]
• Macros, Macro Calls and Use of Ensembles in Modular Answer Set ProgrammingChitta Baral, Juraj Dzifcak, Hiro Takahashi. 376-390 [doi]
• Deductive Spreadsheets Using Tabled Logic ProgrammingC. R. Ramakrishnan, I. V. Ramakrishnan, David Scott Warren. 391-405 [doi]
• Using a Logic Programming Framework to Control Database Query Dialogues in Natural LanguageLuis Quintano, Irene Pimenta Rodrigues. 406-420 [doi]
• Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic ProgrammingRafael Caballero, Mario Rodríguez-Artalejo, Rafael del Vado Vírseda. 421-422 [doi]
• Solving First-Order Constraints in the Theory of the Evaluated TreesThi-Bich-Hanh Dao, Khalil Djelloul. 423-424 [doi]
• Relaxation on Optimization PredicatesHai-Feng Guo, Miao Liu, Bharat Jayaraman. 425-426 [doi]
• Handling Incomplete and Complete Tables in Tabled Logic ProgramsRicardo Rocha. 427-428 [doi]
• An External Module for Implementing Linear Tabling in PrologCláudio Silva, Ricardo Rocha, Ricardo Lopes. 429-430 [doi]
• Using Combined Static Analysis and Profiling for Logic Program Execution Time EstimationEdison Mera, Pedro López-García, Germán Puebla, Manuel Carro, Manuel V. Hermenegildo. 431-432 [doi]
• Towards Region-Based Memory Management for Mercury ProgramsQuan Phan, Gerda Janssens. 433-435 [doi]
• Towards Structured Contexts and ModulesSalvador Abreu, Vítor Nogueira. 436-438 [doi]
• Towards Temporal Contextual Logic ProgrammingVítor Nogueira, Salvador Abreu. 439-441 [doi]
• Semantic Property Grammars for Knowledge Extraction from Biomedical TextVerónica Dahl, Baohua Gu. 442-443 [doi]
• Natural Language Processing Using Lexical and Logical CombinatorsJuan Fernández Ortiz, Jørgen Villadsen. 444-446 [doi]
• Learning Semantic Parsers: A Constraint Handling Rule ApproachDulce Aguilar-Solis. 447-448 [doi]
• A Declarative Framework for Security: Secure Concurrent Constraint ProgrammingHugo A. López, Catuscia Palamidessi, Jorge Andrés Pérez, Camilo Rueda, Frank D. Valencia. 449-450 [doi]
• Logic Programming in Knowledge DomainsAndrei Mantsivoda, Vladimir Lipovchenko, Anton Malykh. 451-452 [doi]
• Logtalk Processing of STEP Part 21 FilesPaulo Moura, Vincent Marchetti. 453-454 [doi]
• Integrating Datalog with OWL: Exploring the AL-log ApproachEdna Ruckhaus, Vladimir Kolovski, Bijan Parsia, Bernardo Cuenca Grau. 455-456 [doi]
• LMNtal as a Unifying Declarative Language: Live DemonstrationKazunori Ueda, Norio Kato, Koji Hara, Ken Mizuno. 457-458 [doi]
• Declarative Problem Solving Using Answer Set SemanticsMartin Brain. 459-460 [doi]
• The Design and Implementation of the YAP Compiler: An Optimizing Compiler for Logic Programming LanguagesAnderson Faustino da Silva, Vítor Santos Costa. 461-462 [doi]
• Description Logic Reasoning in PrologGergely Lukácsy. 463-464 [doi]
• Static Memory Management for Logic Programming LanguagesQuan Phan. 465-466 [doi]
• Deductive Databases: Implementation, Parallelism and ApplicationsTiago Soares. 467-468 [doi]
• Efficient Reasoning About Action and Change in the Presence of Incomplete Information and Its Application in PlanningPhan Huy Tu. 469-470 [doi]
• Deducing Logic ProgramsKa-shu Wong. 471-472 [doi]