CSL'88

2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings

AvEgon Börger,Hans Kleine Büning

Häftad, Engelska, 1989

Del i serien Lecture Notes in Computer Science

536 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:1989-09-06
Mått:155 x 235 x 23 mm
Vikt:622 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:404
Upplaga:1989
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540516590

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematikens grunder inom Naturvetenskap och teknik
Programmeringsböcker inom Data och IT

Innehållsförteckning

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.