CSL '88 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

23

(FIVE YEARS 0)

H-INDEX

3

(FIVE YEARS 0)

Published By Springer-Verlag

354051659x

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Integration of descriptive and procedural language constructs

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026312 ◽

2005 ◽

pp. 344-356

Author(s):

Wolfgang Schönfeld ◽

Werner Stephan

Keyword(s):

Language Constructs

Download Full-text

On the complexity of the decision problem in propositional nonmonotonic logic

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026304 ◽

2005 ◽

pp. 226-239

Author(s):

Ilkka Niemelä

Keyword(s):

Decision Problem ◽

Nonmonotonic Logic

Download Full-text

Is average superlinear speedup possible?

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026309 ◽

2005 ◽

pp. 301-312 ◽

Cited By ~ 1

Author(s):

Ewald Speckenmeyer

Keyword(s):

Superlinear Speedup

Download Full-text

Gentzen-Systems for propositional temporal logics

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026305 ◽

2005 ◽

pp. 240-253 ◽

Cited By ~ 13

Author(s):

Barbara Paech

Keyword(s):

Temporal Logics ◽

Gentzen Systems

Download Full-text

On the existence of fair schedulers

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026307 ◽

2005 ◽

pp. 272-287

Author(s):

Lutz Priese

Download Full-text

Completeness with respect to interpretations in deterministic and nondeterministic polynomial time

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026294 ◽

2005 ◽

pp. 52-62 ◽

Cited By ~ 1

Author(s):

Elias Dahlhaus

Keyword(s):

Polynomial Time

Download Full-text

Delete operations and Horn formulas

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026311 ◽

2005 ◽

pp. 329-343 ◽

Cited By ~ 2

Author(s):

Rüdiger Schätz

Keyword(s):

Horn Formulas

Download Full-text

A remark on minimal polynomials of Boolean functions

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026314 ◽

2005 ◽

pp. 372-383 ◽

Cited By ~ 2

Author(s):

B. Voigt ◽

I. Wegener

Keyword(s):

Boolean Functions ◽

Minimal Polynomials

Download Full-text

A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026296 ◽

2005 ◽

pp. 80-98 ◽

Cited By ~ 3

Author(s):

Elmar Eder

Keyword(s):

Connection Method ◽

Resolution Calculus

Download Full-text

On the emptiness problem of tree automata and completeness of modal logics of programs

CSL '88 - Lecture Notes in Computer Science ◽

10.1007/bfb0026315 ◽

2005 ◽

pp. 384-399

Author(s):

Hubert Wagner

Keyword(s):

Modal Logics ◽

Tree Automata ◽

Emptiness Problem ◽

Logics Of Programs

Download Full-text