Treffer: The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
Title:
The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
Authors:
Source:
Information processing letters. 45(3):131-136
Publisher Information:
Amsterdam: Elsevier Science, 1993.
Publication Year:
1993
Physical Description:
print, 9 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Généralités, General, Complexité calcul, Computing complexity, Complejidad cálculo, Intelligence artificielle, Artificial intelligence, Inteligencia artificial, Logique temporelle, Temporal logic, Lógica temporal, PROLOG, Problème NP complet, NP complete problem, Problema NP completo, Programmation logique, Logical programming, Programación lógica
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
National Taiwan univ., dep. computer sci. information eng., Taipei, Tawain, Province of China
ISSN:
0020-0190
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
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
CC BY 4.0
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
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4753783
Database:
PASCAL Archive