Logic Programming and Automated Reasoning
Editat de Frank Pfenningen Limba Engleză Paperback – 22 iun 1994
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.
Preț: 325.44 lei
Preț vechi: 406.80 lei
-20%
Puncte Express: 488
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540582168
ISBN-10: 3540582169
Pagini: 364
Ilustrații: XII, 352 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540582169
Pagini: 364
Ilustrații: XII, 352 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.