Статті в журналах з теми "Computation Tree Logics"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Computation Tree Logics".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Kamide, Norihiro. "Logical foundations of hierarchical model checking." Data Technologies and Applications 52, no. 4 (September 4, 2018): 539–63. http://dx.doi.org/10.1108/dta-01-2018-0002.
Повний текст джерелаDALLA CHIARA, MARIA LUISA, ROBERTO GIUNTINI, and ROBERTO LEPORINI. "LOGICS FROM QUANTUM COMPUTATION." International Journal of Quantum Information 03, no. 02 (June 2005): 293–337. http://dx.doi.org/10.1142/s0219749905000943.
Повний текст джерелаGoranko, Valentin. "Temporal Logics with Reference Pointers and Computation Tree Logics." Journal of Applied Non-Classical Logics 10, no. 3-4 (January 2000): 221–42. http://dx.doi.org/10.1080/11663081.2000.10510998.
Повний текст джерелаBALTAZAR, P., R. CHADHA, and P. MATEUS. "QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS." International Journal of Quantum Information 06, no. 02 (April 2008): 219–36. http://dx.doi.org/10.1142/s0219749908003530.
Повний текст джерелаKamide, Norihiro, and Daiki Koizumi. "Method for Combining Paraconsistency and Probability in Temporal Reasoning." Journal of Advanced Computational Intelligence and Intelligent Informatics 20, no. 5 (September 20, 2016): 813–27. http://dx.doi.org/10.20965/jaciii.2016.p0813.
Повний текст джерелаWalker, Matt, Parssa Khazra, Anto Nanah Ji, Hongru Wang, and Franck van Breugel. "jpf-logic." ACM SIGSOFT Software Engineering Notes 48, no. 1 (January 10, 2023): 32–36. http://dx.doi.org/10.1145/3573074.3573083.
Повний текст джерелаJACOBS, BART. "The temporal logic of coalgebras via Galois algebras." Mathematical Structures in Computer Science 12, no. 6 (December 2002): 875–903. http://dx.doi.org/10.1017/s096012950200378x.
Повний текст джерелаPENCZEK, WOJCIECH. "TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION." International Journal of Foundations of Computer Science 04, no. 01 (March 1993): 31–67. http://dx.doi.org/10.1142/s0129054193000043.
Повний текст джерелаLatte, Markus. "Branching-time logics and fairness, revisited." Mathematical Structures in Computer Science 31, no. 9 (October 2021): 1135–44. http://dx.doi.org/10.1017/s0960129521000475.
Повний текст джерелаChun, Seung Su. "The Pattern Based Visual Property Specification Language and Supporting System for Software Verifications." Applied Mechanics and Materials 752-753 (April 2015): 1090–96. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1090.
Повний текст джерелаRequeno, José Ignacio, and José Manuel Colom. "Model checking software for phylogenetic trees using distribution and database methods." Journal of Integrative Bioinformatics 10, no. 3 (December 1, 2013): 16–30. http://dx.doi.org/10.1515/jib-2013-229.
Повний текст джерелаThomas, Colin, Maximilien Cosme, Cédric Gaucherel, and Franck Pommereau. "Model-checking ecological state-transition graphs." PLOS Computational Biology 18, no. 6 (June 6, 2022): e1009657. http://dx.doi.org/10.1371/journal.pcbi.1009657.
Повний текст джерелаBianco, Alessandro, Fabio Mogavero, and Aniello Murano. "Graded computation tree logic." ACM Transactions on Computational Logic 13, no. 3 (August 2012): 1–53. http://dx.doi.org/10.1145/2287718.2287725.
Повний текст джерелаKaneiwa, Ken, and Norihiro Kamide. "Paraconsistent Computation Tree Logic." New Generation Computing 29, no. 4 (October 2011): 391–408. http://dx.doi.org/10.1007/s00354-009-0116-6.
Повний текст джерелаPatthak, A. C., I. Bhattacharya, A. Dasgupta, Pallab Dasgupta, and P. P. Chakrabarti. "Quantified Computation Tree Logic." Information Processing Letters 82, no. 3 (May 2002): 123–29. http://dx.doi.org/10.1016/s0020-0190(01)00260-5.
Повний текст джерелаCappello, Peter, and Dimitrios Mourloukos. "CX: A Scalable, Robust Network for Parallel Computing." Scientific Programming 10, no. 2 (2002): 159–71. http://dx.doi.org/10.1155/2002/598245.
Повний текст джерелаKaivola, Roope. "Axiomatising extended computation tree logic." Theoretical Computer Science 190, no. 1 (January 1998): 41–60. http://dx.doi.org/10.1016/s0304-3975(97)00083-2.
Повний текст джерелаDasgupta, Pallab, P. P. Chakrabarti, Jatindra Kumar Deka, and Sriram Sankaranarayanan. "Min-max Computation Tree Logic." Artificial Intelligence 127, no. 1 (March 2001): 137–62. http://dx.doi.org/10.1016/s0004-3702(01)00059-5.
Повний текст джерелаBaltazar, Pedro, Paulo Mateus, Rajagopal Nagarajan, and Nikolaos Papanikolaou. "Exogenous Probabilistic Computation Tree Logic." Electronic Notes in Theoretical Computer Science 190, no. 3 (September 2007): 95–110. http://dx.doi.org/10.1016/j.entcs.2007.07.007.
Повний текст джерелаКотикова, Е. А., and М. Н. Рыбаков. "Kripke Incompleteness of First-order Calculi with Temporal Modalities of CTL and Near Logics." Logical Investigations 21, no. 1 (April 21, 2015): 86–99. http://dx.doi.org/10.21146/2074-1472-2015-21-1-86-99.
Повний текст джерелаFontaine, Gaëlle, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, and Loredana Sorrentino. "Cycle Detection in Computation Tree Logic." Electronic Proceedings in Theoretical Computer Science 226 (September 13, 2016): 164–77. http://dx.doi.org/10.4204/eptcs.226.12.
Повний текст джерелаPan, Haiyu, Yongming Li, Yongzhi Cao, and Zhanyou Ma. "Model checking fuzzy computation tree logic." Fuzzy Sets and Systems 262 (March 2015): 60–77. http://dx.doi.org/10.1016/j.fss.2014.07.008.
Повний текст джерелаFontaine, Gaëlle, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, and Loredana Sorrentino. "Cycle detection in computation tree logic." Information and Computation 262 (October 2018): 265–79. http://dx.doi.org/10.1016/j.ic.2018.09.007.
Повний текст джерелаXiong, Liping, та Sumei Guo. "Representation and Reasoning about Strategic Abilities with ω-Regular Properties". Mathematics 9, № 23 (27 листопада 2021): 3052. http://dx.doi.org/10.3390/math9233052.
Повний текст джерелаHan, Ying-Jie, Jian-Wei Wang, Chun Huang, and Qing-Lei Zhou. "Computation Tree Logic Formula Model Checking Using DNA Computing." Journal of Nanoelectronics and Optoelectronics 15, no. 5 (May 1, 2020): 620–29. http://dx.doi.org/10.1166/jno.2020.2781.
Повний текст джерелаCalvanese, Diego, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Vardi. "Node Selection Query Languages for Trees." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 3, 2010): 279–84. http://dx.doi.org/10.1609/aaai.v24i1.7598.
Повний текст джерелаReynolds, M. "An axiomatization of full Computation Tree Logic." Journal of Symbolic Logic 66, no. 3 (September 2001): 1011–57. http://dx.doi.org/10.2307/2695091.
Повний текст джерелаFERREIRA, FERNANDO. "A NEW COMPUTATION OF THE Σ-ORDINAL OF KPω". Journal of Symbolic Logic 79, № 01 (березень 2014): 306–24. http://dx.doi.org/10.1017/jsl.2013.31.
Повний текст джерелаDasgupta, Pallab, P. P. Chakrabarti, and Jatindra Kumar Deka. "Min-max event-triggered computation tree logic." Sadhana 27, no. 2 (April 2002): 163–80. http://dx.doi.org/10.1007/bf02717182.
Повний текст джерелаMa, Zhanyou, Zhaokai Li, Weijun Li, Yingnan Gao, and Xia Li. "Model Checking Fuzzy Computation Tree Logic Based on Fuzzy Decision Processes with Cost." Entropy 24, no. 9 (August 24, 2022): 1183. http://dx.doi.org/10.3390/e24091183.
Повний текст джерелаSoares Passos, Lígia Maria, and Stéphane Julia. "Linear Logic as a Tool for Qualitative and Quantitative Analysis of Workow Processes." International Journal on Artificial Intelligence Tools 25, no. 03 (June 2016): 1650008. http://dx.doi.org/10.1142/s0218213016500081.
Повний текст джерелаZhang, Lan, Ullrich Hustadt, and Clare Dixon. "CTL-RP: A computation tree logic resolution prover." AI Communications 23, no. 2-3 (2010): 111–36. http://dx.doi.org/10.3233/aic-2010-0463.
Повний текст джерелаZHOU, Cong-Hua, Zhi-Feng LIU, and Chang-Da WANG. "Bounded Model Checking for Probabilistic Computation Tree Logic." Journal of Software 23, no. 7 (September 7, 2012): 1656–68. http://dx.doi.org/10.3724/sp.j.1001.2012.04089.
Повний текст джерелаPan, Haiyu, Yongming Li, Yongzhi Cao, and Zhanyou Ma. "Model checking computation tree logic over finite lattices." Theoretical Computer Science 612 (January 2016): 45–62. http://dx.doi.org/10.1016/j.tcs.2015.10.014.
Повний текст джерелаJaparidze, Giorgi, and Bikal Lamichhane. "Cirquent Calculus in a Nutshell." Logical Investigations 28, no. 1 (June 26, 2022): 125–41. http://dx.doi.org/10.21146/2074-1472-2022-28-1-125-141.
Повний текст джерелаGhosh, Krishnendu, and John Schlipf. "Formal modeling of a system of chemical reactions under uncertainty." Journal of Bioinformatics and Computational Biology 12, no. 05 (October 2014): 1440002. http://dx.doi.org/10.1142/s0219720014400022.
Повний текст джерелаCurcin, Vasa, Moustafa M. Ghanem, and Yike Guo. "Analysing scientific workflows with Computational Tree Logic." Cluster Computing 12, no. 4 (August 19, 2009): 399–419. http://dx.doi.org/10.1007/s10586-009-0099-6.
Повний текст джерелаDEL BIMBO, A., and E. VICARIO. "A Visual Formalism for Computational Tree Logic." Journal of Visual Languages & Computing 10, no. 2 (April 1999): 165–87. http://dx.doi.org/10.1006/jvlc.1998.0108.
Повний текст джерелаLi, Yongming, Yali Li, and Zhanyou Ma. "Computation tree logic model checking based on possibility measures." Fuzzy Sets and Systems 262 (March 2015): 44–59. http://dx.doi.org/10.1016/j.fss.2014.03.009.
Повний текст джерелаBeauquier, Danièle, and Anatol Slissenko. "Polytime model checking for timed probabilistic computation tree logic." Acta Informatica 35, no. 8 (August 1, 1998): 645–64. http://dx.doi.org/10.1007/s002360050136.
Повний текст джерелаHuth, Michael. "On finite-state approximants for probabilistic computation tree logic." Theoretical Computer Science 346, no. 1 (November 2005): 113–34. http://dx.doi.org/10.1016/j.tcs.2005.08.008.
Повний текст джерелаGebser, Martin, Tomi Janhunen, and Jussi Rintanen. "Declarative encodings of acyclicity properties." Journal of Logic and Computation 30, no. 4 (September 8, 2015): 923–52. http://dx.doi.org/10.1093/logcom/exv063.
Повний текст джерелаZhang, Xin Xing, Qiu Yan Zhu, Jiao Yang Lu, Fu Rui Zhang, Wei Tao Huang, Xue Zhi Ding, and Li Qiu Xia. "The Boolean logic tree of molecular self-assembly system based on cobalt oxyhydroxide nanoflakes for three-state logic computation, sensing and imaging of pyrophosphate in living cells and in vivo." Analyst 144, no. 1 (2019): 274–83. http://dx.doi.org/10.1039/c8an01565a.
Повний текст джерелаCARDELLI, LUCA, and GIORGIO GHELLI. "TQL: a query language for semistructured data based on the ambient logic." Mathematical Structures in Computer Science 14, no. 3 (May 20, 2004): 285–327. http://dx.doi.org/10.1017/s0960129504004141.
Повний текст джерелаDI SCIASCIO, EUGENIO, FRANCESCO M. DONINI, and MARINA MONGIELLO. "USING COMPUTATION TREE LOGIC FOR INTELLIGENT INFORMATION SEARCH ON THE WEB." International Journal of Computational Intelligence and Applications 02, no. 03 (September 2002): 245–53. http://dx.doi.org/10.1142/s1469026802000579.
Повний текст джерелаAu, Tsz-Chiu. "Extended Goal Recognition Design with First-Order Computation Tree Logic." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (June 28, 2022): 9661–68. http://dx.doi.org/10.1609/aaai.v36i9.21200.
Повний текст джерелаBolotov, Alexander, and Artie Basukoski. "A clausal resolution method for extended computation tree logic ECTL." Journal of Applied Logic 4, no. 2 (June 2006): 141–67. http://dx.doi.org/10.1016/j.jal.2005.06.003.
Повний текст джерелаMurano, Aniello, Mimmo Parente, Sasha Rubin, and Loredana Sorrentino. "Model-checking graded computation-tree logic with finite path semantics." Theoretical Computer Science 806 (February 2020): 577–86. http://dx.doi.org/10.1016/j.tcs.2019.09.021.
Повний текст джерелаLück, Martin. "Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic." International Journal of Foundations of Computer Science 29, no. 01 (January 2018): 17–61. http://dx.doi.org/10.1142/s0129054118500028.
Повний текст джерелаMeolic, Robert, Tatjana Kapus, and Zmago Brezočnik. "ACTLW – An action-based computation tree logic with unless operator." Information Sciences 178, no. 6 (March 2008): 1542–57. http://dx.doi.org/10.1016/j.ins.2007.10.023.
Повний текст джерела