<電子ブック>
CSL'88 : 2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter
(Lecture Notes in Computer Science. ISSN:16113349 ; 385)
版 | 1st ed. 1989. |
---|---|
出版者 | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer |
出版年 | 1989 |
本文言語 | 英語 |
大きさ | VIII, 404 p : online resource |
著者標目 | Börger, Egon editor Kleine Büning, Hans editor Richter, Michael M editor SpringerLink (Online service) |
件 名 | LCSH:Computer systems LCSH:Mathematical logic LCSH:Compilers (Computer programs) LCSH:Computer science LCSH:Machine theory LCSH:Discrete mathematics FREE:Computer System Implementation FREE:Mathematical Logic and Foundations FREE:Compilers and Interpreters FREE:Computer Science Logic and Foundations of Programming FREE:Formal Languages and Automata Theory FREE:Discrete Mathematics |
一般注記 | 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 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 HTTP:URL=https://doi.org/10.1007/BFb0026291 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
|
Springer eBooks | 9783540467366 |
|
電子リソース |
|
EB00225049 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA76.9.S88 DC23:004.2 |
書誌ID | 4001088858 |
ISBN | 9783540467366 |