Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics

@article{Nguyen2008ConstructingFL,
  title={Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics},
  author={Linh Anh Nguyen},
  journal={Logic Journal of the IGPL},
  year={2008},
  volume={16},
  pages={175-193}
}
A serial context-free grammar logic is a normal multimodal logic L characterized by the seriality axioms and a set of inclusion axioms of the form 2tφ→ 2s1 . . .2skφ. Such an inclusion axiom corresponds to the grammar rule t→ s1 . . . sk. Thus the inclusion axioms of L capture a context-free grammar G(L). If for every modal index t, the set of words derivable from t using G(L) is a regular language, then L is a serial regular grammar logic. In this paper, we present an algorithm that, given a… CONTINUE READING

Similar Papers

Loading similar papers…