Logic Programming and Automated Reasoning 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Ganzinger, Harald (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), McAllester, David (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Voronkov, Andrei (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
• Έκδοση: 1st ed. 1999.
• Σειρά: Lecture Notes in Artificial Intelligence ; 1705
• Θέματα: Artificial intelligence.; Architecture, Computer.; Computer logic.; Computer programming.; Mathematical logic.; Artificial Intelligence.; Computer System Implementation.; Logics and Meanings of Programs.; Programming Techniques.; Mathematical Logic and Formal Languages.

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...

Πίνακας περιεχομένων:

• 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.