Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals

From MaRDI portal
Revision as of 07:44, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1740653


DOI10.1016/j.ic.2019.02.002zbMath1436.03120WikidataQ128279235 ScholiaQ128279235MaRDI QIDQ1740653

Angelo Montanari, Pietro Sala, Davide Bresolin, Guido Sciavicco, Dario Della Monica

Publication date: 2 May 2019

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11392/2403907


03B45: Modal logic (including the logic of norms)

03B25: Decidability of theories and sets of sentences

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

03B44: Temporal logic


Related Items



Cites Work