"The computational complexity of scenario-based agent verification and design."

Yves Bontemps, Pierre-Yves Schobbens (2007)

> Home

Details and statistics

DOI: 10.1016/J.JAL.2005.12.013

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/japll/BontempsS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/japll/BontempsS07
Yves Bontemps, Pierre-Yves Schobbens:
The computational complexity of scenario-based agent verification and design. J. Appl. Log. 5(2): 252-276 (2007)

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.