Invited Talks

• 
  Monica S. Lam: Why Use Datalog to Analyze Programs? 1
• 
  Christopher A. Welty: Semantic Web: The Story of the RIFt so Far. 2

Invited Tutorial

• 
  Brigitte Pientka: Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks. 3-10

Theory

• 
  Martin Gebser, Torsten Schaub: Tableau Calculi for Answer Set Programming. 11-25
• 
  Luciano Caroprese, Sergio Greco, Cristina Sirangelo, Ester Zumpano: Declarative Semantics of Production Rules for Integrity Maintenance. 26-40
• 
  Rémy Haemmerlé, François Fages: Modules for Prolog Revisited. 41-55
• 
  Diptikalyan Saha, C. R. Ramakrishnan: A Local Algorithm for Incremental Evaluation of Tabled Logic Programs. 56-71

Functional and Constraint Logic Programming

• 
  Jon Sneyers, Tom Schrijvers, Bart Demoen: Memory Reuse for CHR. 72-86
• 
  Sergio Antoy, Michael Hanus: Overlapping Rules and Logic Variables in Functional Logic Programs . 87-101
• 
  Sebastian Brand, Roland H. C. Yap: Towards "Propagation = Logic + Control". 102-116
• 
  Gregory J. Duck, Peter J. Stuckey, Sebastian Brand: ACD Term Rewriting. 117-131

Program Analysis

• 
  Andy King, Lunjin Lu, Samir Genaim: Detecting Determinacy in Prolog Programs. 132-147
• 
  Xuan Li, Andy King, Lunjin Lu: Collapsing Closures. 148-162
• 
  Elvira Albert, Puri Arenas-Sánchez, Germán Puebla, Manuel V. Hermenegildo: Reduced Certificates for Abstraction-Carrying Code. 163-178
• 
  Alberto Pettorossi, Maurizio Proietti, Valerio Senni: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables. 179-195

Answer-Set Programming

• 
  Enrico Pontelli, Tran Cao Son: Justifications for Logic Programs Under Answer Set Semantics. 196-210
• 
  Katsumi Inoue, Chiaki Sakama: Generality Relations in Answer Set Programming. 211-225
• 
  Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir: Cooperating Answer Set Programming. 226-241
• 
  Johan Wittocx, Joost Vennekens, Maarten Mariën, Marc Denecker, Maurice Bruynooghe: Predicate Introduction Under Stable and Well-Founded Semantics. 242-256

Special Interest Paper

• 
  Peter Szabó, Péter Szeredi: Improving the ISO Prolog Standard by Analyzing Compliance Test Results. 257-269

Applications I

• 
  Martin Brain, Tom Crick, Marina De Vos, John Fitch: TOAST: Applying Answer Set Programming to Superoptimisation. 270-284
• 
  Susanne Grell, Torsten Schaub, Joachim Selbig: Modelling Biological Networks by Action Languages Via Answer Set Programming. 285-299
• 
  Petra Schwaiger, Burkhard Freitag: Using Answer Set Programming for the Automatic Compilation of Assessment Tests. 300-314

Semantics

• 
  Maarten H. van Emden: Compositional Semantics for the Procedural Interpretation of Logic. 315-329
• 
  Luke Simon, Ajay Mallya, Ajay Bansal, Gopal Gupta: Coinductive Logic Programming. 330-345
• 
  Pedro Cabalar, Sergei P. Odintsov, David Pearce, Agustín Valverde: Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic. 346-360
• 
  James Cheney: The Semantics of Nominal Logic Programs. 361-375

Applications II

• 
  Chitta Baral, Juraj Dzifcak, Hiro Takahashi: Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming. 376-390
• 
  C. R. Ramakrishnan, I. V. Ramakrishnan, David Scott Warren: Deductive Spreadsheets Using Tabled Logic Programming. 391-405
• 
  Luis Quintano, Irene Pimenta Rodrigues: Using a Logic Programming Framework to Control Database Query Dialogues in Natural Language. 406-420

Poster Presentations

• 
  Rafael Caballero, Mario Rodríguez-Artalejo, Rafael del Vado Vírseda: Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming. 421-422
• 
  Thi-Bich-Hanh Dao, Khalil Djelloul: Solving First-Order Constraints in the Theory of the Evaluated Trees. 423-424
• 
  Hai-Feng Guo, Miao Liu, Bharat Jayaraman: Relaxation on Optimization Predicates. 425-426
• 
  Ricardo Rocha: Handling Incomplete and Complete Tables in Tabled Logic Programs. 427-428
• 
  Cláudio Silva, Ricardo Rocha, Ricardo Lopes: An External Module for Implementing Linear Tabling in Prolog. 429-430
• 
  Edison Mera, Pedro López-García, Germán Puebla, Manuel Carro, Manuel V. Hermenegildo: Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation. 431-432
• 
  Quan Phan, Gerda Janssens: Towards Region-Based Memory Management for Mercury Programs. 433-435
• 
  Salvador Abreu, Vítor Nogueira: Towards Structured Contexts and Modules. 436-438
• 
  Vítor Nogueira, Salvador Abreu: Towards Temporal Contextual Logic Programming. 439-441
• 
  Verónica Dahl, Baohua Gu: Semantic Property Grammars for Knowledge Extraction from Biomedical Text. 442-443
• 
  Juan Fernández Ortiz, Jørgen Villadsen: Natural Language Processing Using Lexical and Logical Combinators. 444-446
• 
  Dulce Aguilar-Solis: Learning Semantic Parsers: A Constraint Handling Rule Approach. 447-448
• 
  Hugo A. López, Catuscia Palamidessi, Jorge Andrés Pérez, Camilo Rueda, Frank D. Valencia: A Declarative Framework for Security: Secure Concurrent Constraint Programming. 449-450
• 
  Andrei Mantsivoda, Vladimir Lipovchenko, Anton Malykh: Logic Programming in Knowledge Domains. 451-452
• 
  Paulo Moura, Vincent Marchetti: Logtalk Processing of STEP Part 21 Files. 453-454
• 
  Edna Ruckhaus, Vladimir Kolovski, Bijan Parsia, Bernardo Cuenca Grau: Integrating Datalog with OWL: Exploring the AL-log Approach. 455-456
• 
  Kazunori Ueda, Norio Kato, Koji Hara, Ken Mizuno: LMNtal as a Unifying Declarative Language: Live Demonstration. 457-458

Doctoral Consortium Presentations

• 
  Martin Brain: Declarative Problem Solving Using Answer Set Semantics. 459-460
• 
  Anderson Faustino da Silva, Vítor Santos Costa: The Design and Implementation of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages. 461-462
• 
  Gergely Lukácsy: Description Logic Reasoning in Prolog. 463-464
• 
  Quan Phan: Static Memory Management for Logic Programming Languages. 465-466
• 
  Tiago Soares: Deductive Databases: Implementation, Parallelism and Applications. 467-468
• 
  Phan Huy Tu: Efficient Reasoning About Action and Change in the Presence of Incomplete Information and Its Application in Planning. 469-470
• 
  Ka-Shu Wong: Deducing Logic Programs. 471-472

last updated on Sat May 18 05:05:39 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page