On the complexity of resource-bounded logics
From MaRDI portal
Publication:5915899
DOI10.1007/978-3-319-45994-3_3zbMath1403.68137OpenAlexW3160131567MaRDI QIDQ5915899
Nils Bulling, Natasha Alechina, Stéphane P. Demri, Brian Logan
Publication date: 26 March 2018
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/37145/
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items (4)
Unnamed Item ⋮ Partial order reduction for reachability games ⋮ The virtues of idleness: a decidable fragment of resource agent logic ⋮ On the complexity of resource-bounded logics
This page was built for publication: On the complexity of resource-bounded logics
