ISBN-10:
3540664920
ISBN-13:
9783540664925
Pub. Date:
09/24/1999
Publisher:
Springer Berlin Heidelberg
Logic Programming and Automated Reasoning: 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, Proceedings / Edition 1

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

Paperback

Current price is , Original price is $119.0. You
Select a Purchase Option (1999)
  • purchase options
    $80.22 $119.00 Save 33% Current price is $80.22, Original price is $119. You Save 33%.
  • purchase options

Product Details

ISBN-13: 9783540664925
Publisher: Springer Berlin Heidelberg
Publication date: 09/24/1999
Series: Lecture Notes in Computer Science , #1705
Edition description: 1999
Pages: 404
Product dimensions: 6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

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.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews