Logo del repository
  1. Home
 
Opzioni

Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings

BRESOLIN Davide
•
GORANKO Valentin
•
SCIAVICCO Guido
altro
MONTANARI, Angelo
2010
  • journal article

Periodico
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
Abstract
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in which they are interpreted. That, in particular, holds for most fragments of Halpern and Shoham’s interval modal logic HS. Still, decidability is the rule for the fragments of HS with only one modal operator, based on an Allen’s relation. In this paper, we show that the logic O of the Overlap relation, when interpreted over discrete linear orderings, is an exception. The proof is based on a reduction from the undecidable octant tiling problem. This is one of the sharpest undecidability result for fragments of HS.
DOI
10.1016/j.entcs.2010.04.006
Archivio
http://hdl.handle.net/11390/878198
info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-81455129959
Diritti
open access
Soggetti
  • interval temporal log...

  • Allen's relation

  • undecidability

  • overlap relation

Scopus© citazioni
4
Data di acquisizione
Jun 7, 2022
Vedi dettagli
Visualizzazioni
39
Data di acquisizione
Apr 19, 2024
Vedi dettagli
google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback