COLOG-88 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

21

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540523352, 9783540469636

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A structural completeness theorem for a class of conditional rewrite rule systems

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_62 ◽

1990 ◽

pp. 313-326

Author(s):

Sergey G. Vorobyov

Keyword(s):

Completeness Theorem ◽

Structural Completeness ◽

Rule Systems

Download Full-text

Group-theoretic approach to intractable problems

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_52 ◽

1990 ◽

pp. 112-121 ◽

Cited By ~ 3

Author(s):

V. Ya. Kreinovich

Keyword(s):

Theoretic Approach ◽

Intractable Problems

Download Full-text

Flow-diagrams with sets

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_60 ◽

1990 ◽

pp. 286-299 ◽

Cited By ~ 1

Author(s):

Alexey P. Stolboushkin

Keyword(s):

Flow Diagrams

Download Full-text

On the syntax of infinite objects: an extension of Martin-Löf's theory of expressions

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_50 ◽

1990 ◽

pp. 94-104 ◽

Cited By ~ 3

Author(s):

Lars Hallnäs

Download Full-text

Algorithms for probabilistic inference

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_48 ◽

1990 ◽

pp. 67-75

Author(s):

E. Ya. Dantsin

Keyword(s):

Probabilistic Inference

Download Full-text

On conditions of full coherence in biclosed categories: A new application of proof theory

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_44 ◽

1990 ◽

pp. 3-8

Author(s):

A. A. Babaev ◽

S. V. Soloviev

Keyword(s):

Proof Theory

Download Full-text

Algebraic specified processes and enumerable models

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_43 ◽

1990 ◽

pp. 1-2

Author(s):

Morozov Andrey

Download Full-text

Geometry of interaction 2: Deadlock-free algorithms

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_49 ◽

1990 ◽

pp. 76-93 ◽

Cited By ~ 29

Author(s):

Jean-Yves Girard

Download Full-text

A proof-search method for the first order logic

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_63 ◽

1990 ◽

pp. 327-338 ◽

Cited By ~ 4

Author(s):

A. A. Voronkov

Keyword(s):

Search Method ◽

Order Logic ◽

First Order Logic ◽

First Order ◽

Proof Search

Download Full-text

On connections between classical and constructive semantics

COLOG-88 - Lecture Notes in Computer Science ◽

10.1007/3-540-52335-9_59 ◽

1990 ◽

pp. 275-285 ◽

Cited By ~ 1

Author(s):

S. S. Starchenko ◽

A. A. Voronkov

Download Full-text