On the complexity of semantic self-minimization

DOI10.1016/J.ENTCS.2009.08.002MaRDI QIDQ2810966zbMATH OpenOpenAlexFDO

Authors Adam Antonik

Publication date 6 June 2016

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.08.002

zbMATH Keywords

3-valued model checkingcomputational complexitypartial state spacessupervaluations

Mathematics Subject Classification ID

Logic in computer science (03B70) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2026795
• Computational complexity of the semantics of some natural language constructions
• scientific article; zbMATH DE number 1114023
• The computational complexity of ideal semantics
• The complexity of minimal satisfiability problems
• scientific article; zbMATH DE number 1688380
• Trichotomies in the complexity of minimal inference
• scientific article; zbMATH DE number 995880
• Minimal inference problem over finite domains: the landscape of complexity
• On minimal-program complexity measures

Cites work

• 20 years of modal and mixed specifications.
• Complexity of Decision Problems for Mixed and Modal Specifications
• Efficient patterns for model checking partial state spaces in CTL \(\cap\) LTL
• scientific article; zbMATH DE number 1693039 (Why is no real title available?)
• scientific article; zbMATH DE number 4172924 (Why is no real title available?)
• scientific article; zbMATH DE number 1028816 (Why is no real title available?)
• scientific article; zbMATH DE number 1487861 (Why is no real title available?)
• scientific article; zbMATH DE number 1759610 (Why is no real title available?)
• scientific article; zbMATH DE number 2102712 (Why is no real title available?)
• scientific article; zbMATH DE number 898449 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Results on the propositional \(\mu\)-calculus
• The complexity of facets (and some facets of complexity)
• The complexity of facets resolved

Cited in

(5)

• Efficient patterns for model checking partial state spaces in CTL \(\cap\) LTL
• Modal and mixed specifications: key decision problems and their complexities
• scientific article; zbMATH DE number 1759610 (Why is no real title available?)
• EXPTIME-complete decision problems for modal and mixed specifications
• Bounded Model Checking for Partial Kripke Structures

This page was built for publication: On the complexity of semantic self-minimization

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