Logic Programming and Automated Reasoning de Andrei Voronkov

Logic Programming and Automated Reasoning: International Conference LPAR '92, St.Petersburg, Russia, July 15-20, 1992. Proceedings: Lecture Notes in Computer Science, cartea 624

Andrei Voronkov

This volume contains the proceedings of LPAR '92, theinternational conference on logic programming and automatedreasoning held in St. Petersburg in July 1992. The aim ofthe conference was to bring together researchers from theRussian and the international logic programming and theoremproving communities.The topics of interest covered by papers inthe volumeinclude automated theorem proving, non-monotonic reasoning,applications of mathematical logic to computer science,deductive databases, implementation of declarative concepts,and programming in non-classical logics.LPAR '92 is the successor of the First and Second RussianConferences on Logic Programming held in 1990 and 1991,respectively, the proceedings of which were publishedinLNAI Vol. 592.

Citește tot Restrânge

	Preț	Express
Paperback (2)	325^.30 lei 6-8 săpt.
Springer Berlin, Heidelberg – 29 iun 1993	325^.30 lei 6-8 săpt.
Springer Berlin, Heidelberg – iul 1992	330^.85 lei 6-8 săpt.

Preț

Express

Paperback (2)

325^.30 lei 6-8 săpt.

Springer Berlin, Heidelberg – 29 iun 1993

325^.30 lei 6-8 săpt.

Springer Berlin, Heidelberg – iul 1992

330^.85 lei 6-8 săpt.

Din seria Lecture Notes in Computer Science

20%

Preț: 461^.83 lei
20%

Preț: 461^.57 lei
20%

Preț: 424^.26 lei
20%

Preț: 390^.69 lei
20%

Preț: 498^.50 lei
15%

Preț: 388^.50 lei
20%

Preț: 390^.35 lei
20%

Preț: 460^.98 lei
20%

Preț: 461^.52 lei
20%

Preț: 497^.55 lei
20%

Preț: 389^.72 lei
20%

Preț: 461^.83 lei
20%

Preț: 389^.90 lei
20%

Preț: 497^.04 lei
20%

Preț: 462^.05 lei
20%

Preț: 391^.14 lei
20%

Preț: 389^.85 lei
20%

Preț: 461^.32 lei
20%

Preț: 498^.32 lei
20%

Preț: 496^.64 lei
20%

Preț: 532^.28 lei
20%

Preț: 527^.36 lei
20%

Preț: 498^.46 lei
15%

Preț: 461^.85 lei
20%

Preț: 390^.12 lei
20%

Preț: 532^.41 lei
20%

Preț: 462^.24 lei
20%

Preț: 391^.14 lei
20%

Preț: 461^.77 lei
20%

Preț: 390^.35 lei
20%

Preț: 461^.06 lei
20%

Preț: 461^.65 lei
20%

Preț: 390^.18 lei
20%

Preț: 392^.64 lei
20%

Preț: 252^.15 lei
20%

Preț: 390^.94 lei
20%

Preț: 461^.52 lei
20%

Preț: 391^.86 lei
20%

Preț: 532^.54 lei
20%

Preț: 462^.67 lei
20%

Preț: 461^.65 lei
20%

Preț: 639^.72 lei
20%

Preț: 255^.91 lei
15%

Preț: 535^.92 lei
20%

Preț: 535^.77 lei
5%

Preț: 516^.27 lei
20%

Preț: 499^.36 lei
20%

Preț: 391^.20 lei
20%

Preț: 391^.20 lei
20%

Preț: 249^.95 lei

Specificații

ISBN-13: 9783540557272
ISBN-10: 354055727X
Pagini: 528
Ilustrații: XVI, 516 p.
Dimensiuni: 155 x 233 x 28 mm
Greutate: 0.74 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

Soundness and completeness of partial deductions for well-founded semantics.- On deductive planning and the frame problem.- On resolution in fragments of classical linear logic (extended abstract).- A procedure for automatic proof nets construction.- Free logic and infinite constraint networks.- Towards probabilistic knowledge bases.- Two-level grammar: A functional/logic query language for database and knowledge-base systems.- Extending deductive database languages by embedded implications.- Controlling redundancy in large search spaces: Argonne-style theorem proving through the years.- Resolution for many-valued logics.- An ordered theory resolution calculus.- Application of automated deduction to the search for single axioms for exponent groups.- Elementary lower bounds for the lengths of refutations.- Shortening proofs by quantifier introduction.- Reform compilation for nonlinear recursion.- Pruning infinite failure branches in programs with occur-check.- The use of planning critics in mechanizing inductive proofs.- ??-Calculus: An algorithmic interpretation of classical natural deduction.- Building proofs by analogy via the Curry-Howard Isomorphism.- On the use of the constructive omega-rule within automated deduction.- OR-parallel theorem proving with random competition.- Parallel computation of multiple sets-of-support.- Towards using the Andorra Kernel Language for industrial real-time applications.- Unification in a combination of equational theories with shared constants and its application to primal algebras.- Non-clausal resolution and superposition with selection and redundancy criteria.- Relating innermost, weak, uniform and modular termination of term rewriting systems.- A two steps semantics for logic programs with negation.- Generalized negation asfailure and semantics of normal disjunctive logic programs.- General model theoretic semantics for Higher-Order horn logic programming.- Disjunctive deductive databases.- Netlog — A concept oriented logic programming language.- From the past to the future: Executing temporal logic programs.- Computing induction axioms.- Consistency of equational enrichments.- A programming logic for a verified structured assembly language.- The unification of infinite sets of terms and its applications.- Unification in order-sorted type theory.- Infinite, canonical string rewriting systems generated by completion.- Spes: A system for logic program transformation.- Linear Objects: A logic framework for open system programming.- ISAR: An interactive system for algebraic implementation proofs.- Mathpert: Computer support for learning algebra, trig, and calculus.- MegaLog — A platform for developing knowledge base management systems.- SPIKE, an automatic theorem prover.- An application to teaching in logic course of ATP based on natural deduction.- A generic logic environment.- ElipSys A parallel programming system based on logic.- Opium — A high-level debugging environment.- An inductive theorem prover based on narrowing.- A cooperative answering system.- MIZ-PR: A theorem prover for polymorphic and recursive functions.- ProPre A programming language with proofs.- FRIENDLY-WAM: An interactive tool to understand the compilation of PROLOG.- SEPIA — a Basis for Prolog extensions.- The external database in SICStus Prolog.- The KCM system: Speeding-up logic programming through hardware support.- Logician's Workbench.- EUODHILOS: A general reasoning system for a variety of logics.- The EKS-V1 system.- CHIP and Propia.