Computer science logic : 12th international workshop, CSL '98 : annual conference of the EACSL, Brno, Czech Republic, August, 1998 : proceedings
| 000 | 01305camuu22003374a 4500 | |
| 001 | 000000671183 | |
| 005 | 20000829094152 | |
| 008 | 990415s1999 gw a b 101 0 eng | |
| 010 | ▼a 99030760 | |
| 015 | ▼a GB99-39300 | |
| 020 | ▼a 3540659226 (softcover : alk. paper) : ▼c DEM 94.00 | |
| 040 | ▼a DLC ▼c DLC ▼d UKM ▼d C#P ▼d OHX ▼d OCL ▼d 211009 | |
| 042 | ▼a pcc | |
| 049 | 1 | ▼l 121042398 ▼f 과학 |
| 050 | 0 0 | ▼a QA76.9.L63 ▼b W67 1998 |
| 072 | 7 | ▼a QA ▼2 lcco |
| 082 | 0 0 | ▼a 004/.01/5113 ▼2 21 |
| 090 | ▼a 004.015113 ▼b W926c | |
| 111 | 2 | ▼a Workshop on Computer Science Logic ▼n (12th : ▼d 1998 : ▼c Brno, Czech Republic) |
| 245 | 1 0 | ▼a Computer science logic : ▼b 12th international workshop, CSL '98 : annual conference of the EACSL, Brno, Czech Republic, August, 1998 : proceedings / ▼c Georg Gottlob, Etienne Grandjean, Katrin Seyr (eds.). |
| 260 | ▼a Berlin ; ▼a New York : ▼b Springer, ▼c 1999. | |
| 300 | ▼a xv, 429 p. : ▼b ill. ; ▼c 23 cm. | |
| 440 | 0 | ▼a Lecture notes in computer science ; ▼v 1584 |
| 504 | ▼a Includes bibliographical references. | |
| 650 | 0 | ▼a Computer logic ▼v Congresses. |
| 650 | 4 | ▼a Computer logic ▼v Congresses. |
| 700 | 1 | ▼a Gottlob, G. ▼q (Georg) |
| 700 | 1 | ▼a Grandjean, E. ▼q (Etienne) |
| 700 | 1 | ▼a Seyr, Katrin. |
| 950 | 1 | ▼b \59783 |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 004.015113 W926c | 등록번호 121042398 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
목차
Invited Papers.- Trakhtenbrot Theorem and Fuzzy Logic.- Descriptive Complexity, Lower Bounds and Linear Time.- Testing of Finite State Systems.- Contributed Papers.- On the Power of Quantifiers in First-Order Algebraic Specification.- On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases.- Revision Programming = Logic Programming + Integrity Constraints.- Quantifiers and the System KE: Some Surprising Results.- Choice Construct and Lindstrom Logics.- Monadic NP and Graph Minors.- Invariant Definability and P/poly.- Computational Complexity of Ehrenfeucht-Fraisse Games on Finite Structures.- An Upper Bound for Minimal Resolution Refutations.- On an Optimal Deterministic Algorithm for SAT.- Characteristic Properties of Majorant-Computability Over the Reals.- Theorems of Peter and Parsons in Computer Programming.- Kripke, Belnap, Urquhart and Relevant Decidability & Complexity.- Existence and Uniqueness of Normal Forms in Pure Type Systems with ??-conversion.- Normalization of Typable Terms by Superdevelopments.- Subtyping Functional+Nonempty Record Types.- Monotone Fixed-Point Types and Strong Normalization.- Morphisms and Partitions of V-sets.- Computational Adequacy in an Elementary Topos.- Logical Relations and Inductive/Coinductive Types.- On the Complexity of H-Subsumption.- Complexity Classes and Rewrite Systems with Polynomial Interpretation.- RPO Constraint Solving Is in NP.- Quantifier Elimination in Fuzzy Logic.- Many-Valued First-Order Logics with Probabilistic Semantics.
정보제공 :
