default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th LPAR 1999: Tbilisi, Republic of Georgia
- Harald Ganzinger, David A. McAllester, Andrei Voronkov:
Logic Programming and Automated Reasoning, 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, Proceedings. Lecture Notes in Computer Science 1705, Springer 1999, ISBN 3-540-66492-0
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 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-23 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
