Logic programming and automated reasoning : 6th International Conference, LPAR 99 Tbilisi, Georgia, September 6 10, 1999 : proceedings
This volume contains the papers presented at the Sixth International Conference on Logic for Programming and Automated Reasoning (LPAR'99), held in Tbilisi, Georgia, September 6-10, 1999, and hosted by the University of Tbilisi. Forty-four papers were submitted to LPAR'99. Each of the subm...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science. Lecture notes in artificial intelligence
1705 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic programming and automated reasoning, 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, proceedings, Harald Ganzinger, David McAllester, Andrei Voronkov, (eds.), 1999, New York, Springer, 1 vol. (XII-395 p.), Lecture notes in computer science, 3-540-66492-0 • Logic Programming and Automated Reasoning, Texte imprimé, 9783662184653 |
Table des matières:
- Session 1
- Proofs About Lists Using Ellipsis
- Session 2
- On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
- Solving Combinatorial Problems with Regular Local Search Algorithms
- Evidence Algorithm and Sequent Logical Inference Search
- Session 3
- First Order Linear Temporal Logic over Finite Time Structures
- Model Checking Games for the Alternation-Free ?-Calculus and Alternating Automata
- Animating TLA Specifications
- Session 4
- Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
- Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
- Regular Sets of Descendants for Constructor-Based Rewrite Systems
- Session 5
- Practical Reasoning for Expressive Description Logics
- Complexity of Terminological Reasoning Revisited
- Session 6
- On the Complexity of Single-Rule Datalog Queries
- Session 7
- Abstracting Properties in Concurrent Constraint Programming
- A Fixpoint Semantics for Reasoning about Finite Failure
- Extensions to the Estimation Calculus
- Session 8
- Beth Definability for the Guarded Fragment
- Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas
- Session 9
- Resource Management in Linear Logic Proof Search Revisited
- Focusing and Proof-Nets in Linear and Non-commutative Logic
- Session 10
- CHAT Is ? (SLG-WAM)
- Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
- A Partial Evaluation Framework for Curry Programs.