Dissertations / Theses on the topic 'BDI Logics'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 22 dissertations / theses for your research on the topic 'BDI Logics.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Nair, Vineet, and n/a. "On Extending BDI Logics." Griffith University. School of Information Technology, 2003. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20030929.095254.
Full textBirštunas, Adomas. "Sequent calculi with an efficient loop-check for BDI logics." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100302_095327-67575.
Full textDarbe nagrinėjami sekvenciniai skaičiavimai BDI logikoms. BDI logikos yra plačiai naudojamos agentinių sistemų aprašymui ir realizavimui. Agentai yra autonomiškos sistemos, kurios veikia kažkurioje aplinkoje ir siekia įvykdyti iš anksto apibrėžtus tikslus. Sprendimų priėmimo realizavimas yra svarbiausia ir sudėtingiausia dalis realizuojant agentines sistemas. Sprendimo priėmimo realizavimui gali būti naudojami logikos skaičiavimai. Šiame darbe ir yra nagrinėjami sekvenciniai skaičiavimai BDI logikoms. BDI logikose, kaip ir kitose modalumo logikose, yra naudojama ciklų paieška išsprendžiamumui gauti. Neefektyvi ciklų paieška užima didesnę išvedimų paieškos resursų dalį. Kai kurioms modalumo logikoms yra žinomi becikliai skaičiavimai ar skaičiavimai naudojantys efektyvią ciklų paiešką. Šiame darbe yra pateikiamas beciklis sekvencinis skaičiavimas KD45 logikai, kuri yra esminis BDI logikų fragmentas. Pateiktas skaičiavimas ne tik eliminuoja ciklų paiešką, bet ir supaprastina patį sekvencijos išvedimą. Skaidaus laiko logikai (kitam BDI logikų fragmentui) yra pateikiamas sekvencinis skaičiavimas naudojantis efektyvią ciklų paiešką. Gauti rezultatai yra pritaikyti sukuriant sekvencinius skaičiavimus vianaagentinei ir daugiaagentinei BDI logikoms. Pristatyti skaičiavimai naudoja tik apribotą ciklų paiešką. Be to, kai kurių tipų ciklus eliminuoja visiškai. Šie rezultatai įgalina kurti efektyvesnes agentines sistemas, paremtas BDI logikomis.
Xiao, Zhanhao. "Raffinement des intentions." Thesis, Toulouse 1, 2017. http://www.theses.fr/2017TOU10051/document.
Full textBirštunas, Adomas. "Sekvenciniai skaičiavimai BDI logikoms su efektyvia ciklų paieška." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100302_095338-77193.
Full textSequent calculi for BDI logics is a research object of the thesis. BDI logics are widely used for agent system description and implementation. Agents are autonomous systems, those acts in some environment and aspire to achieve preassigned goals. Implementation of the decision making is the main and the most complicated part in agent systems implementation. Logic calculi may be used for the decision making implementation. In this thesis, there are researched sequent calculi for BDI logics. Sequent calculi for BDI logics, like sequent calculi for other modal logics, use loop-check technique to get decidability. Inefficient loop-check takes a major part of the resources used for the derivation. For some modal logics, there are known loop-check free sequent calculi or calculi with an efficient loop-check. In this thesis, there is presented loop-check free sequent calculus for KD45 logic, which is the main fragment of the BDI logics. Introduced calculus not only eliminates loop-check, but also simplifies sequent derivation. For the branching time logic (another BDI logic fragment) there is presented sequent calculus with an efficient loop-check. Obtained results are adapted for creation sequent calculi for monoagent and multiagent BDI logics. Introduced calculi use only restricted loop-check. Moreover, loop-check is totally eliminated for some types of the loops. These results enables to create more efficient agent systems, those are based on the BDI logics.
Forti, Maicol. "Logic Reasoning in BDI Agents: Current Trends and Spatial Integrations." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23426/.
Full textCruz, Anderson Paiva. "L?gica BDI fuzzy." Universidade Federal do Rio Grande do Norte, 2008. http://repositorio.ufrn.br:8080/jspui/handle/123456789/17995.
Full textCoordena??o de Aperfei?oamento de Pessoal de N?vel Superior
Intendding to understand how the human mind operates, some philosophers and psycologists began to study about rationality. Theories were built from those studies and nowadays that interest have been extended to many other areas such as computing engineering and computing science, but with a minimal distinction at its goal: to understand the mind operational proccess and apply it on agents modelling to become possible the implementation (of softwares or hardwares) with the agent-oriented paradigm where agents are able to deliberate their own plans of actions. In computing science, the sub-area of multiagents systems has progressed using several works concerning artificial intelligence, computational logic, distributed systems, games theory and even philosophy and psycology. This present work hopes to show how it can be get a logical formalisation extention of a rational agents architecture model called BDI (based in a philosophic Bratman s Theory) in which agents are capable to deliberate actions from its beliefs, desires and intentions. The formalisation of this model is called BDI logic and it is a modal logic (in general it is a branching time logic) with three access relations: B, D and I. And here, it will show two possible extentions that tranform BDI logic in a modal-fuzzy logic where the formulae and the access relations can be evaluated by values from the interval [0,1]
Com o intuito de entender como a mente humana funciona iniciaram-se estudos sobre cogni??o nos campos da filosofia e psicologia. Teorias surgiram desses estudos e, atualmente, esta curiosidade foi estendida a outras ?reas, tais como, ci?ncia e engenharia de computa??o, no entanto, nestas ?reas, o objetivo ? sutilmente diferente: entender o funcionamento da mente e aplic?-lo em uma modelagem artificial. Em ci?ncia da computa??o, a sub-?rea de sistemas multiagentes tem progredido bastante, utilizando trabalhos em intelig?ncia artificial, l?gica computacional, sistemas distribu?dos, teoria dos jogos e, aproveitando tamb?m teorias provenientes da pr?pria filosofia e psicologia. Desta forma, alguns pesquisadores j? v?em o paradigma de programa??o orientado a agentes como a melhor solu??o para a implementa??o dos softwares mais complexos: cujos sistemas s?o din?micos, n?o-determin?sticos e que podem ter de operar com dados faltosos sobre ambientes tamb?m din?micos e n?o-determin?sticos. Este trabalho busca a apresenta??o de uma extens?o da formaliza??o l?gica de um modelo de arquitetura de agentes cognitivos, chamado BDI (belief-desire-intention), na qual o agente ? capaz de deliberar suas a??es baseando-se em suas cren?as, desejos e inten??es. A formaliza??o de tal modelo ? conhecida pelo nome de l?gica BDI, uma l?gica modal com tr?s rela??es de modalidade. Neste trabalho, ser?o apresentados dois planos para transform?-la numa l?gica modal fuzzy onde as rela??es de acessibilidade e as f?rmulas (modais-fuzzy) poder?o ter valora??es dentro do intervalo [0,1]. Esta l?gica modal fuzzy h? de ser um sistema l?gico formal capaz de representar quantitativamente os diferentes graus de cren?as, desejos e inten??es objetivando a constru??o de racioc?nios fuzzy e a delibera??o de a??es de um agente (ou grupo de agentes), atrav?s dessas atitudes mentais (seguindo assim um modelo intensional)
Mora, Michael da Costa. "Um Modelo formal e executável de agentes BDI." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1999. http://hdl.handle.net/10183/3955.
Full textSouza, Marlo Vieira dos Santos e. "Choices that make you chnage your mind : a dynamic epistemic logic approach to the semantics of BDI agent programming languages." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/150039.
Full textAs the notions of Agency and Multiagent System became important topics for the Computer Science and Artificial Intelligence communities, Agent Programming has been proposed as a paradigm for the development of computer systems. As such, in the last decade, we have seen the flourishing of the literature on Agent Programming with the proposal of several programming languages, e.g. AgentSpeak (RAO, 1996; BORDINI; HUBNER;WOOLDRIDGE, 2007), Jadex (POKAHR; BRAUBACH; LAMERSDORF, 2005), JACK (HOWDEN et al., 2001), 3APL/2APL (DASTANI; VAN RIEMSDIJK; MEYER, 2005; DASTANI, 2008), GOAL (HINDRIKS et al., 2001), among others. Agent Programming is a programming paradigm proposed by Shoham (1993) in which the minimal units are agents. An agent is an entity composed of mental attitudes, that describe the its internal state - such as its motivations and decisions - as well as its relation to the external world - its beliefs about the world, its obligations, etc. This programming paradigm stems from the work on Philosophy of Action and Artificial Intelligence concerning the notions of intentional action and formal models of agents’ mental states. As such, the meaning (and properties) of notions such as belief, desire, intention, etc. as studied in these disciplines are of central importance to the area. Particularly, we will concentrate in our work on agent programming languages influenced by the so-called BDI paradigm of agency, in which an agent is described by her beliefs, desires, intentions. While the engineering of such languages has been much discussed, the connections between the theoretical work on Philosophy and Artificial Intelligence and its implementations in programming languages are not so clearly understood yet. This distance between theory and practice has been acknowledged in the literature for agent programming languages and is commonly known as the “semantic gap”. Many authors have attempted to tackle this problem for different programming languages, as for the case of AgentSpeak (BORDINI; MOREIRA, 2004), GOAL (HINDRIKS; VAN DER HOEK, 2008), etc. In fact, Rao (1996, p. 44) states that “[t]he holy grail of BDI agent research is to show such a one-to-one correspondence with a reasonably useful and expressive language.” One crucial limitation in the previous attempts to connect agent programming languages and BDI logics, in our opinion, is that the connection is mainly established at the static level, i.e. they show how a given program state can be interpreted as a BDI mental state. It is not clear in these attempts, however, how the execution of the program may be understood as changes in the mental state of the agent. The reason for this, in our opinion, is that the formalisms employed to construct BDI logics are usually static, i.e. cannot represent actions and change, or can only represent ontic change, not mental change. The act of revising one’s beliefs or adopting a given desire are mental actions (or internal actions) and, as such, different from performing an action over the environment (an ontic or external action). This difference is well recognized in the literature on the semantics of agent programming languages (D’INVERNO et al., 1998; BORDINI; HUBNER; WOOLDRIDGE, 2007; MENEGUZZI; LUCK, 2009), but this difference is lost when translating their semantics into a BDI logic. We believe the main reason for that is a lack of expressibility in the formalisms used to model BDI reasoning. Dynamic Epistemic Logic, or DEL, is a family of dynamic modal logics to study information change and the dynamics of mental attitudes inspired by the Dutch School on the “dynamic turn” in Logic (VAN BENTHEM, 1996). This formalism stems from various approaches in the study of belief change and differs from previous studies, such as AGM Belief Revision, by shifting from extra-logical characterization of changes in the agents attitudes to their integration within the representation language. In the context of Dynamic Epistemic Logic, the Dynamic Preference Logic of Girard (2008) seems like an ideal candidate, having already been used to study diverse mental attitudes, such as Obligations (VAN BENTHEM; GROSSI; LIU, 2014), Beliefs (GIRARD; ROTT, 2014), Preferences (GIRARD, 2008), etc. We believe Dynamic Preference Logic to be the ideal semantic framework to construct a formal theory of BDI reasoning which can be used to specify an agent programming language semantics. The reason for that is that inside this logic we can faithfully represent the static state of a agent program, i.e. the agent’s mental state, as well as the changes in the state of the agent program by means of the agent’s reasoning, i.e. by means of her mental actions. As such, in this work we go further in closing the semantic gap between agent programs and agency theories and explore not only the static connections between program states and possible worlds models, but also how the program execution of a language based on common operations - such as addition/removal of information in the already mentioned bases - may be understood as semantic transformations in the models, as studied in Dynamic Logics. With this, we provide a set of operations for the implementation of agent programming languages which are semantically safe and we connect an agent program execution with the dynamic properties in the formal theory. Lastly, by these connections, we provide a framework to study the dynamics of different mental attitudes, such as beliefs, goals and intentions, and how to reproduce the desirable properties proposed in theories of Agency in a programming language semantics.
Adam, Carole. "Emotions : from psychological theories to logical formalization and implementation in BDI agent." Phd thesis, Toulouse, INPT, 2007. http://ethesis.inp-toulouse.fr/archive/00000513/.
Full textThis thesis is about emotions, and more particularly about their logical formalization. The first part is dedicated to the state of the art, from the point of view of both psychology (history of theories of emotions) and computer science (presentation of emotional agents and their applications). The second aprt is dedicated to the logical formalisation of emotions. It introduces our logical framework, exposes and argues the formal definitions of twenty emotions, and proves some of their properties. Finally the last part is dedicated to practical applications and continuation prospects of this work. Such a work offers interesting contributions: it offers to the agent community a formal model of a great number of emotions; it shows the interest of BDI logics; and it opens research prospects about the dynamics of emotions and their influence on the behaviour of agents, a field not much explored for now
Adam, Carole Herzig Andréas. "Emotions from psychological theories to logical formalization and implementation in BDI agent /." Toulouse : INP Toulouse, 2008. http://ethesis.inp-toulouse.fr/archive/00000513.
Full textArisaka, Ryuta. "Proof-theoretical observations of BI and BBI base-logic interactions, and development of phased sequence calculus to define logic combinations." Thesis, Teesside University, 2013. http://hdl.handle.net/10149/315552.
Full textAportone, Anselmo. "Gestalten der transzendentalen Einheit Bedingungen der Synthesis bei Kant /." Berlin : De Gruyter, 2009. http://site.ebrary.com/id/10348562.
Full textWingfield, James. "Approaches to test set generation using binary decision diagrams." Thesis, Texas A&M University, 2003. http://hdl.handle.net/1969.1/20.
Full textBorges, Peter Jens. "Tailor-made scheduling : Beitrag zur Lösung des Reihenfolgeproblems bei Werkstattfertigung mittels fuzzy logic /." Aachen : Mainz, 1994. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=006314043&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Full textFredriksson, Helena, and Caroline Hedlund. "”Vi måste ju samarbeta för att det ska bli bra” : - En fallstudie om arbetsprocessen bakom en marknadsföringskampanj som anpassats efter det förändrade medielandskapet." Thesis, Uppsala universitet, Företagsekonomiska institutionen, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-243270.
Full textFlämig, Katharina Marianne. "Entscheidungsfindung bei Galeristen auf dem primären Kunstmarkt: Die Rolle von Overconfidence bei der Beurteilung von Kunst und der Einfluss von Wissen und Erfahrung auf die Entscheidungslogik." Doctoral thesis, Humboldt-Universität zu Berlin, 2020. http://dx.doi.org/10.18452/21615.
Full textThe objective of this dissertation is to shed more light on the primary art market and the decision-making processes of its protagonists, the gallery owners. The doctoral thesis focuses on the potential impact of experience and expertise on the gallerists‘ applied decision-making logic and the consequences of limited access to information for the gallery owners‘ decision-making behaviour. In particular, the distinction between novices and experts and their decision-making is addressed. According to Sarasvathy (2001), novices tend to use a predictive decision-making logic (causation), whereas experts apply a non-predictive logic (effectuation). They differ in their level of expertise, which is based on deliberate practice, experience and continuous outstanding and superior performance in a particular domain (Ericsson 2006; Mitchell et al. 2005:3, Dew et al. 2009: 289). The studies conducted examined whether the professional experience, gender and academic career of the gallery owner affects the applied decision-making logic. The results show that professional experience has a significant influence on the applied decision-making logic of the gallery owner: novice-gallerists prefer the causal approach, expert gallery owners favour the effectual decision-making logic. With regard to gender and the academic career, it can be proven that female gallery owners and gallerists without academic training most often apply the causal decision-making logic. This dissertation also focuses on the experimental analysis of the influence and impact of overconfidence on the price setting processes of gallery owners. The results indicate that a significant level of overconfidence leads to lower prices for works of art. In addition, a knowledge effect could be observed: the more sophisticated the gallery owners are, the higher will be the price they set for an art work they consider to be suitable for an exhibition.
Silva, Diego Gonçalves. "AgentSpeak(PL): uma nova linguagem de programação para agentes BDI com um modelo integrado de Redes Bayesianas." Universidade do Vale do Rio dos Sinos, 2011. http://www.repositorio.jesuita.org.br/handle/UNISINOS/3434.
Full textMade available in DSpace on 2015-05-05T18:45:18Z (GMT). No. of bitstreams: 1 AgentSpeak.pdf: 2033275 bytes, checksum: 00fdf0cf1d5436d313d43434cbc09f20 (MD5) Previous issue date: 2011
Nenhuma
Quando este trabalho foi iniciado não era possível desenvolver de forma prática e direta softwares com agentes inteligentes onde suas crenças poderiam ser probabilidades relacionadas com seu ambiente, visto que as definições formais das linguagens disponíveis não previam tal possibilidade. Quando essa necessidade precisava ser levada em conta e implementada, devia-se lançar mão de técnicas avançadas de programação onde deveria haver a integração de ambientes de desenvolvimentos e linguagens, a fim de tornar a implementação factível. Este trabalho teve como objetivo o desenvolvimento de uma nova linguagem de programação orientada a agentes denominada AgentSpeak(PL), baseada em AgentSpeak(L), com o intuito de agregar o conceito de crenças probabilísticas através do uso de Redes Bayesianas sendo implementada através de uma extensão da ferramenta de programação Jason.
When this work was started it was not possible to develop so practical and straightforward software with intelligent agents where their beliefs could likely be related to their environment, as the settings formal language available did not foresee such a possibility. When this necessity had to be taken into account and implemented, one should resort of advanced programming techniques where there should be integration of development environments and languages in order to make the implementation feasible. This study aimed to develop a new language agent oriented programming called AgentSpeak (PL), based on AgentSpeak (L) with the intention of creating the concept of probabilistic beliefs through the use of Bayesian networks being implemented through an extension Jason's programming tool.
Yang, Congguang. "BDD-based logic synthesis system." 2000. https://scholarworks.umass.edu/dissertations/AAI9960805.
Full textWu, Dennis. "Towards scalable BDD-based logic synthesis." 2005. http://link.library.utoronto.ca/eir/EIRdetail.cfm?Resources__ID=369945&T=F.
Full textPan, Guoqiang. "BDD-based decision procedures for modal logic K." Thesis, 2003. http://hdl.handle.net/1911/17614.
Full textWu, Kai-chiang, and 吳凱強. "Using JADE, OWL, and Java to Implement Jason BDI Agent to Eliminate Logic Constructs." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/70772395893458682526.
Full text國立中央大學
資訊工程學系
102
Jason [1] is the most popular platform to develop agent. However, we argue that Jason is difficult to use because of its using logic programming[2], it is very different from other programming languages with regard to deliberation and execution. On the other hand, we use JADE, OWL, and Java to implement the 10-step reasoning cycle of Jason agent. We found that by doing so we can simulate Jason agent without the cumbersome logic construct of logic programming and thus improve agent program maintainability .
Rens, Gavin B. "A belief-desire-intention architechture with a logic-based planner for agents in stochastic domains." Diss., 2010. http://hdl.handle.net/10500/3517.
Full textComputing
M. Sc. (Computer Science)