Cantitate/Preț
Produs

Logic Programming and Automated Reasoning: 5th International Conference, LPAR '94, Kiev, Ukraine, July 16 - 22, 1994. Proceedings: Lecture Notes in Computer Science, cartea 822

Editat de Frank Pfenning
en Limba Engleză Paperback – 22 iun 1994
This volume presents the proceedings of the 5th International Conference on Logic Programming and Automated Reasoning, held aboard the ship "Marshal Koshevoi" on the Dnieper near Kiev, Ukraine in July 1994. The LPAR conferences are held annually in the former Soviet Union and aimed at bringing together researchers interested in LP and AR.
This proceedings contains the full versions of the 24 accepted papers evaluated by at least three referees ensuring a program of highest quality. The papers cover all relevant aspects of LP and AR ranging from theory to implementation and application.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33323 lei

Preț vechi: 41654 lei
-20% Nou

Puncte Express: 500

Preț estimativ în valută:
6381 6575$ 5355£

Carte tipărită la comandă

Livrare economică 21 februarie-07 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540582168
ISBN-10: 3540582169
Pagini: 364
Ilustrații: XII, 352 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Generalization and reuse of tactic proofs.- Program tactics and logic tactics.- On the relation between the ??-calculus and the syntactic theory of sequential control.- On a proof-theoretical analysis of ? 1 1 -AC, ? 1 1 -DC and ? 1 1 -CA.- Proof plans for the correction of false conjectures.- On the value of antiprenexing.- Implementing a finite-domain CLP-language on top of Prolog: a transformational approach.- RISC-CLP(CF) constraint logic programming over complex functions.- Logical closures.- Higher-order rigid E-unification.- Program extraction in a Logical Framework setting.- Higher-Order Abstract Syntax with induction in Coq.- Towards efficient calculi for resource-oriented deductive planning.- A logic programming framework for the abductive inference of intentions in cooperative dialogues.- Constraint logic programming in the sequent calculus.- On conditional rewrite systems with extra variables and deterministic logic programs.- A bottom-up reconstruction of the well-founded semantics for disjunctive logic programs.- An efficient computation of the extended generalized closed world assumption by support-for-negation sets.- Multi-SLD resolution.- On anti-links.- A generic declarative diagnoser for normal logic programs.- Goal dependent vs. goal independent analysis of logic programs.- A kind of achievement by parts method.- Projection in temporal logic programming.