Добірка наукової літератури з теми "Game logic"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Game logic".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Game logic"
Hartonas, Chrysafis. "Game-theoretic semantics for non-distributive logics." Logic Journal of the IGPL 27, no. 5 (January 11, 2019): 718–42. http://dx.doi.org/10.1093/jigpal/jzy079.
Повний текст джерелаPlatzer, André. "Differential Game Logic." ACM Transactions on Computational Logic 17, no. 1 (December 10, 2015): 1–51. http://dx.doi.org/10.1145/2817824.
Повний текст джерелаBaier, Christel, Tomáš Brázdil, Marcus Größer, and Antonín Kučera. "Stochastic game logic." Acta Informatica 49, no. 4 (June 2012): 203–24. http://dx.doi.org/10.1007/s00236-012-0156-0.
Повний текст джерелаHicks, Daniel J., and John Milanese. "The Logic Game." Teaching Philosophy 38, no. 1 (2015): 77–93. http://dx.doi.org/10.5840/teachphil20151731.
Повний текст джерелаВасюков, В. Л. "Game Theoretical Semantic for Relevant Logic." Logical Investigations 21, no. 2 (September 28, 2015): 42–52. http://dx.doi.org/10.21146/2074-1472-2015-21-2-42-52.
Повний текст джерелаKaneko, Mamoru. "Common knowledge logic and game logic." Journal of Symbolic Logic 64, no. 2 (June 1999): 685–700. http://dx.doi.org/10.2307/2586493.
Повний текст джерелаHalim, Hanasrullah, Wan Amirah Najwa Wan Idris, and Haslina Hassan. "Learning Logic Gate through 7-Gates Game." International Journal of Multimedia and Recent Innovation 2, no. 1 (March 22, 2020): 1–10. http://dx.doi.org/10.36079/lamintang.ijmari-0201.70.
Повний текст джерелаVAN BENTHEM, JOHAN. "RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES." International Game Theory Review 09, no. 01 (March 2007): 13–45. http://dx.doi.org/10.1142/s0219198907001254.
Повний текст джерелаGrossi, Davide, Emiliano Lorini, and Francois Schwarzentruber. "The Ceteris Paribus Structure of Logics of Game Forms." Journal of Artificial Intelligence Research 53 (May 27, 2015): 91–126. http://dx.doi.org/10.1613/jair.4666.
Повний текст джерелаWisinggya, Kadhana Reya, Hanny Haryanto, T. Sutojo, Edy Mulyanto, and Erlin Dolphina. "Tingkat Kesulitan Dinamis Menggunakan Logika Fuzzy pada Game Musik Tradisional Jawa Tengah." Jurnal ELTIKOM 5, no. 2 (September 10, 2021): 56–64. http://dx.doi.org/10.31961/eltikom.v5i2.281.
Повний текст джерелаДисертації з теми "Game logic"
Crone, Logan. "Determinacy of Schmidt's Game and Other Intersection Games." Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1703306/.
Повний текст джерелаBruin, Boudewijn Paul de. "Explaining games on the logic of game theoretic explanations /." Amsterdam : Amsterdam : Institute for logic, language and computation ; Universiteit van Amsterdam [Host], 2004. http://dare.uva.nl/document/73758.
Повний текст джерелаGünzel, Stephan, Michael Liebe, and Dieter Mersch. "Logic and structure of the computer game." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4302/.
Повний текст джерелаBlot, Valentin. "Game semantics and realizability for classical logic." Thesis, Lyon, École normale supérieure, 2014. http://www.theses.fr/2014ENSL0945/document.
Повний текст джерелаThis thesis investigates two realizability models for classical logic built on HO game semantics. The main motivation is to have a direct computational interpretation of classical logic, arithmetic and analysis with programs manipulating a higher-order store.Relaxing the innocence condition in HO games provides higher-order references, and dropping the well-bracketing of strategies reveals the CPS of HO games and gives a category of continuations in which we can interpret Parigot's lambda-mu calculus. This permits a direct computational interpretation of classical proofs from which we build two realizability models.The first model is orthogonality-based, as the one of Krivine. However, it is simply-typed and first-order. This means that we do not use a second-order coding of falsity, and extraction is handled by considering realizers with a free mu-variable. We provide a bar-recursor in this model and prove that it realizes the axiom of dependent choice, relying on two consequences of the CPO structure of the games model: every function on natural numbers (possibly non computable) exists in the model, and every functional on sequences is Scott-continuous. Usually, bar-recursion is used to intuitionistically realize the double negation shift and consequently the negative translation of the axiom of choice. Here, we directly realize the axiom of choice in a classical setting.The second model relies on winning conditions and is very specific to the games model. A winning condition is a set of positions in a game which satisfies some coherence properties, and a realizer of a formula is then a strategy which positions are all winning
Mio, Matteo. "Game semantics for probabilistic modal μ-calculi". Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/6223.
Повний текст джерелаCalderon, Ana C. M. A. "Understanding game semantics through coherence spaces." Thesis, University of Bath, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.580675.
Повний текст джерелаMaslar, David Wang X. H. Tsoi Allanus Hak-Man. "An experimental study of the game of Nim." Diss., Columbia, Mo. : University of Missouri-Columbia, 2009. http://hdl.handle.net/10355/6725.
Повний текст джерелаJackson, E. P. "A representation language based on a game-theoretic interpretation of logic." Thesis, University of Leeds, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.376515.
Повний текст джерелаGardy, Patrick. "Semantics of Strategy Logic." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLN022/document.
Повний текст джерелаWith the proliferation of computerised devices, software verification is more prevalent than ever. Since the 80's, multiple costly software failures have forced both private and public actors to invest in software verification. Among the main procedures we find the model-checking, developed by Clarke and Emerson in the 80's. It consists in abstracting both the system into a formal model and the property of expected behaviour in some logical formalism, then checking if the property's abstraction holds on the system's abstraction. The difficulty lies in finding appropriate models and efficient algorithms. In this thesis, we focus on one particular logical formalism: the Strategy Logic SL, used to express multi-objectives properties of multi-agents systems. Strategy Logic is a powerful and expressive formalism that treats strategies (i.e. potential behaviours of the agents) like first-order objects. It can be seen as an analogue to first-order logic for multi-agents systems. Many semantic choices were made in its definition without much discussion. Our main contributions are relative to the possibilities left behind by the original definition. We first introduce SL and present some complexity results (including some of our owns). We then outline some other semantic choices within SL's definition and study their influence. Third, we study the logic's behaviour under quantitative multi-agents systems (games with energy and counter constraints). Finally, we address the problem of dependencies within SL[BG], a fragment of SL
Bilal, Ahmed. "Counterfactual conditional analysis using the Centipede Game." Scholarship @ Claremont, 2019. https://scholarship.claremont.edu/cmc_theses/2252.
Повний текст джерелаКниги з теми "Game logic"
Meaningful games: Exploring language with game theory. Cambridge, MA: The MIT Press, 2011.
Знайти повний текст джерелаCristina, Bicchieri, Jeffrey Richard C, and Skyrms Brian, eds. The logic of strategy. New York: Oxford University Press, 1999.
Знайти повний текст джерелаPeter, Jackson. Implementing a game theoretic interpretation of logic. Edinburgh: University of Edinburgh Department of Artificial Intelligence, 1985.
Знайти повний текст джерелаGabriel, Sandu, and Sevenster Merlijn, eds. Independence-friendly logic: A game-theoretic approach. Cambridge, UK: Cambridge University Press, 2011.
Знайти повний текст джерелаLuck, logic, and white lies: The mathematics of games. Wellesley, Mass: A K Peters, 2005.
Знайти повний текст джерелаMoral calculations: Game theory, logic, and human frailty. New York, NY: Copernicus, 1998.
Знайти повний текст джерела1965-, Benz Anton, Jäger Gerhard 1967-, and Van Rooij Robert 1966-, eds. Game theory and pragmatics. New York: Palgrave Macmillan, 2005.
Знайти повний текст джерелаInternational Conference on Logic, Game Theory and Social Choice, LGS '99, Oisterwijk, 1999. Logic, game theory and social choice: Proceedings of the International Conference, LGS '99, May 13-16, 1999. Tilburg: Tilburg University Press, 1999.
Знайти повний текст джерелаservice), SpringerLink (Online, ed. Explaining Games: The Epistemic Programme in Game Theory. Dordrecht: Springer Science+Business Media B.V., 2010.
Знайти повний текст джерелаJohn, Symons, Pietarinen Ahti-Veikko, Tulenheimo Tero, Majer Ondrej, and SpringerLink (Online service), eds. Games: Unifying Logic, Language, and Philosophy. Dordrecht: Springer Netherlands, 2009.
Знайти повний текст джерелаЧастини книг з теми "Game logic"
Genesereth, Michael, and Michael Thielscher. "Logic." In General Game Playing, 111–27. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-031-01569-4_13.
Повний текст джерелаBohrer, Brandon, and André Platzer. "Constructive Game Logic." In Programming Languages and Systems, 84–111. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_4.
Повний текст джерелаAbramsky, Samson, and Guy McCusker. "Game Semantics." In Computational Logic, 1–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-58622-4_1.
Повний текст джерелаSimchi-Levi, David, Xin Chen, and Julien Bramel. "Game Theory." In The Logic of Logistics, 45–64. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-9149-1_3.
Повний текст джерелаKane, Ben. "Procedural Logic." In Procedural Generation in Game Design, 119–32. Boca Raton : Taylor & Francis, CRC Press, 2017.: A K Peters/CRC Press, 2017. http://dx.doi.org/10.1201/9781315156378-14.
Повний текст джерелаGenesereth, Michael, and Michael Thielscher. "Analyzing Games with Logic." In General Game Playing, 129–49. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-031-01569-4_14.
Повний текст джерелаGenesereth, Michael, and Michael Thielscher. "Discovering Heuristics with Logic." In General Game Playing, 161–69. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-031-01569-4_16.
Повний текст джерелаLeimbach, Judy. "Baseball Game." In Grades 2-4 Primarily Logic, 48. New York: Routledge, 2021. http://dx.doi.org/10.4324/9781003237259-41.
Повний текст джерелаBerwanger, Dietmar, and Sophie Pinchinat. "Game Quantification Patterns." In Logic and Its Applications, 116–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92701-3_8.
Повний текст джерелаThielscher, Michael. "Answer Set Programming for Single-Player Games in General Game Playing." In Logic Programming, 327–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02846-5_28.
Повний текст джерелаТези доповідей конференцій з теми "Game logic"
BinSubaih, Ahmed, Steve Maddock, and Daniela Romano. "Game logic portability." In the 2005 ACM SIGCHI International Conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1178477.1178580.
Повний текст джерелаBaier, Christel, Tomas Brazdil, Marcus Grosser, and Antonin Kucera. "Stochastic Game Logic." In Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007). IEEE, 2007. http://dx.doi.org/10.1109/qest.2007.38.
Повний текст джерелаEnqvist, Sebastian, Helle Hvid Hansen, Clemens Kupke, Johannes Marti, and Yde Venema. "Completeness for Game Logic." In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785676.
Повний текст джерелаFredericks, Erik M., Byron DeVries, and Jared M. Moore. "Towards self-adaptive game logic." In ICSE '22: 44th International Conference on Software Engineering. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3524494.3527625.
Повний текст джерелаEngesser, Thorsten, Robert Mattmüller, Bernhard Nebel, and Michael Thielscher. "Game Description Language and Dynamic Epistemic Logic Compared." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/248.
Повний текст джерелаLiu, Hu. "Goal-directed Unbounded Coalitional Game and Its Complexity." In 13th Asian Logic Conference. WORLD SCIENTIFIC, 2015. http://dx.doi.org/10.1142/9789814678001_0010.
Повний текст джерелаMurawski, Andrzej S. "Reachability Games and Game Semantics: Comparing Nondeterministic Programs." In 2008 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008). IEEE, 2008. http://dx.doi.org/10.1109/lics.2008.24.
Повний текст джерелаMaubert, Bastien, Sophie Pinchinat, Francois Schwarzentruber, and Silvia Stranieri. "Concurrent Games in Dynamic Epistemic Logic." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/260.
Повний текст джерелаLi, Peiyi, Peilin Li, John Morris, and Yu Sun. "A Context-Aware and Immersive Puzzle Game using Machine Learning and Big Data Analysis." In 5th International Conference on Computer Science and Information Technology (COMIT 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111717.
Повний текст джерелаGrossi, Davide, Emiliano Lorini, and François Schwarzentruber. "The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract)." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/710.
Повний текст джерелаЗвіти організацій з теми "Game logic"
Platzer, Andre. Differential Game Logic for Hybrid Games. Fort Belvoir, VA: Defense Technical Information Center, March 2012. http://dx.doi.org/10.21236/ada561153.
Повний текст джерелаSmith, James F., Rhyne III, and II Robert D. Fuzzy Logic Resource Management and Coevolutionary Game-based Optimization. Fort Belvoir, VA: Defense Technical Information Center, September 2001. http://dx.doi.org/10.21236/ada390559.
Повний текст джерелаRose, Jonathan, Robert J. Francis, Paul Chow, and David Lewis. The Effect of Logic Block Complexity on Area of Programmable Gate Arrays. Fort Belvoir, VA: Defense Technical Information Center, January 1987. http://dx.doi.org/10.21236/ada207172.
Повний текст джерелаCheng, Julian. Integrated Photonic Switches and Logic Gate Arrays for Parallel Optical Switching and Computer Architectures. Fort Belvoir, VA: Defense Technical Information Center, June 1995. http://dx.doi.org/10.21236/ada297732.
Повний текст джерелаLee, Timothy C., and Robert M. Proie. A Subthreshold Digital Library Using a Dynamic-Threshold Metal-Oxide Semiconductor (DTMOS) and Transmission Gate Logic. Fort Belvoir, VA: Defense Technical Information Center, September 2014. http://dx.doi.org/10.21236/ada608589.
Повний текст джерелаWu, Lifei. Minimization of Permuted Reed-Muller Trees and Reed-Muller Trees for Cellular Logic Programmable Gate Arrays. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.6629.
Повний текст джерелаSchafer, Ingo. Orthogonal and Nonorthogonal Expansions for Multi-Level Logic Synthesis for Nearly Linear Functions and their Application to Field Programmable Gate Array Mapping. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.1338.
Повний текст джерелаEstrada, Jorge. Ruthless Desires of Living Together in Roberto Bolaño’s 2666: Conviviality between Potestas and Potentia. Maria Sibylla Merian Centre Conviviality-Inequality in Latin America, March 2022. http://dx.doi.org/10.46877/estrada.2022.42.
Повний текст джерела