Papers accepted to LPAR'99
Invited talks
-
Yuri Gurevich (Microsoft research)
Title to be announced
-
Daniel Leivant (University of Indiana)
Title to be announced
Regular papers
-
Miki Hermann (LORIA, Nancy),
Laurent Juban (LORIA, Nancy),
Phokion G. Kolaitis (University of California at Santa Cruz)
On the Complexity of Counting the Hilbert Basis of a Linear Diophantine
System
-
Enno Ohlebusch (University of Bilefeld)
Transforming Conditional Rewrite Systems with Extra Variables into
Unconditional Systems
-
Ian Horrock (University of Manchester),
Ulrike Sattler (RWTH Aachen),
Stephan Tobies (RWTH Aachen)
Practical Reasoning for Expressive Description Logics
-
Bart Demoen (KU Leuven),
Konstantinos Sagonas (Uppsala University)
CHAT is $\Theta$(SLG-WAM)
-
Georg Gottlob (Vienna University of Technology),
Christos Papadimitriou (Berkeley)
On the Complexity of Single-Rule Datalog Queries
-
Pablo Lopez,
Ernesto Pimentel (Universidad de Malaga)
Resource Management in Linear Logic Proof Search Revisited
-
Elvira Albert (Universidad Politecnica de Valencia),
Maria Alpuente (Universidad Politecnica de Valencia),
Michael Hanus (Informatik II, RWTH Aachen),
German Vidal (Universidad Politecnica de Valencia)
A Partial Evaluation Framework for Curry Programs
-
Rene Moreno (University of Pisa)
Abstracting Properties in Concurrent Constraint Programming
-
Michael Dierkes (LEIBNIZ - IMAG)
Simplification of Horn Clauses that are Clausal Forms of Guarded Formulas
-
Carsten Lutz (RWTH Aachen)
Complexity of Terminological Reasoning Revisited
-
Pierre Rety (University of Orleans, France)
Regular Sets of Descendants for Constructor-based Rewrite Systems
-
Jeremy Gow,
Alan Bundy,
Ian Green (Univ. of Edinburgh)
Extensions to the Estimation Calculus
-
Alan Bundy,
Julian Richardson (University of Edinburgh)
Proofs About Lists Using Ellipsis
-
Uwe Waldmann (Max-Planck-Institut für Informatik, Saarbrücken)
Cancellative Superposition Decides the Theory of Divisible Torsion-Free
Abelian Groups
-
Roberta Gori (University of Pisa)
A fixpoint semantics for reasoning about finite failure
-
Serenella Cerrito (University Paris 11),
Marta Cialdea Mayer (University Roma Tre),
Sebastien Praud (University Paris 11)
First Order Linear Temporal Logic over Finite Time Structures
-
Nikolay Pelov,
Maurice Bruynooghe (Katholieke Universiteit Leuven)
Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
-
Stephan MERZ (TU Muenchen),
Yassine Mokhtari (LORIA)
Efficiently executable TLA
-
Eva Hoogland (University of Amsterdam),
Maarten Marx (University of Amsterdam),
Martin Otto (RWTH Aachen)
Beth definability for the guarded fragment
-
Jean-Marc Andreoli (Xerox Research Centre Europe),
Roberto Maieli (Universit`a di Roma)
Focusing and Proof-Nets in Linear and Non-Commutative Logic
-
A.I. Degtyarev (Uppsala University),
A.V.Lyaletski (Inst. of Cybernetics, Kiev),
M.K. Morokhovets (Inst. of Cybernetics, Kiev)
Evidence Algorithm and sequent-style logical inference search
-
Ramon Bejar,
Felip Manya (Universitat de Lleida, Spain)
Solving Combinatorial Problems with Regular Local Search Algorithms
-
Martin Leucker (Aachen University of Technology, Germany)
Model Checking Games for the Alternation-Free $\mu$-Calculus and Alternating Automata
Poster session
This list will be extended.
-
Wojciech Penczek (Institute of Computer
Science, Warsaw),
Rob Gerth (INTEL),
Ruurd Kuiper (Eindhoven University of Technology)
Partial Order Reductions Preserving Simulations
-
Domenico Cantone (University of Catania),
Alberto G. Zarba (University of Catania),
Andrea Formisano (University "La Sapienza"),
Eugenio G. Omodeo (University of L'Aquila)
Folding Quantifiers into Map Composition
-
Emmanouil Marakakis (Technological
Educational Institute of Heraklion)
Correctness of Logic Programs Constructed by a
Schema-Based Method