| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465838403316 |
|
|
Titolo |
CSL '89 [[electronic resource] ] : 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 |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1990.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 444 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 440 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Artificial intelligence |
Software engineering |
Computer logic |
Mathematical logic |
Artificial Intelligence |
Software Engineering/Programming and Operating Systems |
Logics and Meanings of Programs |
Mathematical Logic and Formal Languages |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
|
|
| |