Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2040003

The complexity of propositional linear temporal logics in simple cases

Author
DEMRI, S1 ; SCHNOEBELEN, P2
[1] Leibniz-IMAG, Univ. Grenoble & CNRS UMR 5522, 46, av. Félix Viallet, 38031 Grenoble, France
[2] Lab. Specification and Verification, ENS de Cachan & CNRS URA 2236, 61, av. Pdt. Wilson, 94235 Cachan, France
Conference title
STACS 98 : 15th annual symposium on theoretical aspects of computer science (Paris, 25-27 February 1998)
Conference name
Annual symposium on theoretical aspects of computer science (15 ; Paris 1998-02-25)
Author (monograph)
Morvan, Michel (Editor); Meinel, Christoph (Editor); Krob, Daniel (Editor)
Source

Lecture notes in computer science. 1998, pp 61-72 ; ref : 16 ref

ISSN
0302-9743
ISBN
3-540-64230-7
Scientific domain
Computer science
Publisher
Springer-Verlag, Berlin / Springer-Verlag, New York NY
Publication country
Germany
Document type
Conference Paper
Language
English
Keyword (fr)
Classe complexité Complexité calcul Informatique théorique Logique propositionnelle Logique temporelle
Keyword (en)
Complexity class Computational complexity Computer theory Propositional logic Temporal logic
Keyword (es)
Clase complejidad Complejidad computación Informática teórica Lógica proposicional Lógica temporal
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A04 Logical, boolean and switching functions

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
2040003

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web