Cantitate/Preț
Produs
Total produse
Vezi coșul
CSL'88 de Egon Börger

CSL'88

Editat de Egon Börger, Hans Kleine Büning, Michael M. Richter
en Limba Engleză Paperback – 6 sep 1989
This volume contains the papers which were presented at the second workshop "Computer Science Logic" held in Duisburg, FRG, October 3-7, 1988. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science: e.g. in complexity, data base theory, logic programming, artificial intelligence, and concurrency. The volume should be of interest to all logicians and computer scientists working in the above fields.
Citește tot Restrânge

Preț: 32792 lei

Preț vechi: 40989 lei
-20%

Puncte Express: 492
Preț estimativ în valută:
5799€ • 6649$ • 5012£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540516590
ISBN-10: 354051659X
Pagini: 412
Ilustrații: VIII, 404 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

On disjunctive self-reducibility.- The knowledge representation language LLILOG.- Completeness with respect to interpretations in deterministic and nondeterministic polynomial time.- A temporal logic approach to specify and to prove properties of finite state concurrent systems.- A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods.- Characterizing complexity classes by general recursive definitions in higher types.- Size of models versus length of computations.- Boolean circuit complexity of algebraic interpolation problems.- Loop detection in propositional Prolog programs.- Numberings of R1?F.- Interval temporal logic and star-free expressions.- An interpreter with lazy evaluation for Prolog with functions.- On the complexity of the decision problem in propositional nonmonotonic logic.- Gentzen-Systems for propositional temporal logics.- Predicate inequalities as a basis for automated termination proofs for Prolog programs.- On the existence of fair schedulers.- Using finite-linear temporal logic for specifying database dynamics.- Is average superlinear speedup possible?.- Enforcement of integrity constraints in a semantic data model.- Delete operations and Horn formulas.- Integration of descriptive and procedural language constructs.- Normal forms and the complexity of computations of logic programs.- A remark on minimal polynomials of Boolean functions.- On the emptiness problem of tree automata and completeness of modal logics of programs.