このページのリンク

<電子ブック>
CSL '89 : 3rd Workshop on Computer Science Logic. Kaiserslautern, FRG, October 2-6, 1989. Proceedings / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter
(Lecture Notes in Computer Science. ISSN:16113349 ; 440)

1st ed. 1990.
出版者 (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年 1990
本文言語 英語
大きさ VIII, 444 p : online resource
著者標目 Börger, Egon editor
Kleine Büning, Hans editor
Richter, Michael M editor
SpringerLink (Online service)
件 名 LCSH:Artificial intelligence
LCSH:Software engineering
LCSH:Computer science
LCSH:Machine theory
FREE:Artificial Intelligence
FREE:Software Engineering
FREE:Computer Science Logic and Foundations of Programming
FREE:Formal Languages and Automata Theory
一般注記 Honest polynomial-time degrees of elementary recursive sets -- On the verification of modules -- A logical operational semantics of full Prolog -- Set-theoretic reductions of Hilbert's tenth problem -- The complexity of subtheories of the existential linear theory of reals -- On test classes for universal theories -- Generalizing allowedness while retaining completeness of SLDNF-resolution -- Effectively given information systems and domains -- Davis-Putnam resolution versus unrestricted resolution -- On logical descriptions of some concepts in structural complexity theory -- Algebraic operational semantics and Occam -- Propositional provability and models of weak arithmetic -- Polymorphic recursion and semi-unification -- Deciding Horn classes by hyperresolution -- ?-branching programs of bounded width -- A predicate calculus with control of derivations -- Reducibility of monotone formulas to ?-formulas -- New ways for developing proof theories for first-order multi modal logics -- On the representation of data in lambda-calculus -- A streamlined temporal completeness theorem -- A concurrent branching time temporal logic -- Semantic for abstract fairness using metric spaces -- On the average time complexity of set partitioning -- A direct proof for the completeness of SLD-resolution -- A quantifier-free completion of logic programs -- Stratification of definite clause programs and of general logic programs -- The semantics of disjunctive deductive databases -- Sequential representation of primitive recursive functions, and complexity classes
This volume contains the revised versions of 28 papers presented at the third workshop on Computer Science Logic held in Kaiserslautern, FRG, October 2-6, 1989. 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 intelligece, and temporal logic. The volume should be of interest to all logicians and computer scientists working in the above field
HTTP:URL=https://doi.org/10.1007/3-540-52753-2
目次/あらすじ

所蔵情報を非表示

電子ブック オンライン 電子ブック

Springer eBooks 9783540471370
電子リソース
EB00225144

書誌詳細を非表示

データ種別 電子ブック
分 類 LCC:Q334-342
LCC:TA347.A78
DC23:006.3
書誌ID 4001089918
ISBN 9783540471370

 類似資料