On the complexity of resource-bounded logics

DOI10.1007/978-3-319-45994-3_3MaRDI QIDQ5915899zbMATH OpenOpenAlexFDO

Authors Natasha Alechina, Nils Bulling, Stéphane 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/

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the complexity of resource-bounded logics
• scientific article; zbMATH DE number 7368413
• Model-checking for resource-bounded ATL with production and consumption of resources
• Strategic reasoning with a bounded number of resources: the quest for tractability
• Decidable model-checking for a resource logic with production of resources

Cited in

(10)

• Resource-bounded paraconsistent inference
• Strategic reasoning with a bounded number of resources: the quest for tractability
• Expressing properties of resource-bounded systems: the logics RTL\(^{*}\) and RTL
• scientific article; zbMATH DE number 2044514 (Why is no real title available?)
• The virtues of idleness: a decidable fragment of resource agent logic
• Decidable model-checking for a resource logic with production of resources
• Stubborn set reduction for two-player reachability games
• Partial order reduction for reachability games
• On the complexity of resource-bounded logics
• On abstract resource semantics and computability logic

This page was built for publication: On the complexity of resource-bounded logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915899)