Polynomial hierarchy graph properties in hybrid logic

DOI10.1016/J.JCSS.2014.04.003zbMATH Open1327.03020OpenAlexW2131373279MaRDI QIDQ2453580FDOQ2453580

Authors: Yanyan Li 

Publication date: 10 June 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.04.003

Recommendations

• Hybrid logics and NP graph properties
• A Logical Approach to Hamiltonian Graphs
• The expressibility of fragments of hybrid graph logic on finite digraphs
• Using modal logics to express and check global graph properties
• Modal expressiveness of graph properties

zbMATH Keywords

polynomial hierarchyhybrid logicsgraph properties

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combined logics (03B62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The four-colour theorem
• Title not available (Why is that?)
• Handbook of modal logic
• Title not available (Why is that?)
• Computer Science Logic
• Every Planar Map is Four Colorable
• Hybrid logics: Characterization, interpolation and complexity
• Title not available (Why is that?)
• Using modal logics to express and check global graph properties
• Title not available (Why is that?)

Cited In (3)

• Hybrid logics and NP graph properties
• Using modal logics to express and check global graph properties
• Product of Graphs and Hybrid Logic

This page was built for publication: Polynomial hierarchy graph properties in hybrid logic

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