Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Computational Complexity of Decidable Fragments of First-Order ..."

Ian M. Hodkinson et al. (2003)

> Home

Details and statistics

DOI: 10.1109/TIME.2003.1214884

access: closed

type: Conference or Workshop Paper

metadata version: 2023-12-17

- view
  authority control:
- export record
  dblp key:
  - conf/time/HodkinsonKKWZ03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/time/HodkinsonKKWZ03
Ian M. Hodkinson, Roman Kontchakov, Agi Kurucz, Frank Wolter, Michael Zakharyaschev:
On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics. TIME 2003: 91-98

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.