6. LPAR 1999: Tbilisi, Republic of Georgia

Session 1

• Alan Bundy, Julian Richardson:
  Proofs About Lists Using Ellipsis. 1-12
  

Session 2

• Miki Hermann, Laurent Juban, Phokion G. Kolaitis:
  On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. 13-32
  
• Ramón Béjar, Felip Manyà:
  Solving Combinatorial Problems with Regular Local Search Algorithms. 33-43
  
• Anatoli Degtyarev, Alexander V. Lyaletski, Marina K. Morokhovets:
  Evidence Algorithm and Sequent Logical Inference Search. 44-61
  

Session 3

• Serenella Cerrito, Marta Cialdea Mayer, Sébastien Praud:
  First Order Linear Temporal Logic over Finite Time Structures. 62-76
  
• Martin Leucker:
  Model Checking Games for the Alternation-Free µ-Calculus and Alternating Automata. 77-91
  
• Yassin Mokhtari, Stephan Merz:
  Animating TLA Specifications. 92-110
  

Session 4

• Enno Ohlebusch:
  Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems. 111-130
  
• Uwe Waldmann:
  Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups. 131-147
  
• Pierre Réty:
  Regular Sets of Descendants for Constructor-Based Rewrite Systems. 148-160
  

Session 5

• Ian Horrocks, Ulrike Sattler, Stephan Tobies:
  Practical Reasoning for Expressive Description Logics. 161-180
  
• Carsten Lutz:
  Complexity of Terminological Reasoning Revisited. 181-200
  

Session 6

• Georg Gottlob, Christos H. Papadimitriou:
  On the Complexity of Single-Rule Datalog Queries. 201-222
  

Session 7

• René Moreno:
  Abstracting Properties in Concurrent Constraint Programming. 223-237
  
• Roberta Gori:
  A Fixpoint Semantics for Reasoning about Finite Failure. 238-257
  
• Jeremy Gow, Alan Bundy, Ian Green:
  Extensions to the Estimation Calculus. 258-272
  

Session 8

• Eva Hoogland, Maarten Marx, Martin Otto:
  Beth Definability for the Guarded Fragment. 273-285
  
• Michael Dierkes:
  Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas. 286-303
  

Session 9

• Pablo López, Ernesto Pimentel:
  Resource Management in Linear Logic Search Revisited. 304-319
  
• Jean-Marc Andreoli, Roberto Maieli:
  Fucusing and Proof-Nets in Linear and Non-commutative Logic. 321-336
  

Session 10

• Bart Demoen, Konstantinos F. Sagonas:
  CHAT Is Theta(SLG-Wam). 337-357
  
• Nikolay Pelov, Maurice Bruynooghe:
  Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog. 358-375
  
• Elvira Albert, María Alpuente, Michael Hanus, Germán Vidal:
  A Partial Evaluation Framework for Curry Programs. 376-395
  

Last update Sat May 18 19:15:57 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page