Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Parameterized Modal Satisfiability
City University of New York.
2010 (Engelska)Ingår i: ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II, 2010, 369-380 s.Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem’s combinatorial explosion, beyond the number of propositional variables v. To this end we study the modality depth, a natural measure which has appeared in the literature, and show that, even though modal satisfiability parameterized by v and the modality depth is FPT, the running time’s dependence on the parameters is a tower of exponentials (unless P=NP). To overcome this limitation we propose possible alternative parameters, namely diamond dimension and modal width. We show fixed-parameter tractability results using these measures where the exponential dependence on the parameters is much milder (doubly and singly exponential respectively) than in the case of modality depth thus leading to FPT algorithms for modal satisfiability with much more reasonable running times. We also give lower bound arguments which prove that our algorithms cannot be improved significantly unless the Exponential Time Hypothesis fails.

Ort, förlag, år, upplaga, sidor
2010. 369-380 s.
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6199
Nyckelord [en]
Modal logic, Parameterized complexity, Satisfiability problems
Nationell ämneskategori
Data- och informationsvetenskap
Identifikatorer
URN: urn:nbn:se:kth:diva-58580ISBN: 978-3-642-14161-4 (tryckt)OAI: oai:DiVA.org:kth-58580DiVA: diva2:473384
Konferens
ICALP 2010, Bordeaux, France, July 6-10, 2010
Anmärkning
QC 20120117Tillgänglig från: 2012-01-05 Skapad: 2012-01-05 Senast uppdaterad: 2012-01-17Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas

Sök vidare i DiVA

Av författaren/redaktören
Lampis, Michael
Data- och informationsvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar

Totalt: 105 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf