Logic Programming and Automated Reasoning
Editat de Harald Ganzinger, David McAllester, Andrei Voronkoven Limba Engleză Paperback – 25 aug 1999
Preț: 327.12 lei
Preț vechi: 408.89 lei
-20% Nou
Puncte Express: 491
Preț estimativ în valută:
57.88€ • 67.97$ • 50.81£
57.88€ • 67.97$ • 50.81£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540664925
ISBN-10: 3540664920
Pagini: 416
Ilustrații: XII, 404 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.63 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540664920
Pagini: 416
Ilustrații: XII, 404 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.63 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.