A proof procedure for hybrid logic with binders, transitivity and relation hierarchies (bibtex)
by Cialdea Mayer, Marta
Reference:
A proof procedure for hybrid logic with binders, transitivity and relation hierarchies (Cialdea Mayer, Marta), In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 7898 LNAI, 2013.
Bibtex Entry:
@article{Mayer201376,
	Author = {Cialdea Mayer, Marta},
	Date-Added = {2019-09-16 14:38:36 +0200},
	Date-Modified = {2019-09-16 14:38:36 +0200},
	Document_Type = {Conference Paper},
	Doi = {10.1007/978-3-642-38574-2_5},
	Journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	Pages = {76-90},
	Source = {Scopus},
	Title = {A proof procedure for hybrid logic with binders, transitivity and relation hierarchies},
	Volume = {7898 LNAI},
	Year = {2013},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-642-38574-2_5}}
Powered by bibtexbrowser