 |
|
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper) Mathematical logic, algebra and number theory Projective formulas and unification in linear discrete temporal multi-agent logics S. I. Bashmakova, A. V. Koshelevab, V. Rybakovc a Institute of mathematics and computer science, Siberian Federal University, pr. Svobodny, 79, 660041, Krasnoyarsk, Russia b Institute of space and informatic technologies, Siberian Federal University, Kirenskogo St. 26, ULK building, 660074, Krasnoyarsk, Russia c Department of Computing and Mathematics, John Dalton Building, Chester Street, Manchester M1 5GD, UK Abstract: This article continues our studying the problem of unification in multi-agent logics. Based on the approach to the unificational problem through the projective formulas proposed by V. Rybakov and S. Ghilardi, in this paper we consider some linear discrete temporal logics with the agent relations. We proved the projectivity of any unifiable formula in these logics and gave an algorithm for construction the most general unifier. Keywords: unification, modal temporal logic, passive inference rules, multi-agent relations. DOI: https://doi.org/10.17377/semi.2016.13.074   Full text:
PDF file (595 kB)
References:
PDF file
HTML file
Bibliographic databases:  
UDC: 510.643 MSC: 03F99 Received Language: Citation: S. I. Bashmakov, A. V. Kosheleva, V. Rybakov, “Projective formulas and unification in linear discrete temporal multi-agent logics”, Sib. Èlektron. Mat. Izv., 13 (2016), 
Citation in format AMSBIB
\Bibitem{BasKosRyb16}Linking options:
Citing articles on Google Scholar: Russian citations, English citations Related articles on Google Scholar: Russian articles, English articles This publication is cited in the following articles:
|
|
||||||||||||||||||||||||||||||||||||||||||
|
|
Contact us: |
 Terms of Use
|
Registration |
Logotypes |
|