Zaloguj się

Gotowe bibliografie tematyczne / BDI Logics / Artykuły w czasopismach

Artykuły w czasopismach na temat „BDI Logics”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: BDI Logics.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 19 lutego 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „BDI Logics”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Grabovskis, Arvids, i Janis Grundspenkis. "Identification of Relations between BDI Logic and BDI Agents". Scientific Journal of Riga Technical University. Computer Sciences 44, nr 1 (1.01.2011): 21–28. http://dx.doi.org/10.2478/v10143-011-0018-1.

Pełny tekst źródła

Streszczenie:

Identification of Relations between BDI Logic and BDI AgentsBDI (Beliefs, Desires, Intentions) is one of the most popular intelligent agent architectures which was inspired by multi-modal BDI logics. The main idea behind BDI is to implement system's behaviour by specifying it as a set of mental objects. This allows designing systems at a high level of abstraction which come closer to a human-like thinking. Although this architecture has been rapidly developing for about 20 years, its relevance to BDI logic is still arguable. This paper describes the basics of modal logic and main inference algorithms. Main concepts of BDI agents are presented and their relationships with BDI logic are discussed. Finally advantages and disadvantages of implementing BDI interpreter as a theorem prover are discussed.

Style APA, Harvard, Vancouver, ISO itp.

2

Herzig, Andreas, Emiliano Lorini, Laurent Perrussel i Zhanhao Xiao. "BDI Logics for BDI Architectures: Old Problems, New Perspectives". KI - Künstliche Intelligenz 31, nr 1 (18.10.2016): 73–83. http://dx.doi.org/10.1007/s13218-016-0457-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Rao, A. "Decision procedures for BDI logics". Journal of Logic and Computation 8, nr 3 (1.06.1998): 293–342. http://dx.doi.org/10.1093/logcom/8.3.293.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Benrouba, Ferdaous, i Rachid Boudour. "A Model Combining BDI Logic and Temporal Logics for Decision-Making in Emergency". International Journal of Advances in Soft Computing and its Applications 14, nr 3 (28.11.2022): 32–48. http://dx.doi.org/10.15849/ijasca.221128.03.

Pełny tekst źródła

Streszczenie:

Abstract Nowadays, we are dealing with panic and unpleasant situations in which, we are constrained to make crucial decisions in a limited delay, due to the mixed emotions that may affect our decision, especially FEAR, this kind of emotion occurs when unwanted or uncontrollable events are present in the environment. These recent years, fear modelling has been well researched and since this emotion is usually associated with the fact that one or more fundamental desires are at stake Unluckily, most of these models miss that FEAR does not always occur similarly in all agents. This paper proposes a new conceptual architecture with a new component by extending BDI logic with the emotion of FEAR, so that the new Emotional-BDI agents may better cope with extremely dynamic unpleasant situations in their surroundings. We also address how we verify the emotional properties by employing a model checker NuSMV. The proposed architecture confirms that NuSMV can be applied to verify the emotional specifications we can program agents that are capable of reasoning over emotions, our experimental results indicate the viability and efficiency of our model. Keywords: Emotional-BDI, Model checking, NuSMV, CUDD, Unpleasant situations.

Style APA, Harvard, Vancouver, ISO itp.

5

Dziubiński, Marcin. "Modal context restriction for multiagent BDI logics". Artificial Intelligence Review 55, nr 4 (6.10.2021): 3075–151. http://dx.doi.org/10.1007/s10462-021-10064-6.

Pełny tekst źródła

Streszczenie:

AbstractWe present and discuss a novel language restriction for modal logics for multiagent systems, called modal context restriction, that reduces the complexity of the satisfiability problem from EXPTIME complete to NPTIME complete. We focus on BDI multimodal logics that contain fix-point modalities like common beliefs and mutual intentions together with realism and introspection axioms. We show how this combination of modalities and axioms affects complexity of the satisfiability problem and how it can be reduced by restricting the modal context of formulas.

Style APA, Harvard, Vancouver, ISO itp.

6

Naoyuki, Nide, Shiro Takata i Tadashi Araragi. "Deduction Systems for BDI Logics with Mental State Consistency". Electronic Notes in Theoretical Computer Science 70, nr 5 (październik 2002): 140–52. http://dx.doi.org/10.1016/s1571-0661(04)80593-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Petik, Jaroslav. "PHILOSOPHICAL PROBLEMS OF THE MENTALISTIC LOGIC". Sophia. Human and Religious Studies Bulletin 14, nr 2 (2019): 38–43. http://dx.doi.org/10.17721/sophia.2019.14.9.

Pełny tekst źródła

Streszczenie:

Paper deals with philosophical problems of mentalistic logic. Mentalistic logic is a formal system that concentrates on underpinning processes of mental life instead of certain elements of extrinsic rational behavior as most of existing logics (like BDI calculi) do. The project is compared to the existing logics of actions. Mentalistic logic is patually a formal system and partually phenomenological study of human mind. We presume formal signs such as propositions and modal operators refer to mental states and can describe the general structure of mental activity. That is purely the approach of classical phenomenology – the study of experience and its structures. On the other hand the usage of formal logic is a classic analytic philosophy of mind. So the things are getting more complicated when taking in consideration that the initial framework of a study is analytic philosophy and not continental phenomenology. Phenomenology is of different intellectual and methodological tradition than any type of analytic philosophy including analytic philosophy of mind. From that stanpoint it may be said that paper is also interesting as a purely methodological project – it tries to find bridges between phenomenology and philosophy of mind. As for the action logics, mentalistic logic also studies rational behavior but does it on the other lever and often with a different purpose. The main problem in this case is philosophical interpretation of modality. Minor problems include shared content, many leveled self-referential structures and vagueness. The paper also studies brain in a vatt thought experiment as a methodological concept. The research will have implications for philosophy of logic, artificial intelligence and theory of reference.

Style APA, Harvard, Vancouver, ISO itp.

8

LARCHEY-WENDLING, DOMINIQUE, i DIDIER GALMICHE. "Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding". Mathematical Structures in Computer Science 19, nr 3 (czerwiec 2009): 435–500. http://dx.doi.org/10.1017/s0960129509007567.

Pełny tekst źródła

Streszczenie:

The logic of Bunched Implications, through both its intuitionistic version (BI) and one of its classical versions, called Boolean BI (BBI), serves as a logical basis to spatial or separation logic frameworks. In BI, the logical implication is interpreted intuitionistically whereas it is generally interpreted classically in spatial or separation logics, as in BBI. In this paper, we aim to give some new insights into the semantic relations between BI and BBI. Then we propose a sound and complete syntactic constraints based framework for the Kripke semantics of both BI and BBI, a sound labelled tableau proof system for BBI, and a representation theorem relating the syntactic models of BI to those of BBI. Finally, we deduce as our main, and unexpected, result, a sound and faithful embedding of BI into BBI.

Style APA, Harvard, Vancouver, ISO itp.

9

Cruz, Anderson, André V. dos Santos, Regivan H. N. Santiago i Benjamin Bedregal. "A Fuzzy Semantic for BDI Logic". Fuzzy Information and Engineering 13, nr 2 (3.04.2021): 139–53. http://dx.doi.org/10.1080/16168658.2021.1915455.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Blee, Jeff, David Billington, Guido Governatori i Abdul Sattar. "Levels of modality for BDI Logic". Journal of Applied Logic 9, nr 4 (grudzień 2011): 250–73. http://dx.doi.org/10.1016/j.jal.2011.08.002.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Alechina, Natasha, Tristan Behrens, Mehdi Dastani, Koen Hindriks, Jomi Hubner, Brian Logan, Hai Nguyen i Marc Van Zee. "Multi-Cycle Query Caching in Agent Programming". Proceedings of the AAAI Conference on Artificial Intelligence 27, nr 1 (30.06.2013): 32–38. http://dx.doi.org/10.1609/aaai.v27i1.8618.

Pełny tekst źródła

Streszczenie:

In many logic-based BDI agent programming languages, plan selection involves inferencing over some underlying knowledge representation. While context-sensitive plan selection facilitates the development of flexible, declarative programs, the overhead of evaluating repeated queries to the agent's beliefs and goals can result in poor run time performance. In this paper we present an approach to multi-cycle query caching for logic-based BDI agent programming languages. We extend the abstract performance model presented in (Alechina et al. 2012) to quantify the costs and benefits of caching query results over multiple deliberation cycles. We also present results of experiments with prototype implementations of both single- and multi-cycle caching in three logic-based BDI agent platforms, which demonstrate that significant performance improvements are achievable in practice.

Style APA, Harvard, Vancouver, ISO itp.

12

Bunder, Martin. "BCI-Algebras and Related Logics". Australasian Journal of Logic 19, nr 2 (18.05.2022): 85–95. http://dx.doi.org/10.26686/ajl.v19i2.7567.

Pełny tekst źródła

Streszczenie:

Kabzinski in [6] first introduced an extension of BCI-logic that is isomorphic to BCI-algebras. Kashima and Komori in [7] gave a Gentzen-style sequent calculus version of this logic as well as another sequent calculus which they proved to be equivalent. They used the second to prove decidability of the word problem for BCI-algebras. The decidability proof relies on cut elimination for the second system, this paper provides a fuller and simpler proof of this. Also supplied is a new decidability proof and proof finding algorithm for their second extension of BCI-logic and so for BCI-algebras.

Style APA, Harvard, Vancouver, ISO itp.

13

Perháč, Ján, Valerie Novitzká, William Steingartner i Zuzana Bilanová. "Formal Model of IDS Based on BDI Logic". Mathematics 9, nr 18 (17.09.2021): 2290. http://dx.doi.org/10.3390/math9182290.

Pełny tekst źródła

Streszczenie:

Computer network security is an important aspect of computer science. Many researchers are trying to increase security using different methods, technologies, or tools. One of the most common practices is the deployment of an Intrusion Detection System (IDS). The current state of IDS brings only passive protection from network intrusions, i.e., IDS can only detect possible intrusions. Due to that, the manual intervention of an administrator is needed. In our paper, we present a logical model of an active IDS based on category theory, coalgebras, linear logic, and Belief–Desire–Intention (BDI) logic. Such an IDS can not only detect intrusions but also autonomously react to them according to a defined security policy. We demonstrate our approach on a motivating example with real network intrusions.

Style APA, Harvard, Vancouver, ISO itp.

14

Chen, Qingliang, Kaile Su, Abdul Sattar, Xiangyu Luo i Aixiang Chen. "A first-order coalition logic for BDI-agents". Frontiers of Computer Science 10, nr 2 (28.10.2015): 233–45. http://dx.doi.org/10.1007/s11704-015-4591-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Hu, Jun, i Yang Yu. "A Policy-Oriented Reputation BDI Model". Applied Mechanics and Materials 34-35 (październik 2010): 707–11. http://dx.doi.org/10.4028/www.scientific.net/amm.34-35.707.

Pełny tekst źródła

Streszczenie:

Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the information needed by agents to efficiently perform partner selection in uncertain situations. In this paper, by taking advantage of the non-monotonic knowledge representation and reasoning mechanisms of defeasible logic, a reputation-Oriented Agent model is proposed, which is capable of accepting policy guidance, the real-time rule modifications, and handling the run-time rule conflicts. This agent is both autonomous and controllable, and is able to cooperate with other Agents via contracts in an open and dynamic environment.

Style APA, Harvard, Vancouver, ISO itp.

16

NIDE, Naoyuki, Shiro Takata i Megumi Fujita. "Modeling Cooperative Actions Using an Extended BDI Logic TOMATOes". Transactions of the Japanese Society for Artificial Intelligence 26 (2011): 13–24. http://dx.doi.org/10.1527/tjsai.26.13.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

TAKATA, Shiro, Naoyuki NIDE i Megumi FUJITA. "Modeling Reinforcement Learning using an Extended BDI logic TOMATOes". Transactions of the Japanese Society for Artificial Intelligence 26 (2011): 156–65. http://dx.doi.org/10.1527/tjsai.26.156.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Zhang, Xiaohong, Xiangyu Ma i Xuejiao Wang. "Filters in Strong BI-Algebras and Residuated Pseudo-SBI-Algebras". Mathematics 8, nr 9 (4.09.2020): 1513. http://dx.doi.org/10.3390/math8091513.

Pełny tekst źródła

Streszczenie:

The concept of basic implication algebra (BI-algebra) has been proposed to describe general non-classical implicative logics (such as associative or non-associative fuzzy logic, commutative or non-commutative fuzzy logic, quantum logic). However, this algebra structure does not have enough characteristics to describe residual implications in depth, so we propose a new concept of strong BI-algebra, which is exactly the algebraic abstraction of fuzzy implication with pseudo-exchange principle (PEP). Furthermore, in order to describe the characteristics of the algebraic structure corresponding to the non-commutative fuzzy logics, we extend strong BI-algebra to the non-commutative case, and propose the concept of pseudo-strong BI (SBI)-algebra, which is the common extension of quantum B-algebras, pseudo-BCK/BCI-algebras and other algebraic structures. We establish the filter theory and quotient structure of pseudo-SBI- algebras. Moreover, based on prequantales, semi-uninorms, t-norms and their residual implications, we introduce the concept of residual pseudo-SBI-algebra, which is a common extension of (non-commutative) residual lattices, non-associative residual lattices, and also a special kind of residual partially-ordered groupoids. Finally, we investigate the filters and quotient algebraic structures of residuated pseudo-SBI-algebras, and obtain a unity frame of filter theory for various algebraic systems.

Style APA, Harvard, Vancouver, ISO itp.

19

Yu, Sen-Chi, i Min-Ning Yu. "FUZZY PARTIAL CREDIT SCALING: A VALID APPROACH FOR SCORING THE BECK DEPRESSION INVENTORY". Social Behavior and Personality: an international journal 35, nr 9 (1.01.2007): 1163–72. http://dx.doi.org/10.2224/sbp.2007.35.9.1163.

Pełny tekst źródła

Streszczenie:

In this study a new scaling method was proposed and validated, fuzzy partial credit scaling (FPCS), which combines fuzzy set theory (FST; Zadeh, 1965) with the partial credit model (PCM) for scoring the Beck Depression Inventory (BDI-II; Beck, Steer, & Brown, 1996). To achieve this, the Chinese version of the BDI-II (C-BDI-II) was administered to a clinical sample of outpatients suffering depression, and also to a nonclinical sample. Detailed FPCS procedures were illustrated and the raw score and FPCS were compared in terms of reliability and validity. The Cronbach alpha coefficient showed that the reliability of C-BDI-II was higher in FPCS than in raw score. Moreover, the analytical results showed that, via FPCS, the probability of correct classification of clinical and nonclinical was increased from 73.2% to 80.3%. That is, BDI scoring via FPCS achieves more accurate depression predictions than does raw score. Via FPCS, erroneous judgments regarding depression can be eliminated and medical costs associated with depression can be reduced. This study empirically showed that FST can be applied to psychological research as well as engineering. FST characterizes latent traits or human thinking more accurately than does crisp binary logic.

Style APA, Harvard, Vancouver, ISO itp.

20

Xin, Xiaolong, Yulong Fu, Yanyan Lai i Juntao Wang. "Monadic pseudo BCI-algebras and corresponding logics". Soft Computing 23, nr 5 (12.04.2018): 1499–510. http://dx.doi.org/10.1007/s00500-018-3189-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Perháč, Ján, Daniel Mihályi i Lukáš Maťaš. "Elimination of network intrusions via a resource oriented BDI architecture". Open Computer Science 8, nr 1 (1.11.2018): 173–81. http://dx.doi.org/10.1515/comp-2018-0016.

Pełny tekst źródła

Streszczenie:

Abstract We propose a resource-oriented architecture of a rational agent for a network intrusion detection system. This architecture describes the behavior of a rational agent after detection of unwanted network activities. We describe the creation of countermeasures to ward off detected threats. Examples are created based on the proposed architecture, describing the process during a rational agent detection. We have described these examples by linear BDI logic behavioral formulæ, that have been proven by Gentzen sequent calculus.

Style APA, Harvard, Vancouver, ISO itp.

22

Kowalski, Tomasz. "Self-implications in BCI". Notre Dame Journal of Formal Logic 49, nr 3 (lipiec 2008): 295–305. http://dx.doi.org/10.1215/00294527-2008-013.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Wu, Xiaoying, i Xiaohong Zhang. "The Structure Theorems of Pseudo-BCI Algebras in Which Every Element is Quasi-Maximal". Symmetry 10, nr 10 (8.10.2018): 465. http://dx.doi.org/10.3390/sym10100465.

Pełny tekst źródła

Streszczenie:

For mathematical fuzzy logic systems, the study of corresponding algebraic structures plays an important role. Pseudo-BCI algebra is a class of non-classical logic algebras, which is closely related to various non-commutative fuzzy logic systems. The aim of this paper is focus on the structure of a special class of pseudo-BCI algebras in which every element is quasi-maximal (call it QM-pseudo-BCI algebras in this paper). First, the new notions of quasi-maximal element and quasi-left unit element in pseudo-BCK algebras and pseudo-BCI algebras are proposed and some properties are discussed. Second, the following structure theorem of QM-pseudo-BCI algebra is proved: every QM-pseudo-BCI algebra is a KG-union of a quasi-alternating BCK-algebra and an anti-group pseudo-BCI algebra. Third, the new notion of weak associative pseudo-BCI algebra (WA-pseudo-BCI algebra) is introduced and the following result is proved: every WA-pseudo-BCI algebra is a KG-union of a quasi-alternating BCK-algebra and an Abel group.

Style APA, Harvard, Vancouver, ISO itp.

24

ZHao, Hong-Quan, i Seiya Kasai. "WPG-Controlled Quantum BDD Circuits with BDD Architecture on GaAs-Based Hexagonal Nanowire Network Structure". Journal of Nanomaterials 2012 (2012): 1–6. http://dx.doi.org/10.1155/2012/726860.

Pełny tekst źródła

Streszczenie:

One-dimensional nanowire quantum devices and basic quantum logic AND and OR unit on hexagonal nanowire units controlled by wrap gate (WPG) were designed and fabricated on GaAs-based one-dimensional electron gas (1-DEG) regular nanowire network with hexagonal topology. These basic quantum logic units worked correctly at 35 K, and clear quantum conductance was achieved on the node device, logic AND circuit unit, and logic OR circuit unit. Binary-decision-diagram- (BDD-) based arithmetic logic unit (ALU) is realized on GaAs-based regular nanowire network with hexagonal topology by the same fabrication method as that of the quantum devices and basic circuits. This BDD-based ALU circuit worked correctly at room temperature. Since these quantum devices and circuits are basic units of the BDD ALU combinational circuit, the possibility of integrating these quantum devices and basic quantum circuits into the BDD-based quantum circuit with more complicated structures was discussed. We are prospecting the realization of quantum BDD combinational circuitries with very small of energy consumption and very high density of integration.

Style APA, Harvard, Vancouver, ISO itp.

25

Wu, Lijun, Kaile Su, Abdul Sattar, Qingliang Chen, Jinshu Su i Wei Wu. "A complete first-order temporal BDI logic for forest multi-agent systems". Knowledge-Based Systems 27 (marzec 2012): 343–51. http://dx.doi.org/10.1016/j.knosys.2011.11.006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Wilges, Beatriz, Gustavo Pereira Mateus, Silvia Modesto Nassar i Rogerio Cid Bastos. "Integration of BDI agent with Fuzzy Logic in a Virtual Learning Environment". IEEE Latin America Transactions 10, nr 1 (styczeń 2012): 1370–76. http://dx.doi.org/10.1109/tla.2012.6142486.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Kowalski, Tomasz, i Sam Butchart. "A Note on Monothetic BCI". Notre Dame Journal of Formal Logic 47, nr 4 (październik 2006): 541–44. http://dx.doi.org/10.1305/ndjfl/1168352666.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Wille, Robert, i Rolf Drechsler. "BDD-Based Synthesis of Reversible Logic". International Journal of Applied Metaheuristic Computing 1, nr 4 (październik 2010): 25–41. http://dx.doi.org/10.4018/jamc.2010100102.

Pełny tekst źródła

Streszczenie:

Reversible logic became a promising alternative to traditional circuits because of its applications in emerging technologies such as quantum computing, low-power design, DNA computing, or nanotechnologies. As a result, synthesis of the respective circuits is an intensely studied topic. However, most synthesis methods are limited, because they rely on a truth table representation of the function to be synthesized. In this paper, the authors present a synthesis approach that is based on Binary Decision Diagrams (BDDs). The authors propose a technique to derive reversible or quantum circuits from BDDs by substituting all nodes of the BDD with a cascade of Toffoli or quantum gates, respectively. Boolean functions containing more than a hundred of variables can efficiently be synthesized. More precisely, a circuit can be obtained from a given BDD using an algorithm with linear worst case behavior regarding run-time and space requirements. Furthermore, using the proposed approach, theoretical results known from BDDs can be transferred to reversible circuits. Experiments show better results (with respect to the circuit cost) and a significantly better scalability in comparison to previous synthesis approaches.

Style APA, Harvard, Vancouver, ISO itp.

29

Wai, Sim Keng, Cheah WaiShiang, Muhammad Asyraf Bin Khairuddin, Yanti Rosmunie Binti Bujang, Rahmat Hidayat i Celine Haren Paschal. "Autonomous Agents in 3D Crowd Simulation Through BDI Architecture". JOIV : International Journal on Informatics Visualization 5, nr 1 (18.03.2021): 1. http://dx.doi.org/10.30630/joiv.5.1.371.

Pełny tekst źródła

Streszczenie:

Agent based simulation (ABS) is a paradigm to modelling systems included of autonomous and interacting agents. ABS has been tremendous growth and used by researchers in the social sciences to study socio-environmental complex systems. To date, various platforms have been introduced for agent-based social simulation. They are rule based in any logic, python based in SPADE and etc. Although those platforms have been introduced, there is still an insufficient to develop a crowd simulation in 3D platform. Having a 3D platform is needed to enabling the crowd simulation for training purposes. However, the current tools and platform still lack features to develop and simulate autonomous agents in the 3D world. This paper introduced a BDI plug in at Unity3D for crowd simulation. BDI is an intelligent agent architecture and it is able to develop autonomous agents in crowd environment. In this paper, we present the BDI plug with a case study of Australia bush fire and discuss a method to support autonomous agents' development in 3D crowd simulation. The tool allows the modeller to develop autonomous agents in 3D world by taking the advantages of Unity3D.

Style APA, Harvard, Vancouver, ISO itp.

30

Congguang Yang i M. Ciesielski. "BDS: a BDD-based logic optimization system". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21, nr 7 (lipiec 2002): 866–76. http://dx.doi.org/10.1109/tcad.2002.1013899.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

KLARLUND, NILS, ANDERS MØLLER i MICHAEL I. SCHWARTZBACH. "MONA IMPLEMENTATION SECRETS". International Journal of Foundations of Computer Science 13, nr 04 (sierpień 2002): 571–86. http://dx.doi.org/10.1142/s012905410200128x.

Pełny tekst źródła

Streszczenie:

The MONA tool provides an implementation of automaton-based decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in practice, even though it faces a theoretically non-elementary worst-case complexity. The implementation has matured over a period of six years. Compared to the first naive version, the present tool is faster by several orders of magnitude. This speedup is obtained from many different contributions working on all levels of the compilation and execution of formulas. We present an overview of MONA and a selection of implementation "secrets" that have been discovered and tested over the years, including formula reductions, DAGification, guided tree automata, three-valued logic, eager minimization, BDD-based automata representations, and cache-conscious data structures. We describe these techniques and quantify their respective effects by experimenting with separate versions of the MONA tool that in turn omit each of them.

Style APA, Harvard, Vancouver, ISO itp.

32

Hindley, J. Roger. "BCK and BCI logics, condensed detachment and the $2$-property." Notre Dame Journal of Formal Logic 34, nr 2 (marzec 1993): 231–50. http://dx.doi.org/10.1305/ndjfl/1093634655.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Sankar, S., i P. Srinivasan. "Energy and Load Aware Routing Protocol for Internet of Things". International Journal of Advances in Applied Sciences 7, nr 3 (1.08.2018): 255. http://dx.doi.org/10.11591/ijaas.v7.i3.pp255-264.

Pełny tekst źródła

Streszczenie:

<p>Maximizing the network lifetime is one of the major challenges in Low Power and Lossy Networks (LLN). Routing plays a vital role in it by minimizing the energy consumption across the networks through the efficient route selection for data transfer. IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) is a IETF standardized IPv6 routing protocol for LLN. In this paper, we propose Energy and Load aware RPL (EL-RPL) protocol, which is an enhancement of RPL protocol. It uses a composite metric, calculated based on expected transmission count (ETX), Load and battery depletion index (BDI), for the route, selection. The COOJA simulator is used for performance evaluation. EL-RPL is compared with other similar protocols RER(BDI) RPL and fuzzy logic based RPL (OF-FL RPL). The simulation result shows that the EL-RPL improves the network lifetime by 8-12% and packet delivery ratio 2-4%.</p>

Style APA, Harvard, Vancouver, ISO itp.

34

Li, Zheng, Diego Seco i Alexis Sánchez Rodríguez. "Microservice-Oriented Platform for Internet of Big Data Analytics: A Proof of Concept". Sensors 19, nr 5 (6.03.2019): 1134. http://dx.doi.org/10.3390/s19051134.

Pełny tekst źródła

Streszczenie:

The ubiquitous Internet of Things (IoT) devices nowadays are generating various and numerous data from everywhere at any time. Since it is not always necessary to centralize and analyze IoT data cumulatively (e.g., the Monte Carlo analytics and Convergence analytics demonstrated in this article), the traditional implementations of big data analytics (BDA) will suffer from unnecessary and expensive data transmissions as a result of the tight coupling between computing resource management and data processing logics. Inspired by software-defined infrastructure (SDI), we propose the “microservice-oriented platform” to break the environmental monolith and further decouple data processing logics from their underlying resource management in order to facilitate BDA implementations in the IoT environment (which we name “IoBDA”). Given predesigned standard microservices with respect to specific data processing logics, the proposed platform is expected to largely reduce the complexity in and relieve inexperienced practices of IoBDA implementations. The potential contributions to the relevant communities include (1) new theories of a microservice-oriented platform on top of SDI and (2) a functional microservice-oriented platform for IoBDA with a group of predesigned microservices.

Style APA, Harvard, Vancouver, ISO itp.

35

Shorstova, Tatiana, William D. Foulkes i Michael Witcher. "Achieving clinical success with BET inhibitors as anti-cancer agents". British Journal of Cancer 124, nr 9 (15.03.2021): 1478–90. http://dx.doi.org/10.1038/s41416-021-01321-0.

Pełny tekst źródła

Streszczenie:

AbstractThe transcriptional upregulation of oncogenes is a driving force behind the progression of many tumours. However, until a decade ago, the concept of ‘switching off’ these oncogenic pathways represented a formidable challenge. Research has revealed that members of the bromo- and extra-terminal domain (BET) motif family are key activators of oncogenic networks in a spectrum of cancers; their function depends on their recruitment to chromatin through two bromodomains (BD1 and BD2). The advent of potent inhibitors of BET proteins (BETi), which target either one or both bromodomains, represents an important step towards the goal of suppressing oncogenic networks within tumours. Here, we discuss the biology of BET proteins, advances in BETi design and highlight potential biomarkers predicting their activity. We also outline the logic of incorporating BETi into combination therapies to enhance its efficacy. We suggest that understanding mechanisms of activity, defining predictive biomarkers and identifying potent synergies represents a roadmap for clinical success using BETi.

Style APA, Harvard, Vancouver, ISO itp.

36

Ni, Haiyan, Jianping Hu, Xuqiang Zhang i Haotian Zhu. "BDD-Based Topology Optimization for Low-Power DTIG FinFET Circuits". Active and Passive Electronic Components 2019 (18.07.2019): 1–9. http://dx.doi.org/10.1155/2019/8292653.

Pełny tekst źródła

Streszczenie:

This paper proposed a logic synthesis method based on binary decision diagram (BDD) representation. The proposed method is optimized for dual-threshold independent-gate (DTIG) FinFET circuits. The algorithm of the BDD-based topology optimization is stated in detail. Some kinds of feature subgraph structures of a BDD are extracted by the extraction algorithm and then fed to mapping algorithm to get a final optimized circuit based on predefined DTIG FinFET logic gates. Some MCNC benchmark circuits are tested under the proposed synthesis method by comparing with ABC, DC tools. The simulations show that the proposed synthesis method can obtain performance improvement for DTIG FinFET circuits.

Style APA, Harvard, Vancouver, ISO itp.

37

Fernandez-Amoros, David, Sergio Bra, Ernesto Aranda-Escolástico i Ruben Heradio. "Using Extended Logical Primitives for Efficient BDD Building". Mathematics 8, nr 8 (31.07.2020): 1253. http://dx.doi.org/10.3390/math8081253.

Pełny tekst źródła

Streszczenie:

Binary Decision Diagrams (BDDs) have been used to represent logic models in a variety of research contexts, such as software product lines, circuit testing, and plasma confinement, among others. Although BDDs have proven to be very useful, the main problem with this technique is that synthesizing BDDs can be a frustratingly slow or even unsuccessful process, due to its heuristic nature. We present an extension of propositional logic to tackle one recurring phenomenon in logic modeling, namely groups of variables related by an exclusive-or relationship, and also consider two other extensions: one in which at least n variables in a group are true and another one for in which at most n variables are true. We add XOR, atLeast-n and atMost-n primitives to logic formulas in order to reduce the size of the input and also present algorithms to efficiently incorporate these constructions into the building of BDDs. We prove, among other results, that the number of nodes created during the process for XOR groups is reduced from quadratic to linear for the affected clauses. the XOR primitive is tested against eight logical models, two from industry and six from Kconfig-based open-source projects. Results range from no negative effects in models without XOR relations to performance gains well into two orders of magnitude on models with an abundance of this kind of relationship.

Style APA, Harvard, Vancouver, ISO itp.

38

Kubica, Marcin, i Dariusz Kania. "SMTBDD: New Form of BDD for Logic Synthesis". International Journal of Electronics and Telecommunications 62, nr 1 (1.03.2016): 33–41. http://dx.doi.org/10.1515/eletel-2016-0004.

Pełny tekst źródła

Streszczenie:

Abstract The main purpose of the paper is to suggest a new form of BDD - SMTBDD diagram, methods of obtaining, and its basic features. The idea of using SMTBDD diagram in the process of logic synthesis dedicated to FPGA structures is presented. The creation of SMTBDD diagrams is the result of cutting BDD diagram which is the effect of multiple decomposition. The essence of a proposed decomposition method rests on the way of determining the number of necessary ‘g’ bounded functions on the basis of the content of a root table connected with an appropriate SMTBDD diagram. The article presents the methods of searching non-disjoint decomposition using SMTBDD diagrams. Besides, it analyzes the techniques of choosing cutting levels as far as effective technology mapping is concerned. The paper also discusses the results of the experiments which confirm the efficiency of the analyzed decomposition methods.

Style APA, Harvard, Vancouver, ISO itp.

39

Grygiel, K., P. M. Idziak i M. Zaionc. "How big is BCI fragment of BCK logic". Journal of Logic and Computation 23, nr 3 (29.05.2012): 673–91. http://dx.doi.org/10.1093/logcom/exs017.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Vemuri, Navin, Priyank Kalla i Russell Tessier. "BDD-based logic synthesis for LUT-based FPGAs". ACM Transactions on Design Automation of Electronic Systems 7, nr 4 (październik 2002): 501–25. http://dx.doi.org/10.1145/605440.605442.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Kao, Chi-Chou. "BDD-based synthesis for mixed CMOS/PTL logic". International Journal of Circuit Theory and Applications 39, nr 9 (29.04.2010): 923–32. http://dx.doi.org/10.1002/cta.676.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Bibilo, P. N., i A. M. Pazniak. "The search for subsystems of related functions from multilevel representation of systems of Boolean functions1". Informatics 17, nr 1 (29.03.2020): 63–77. http://dx.doi.org/10.37661/1816-0301-2020-17-1-63-77.

Pełny tekst źródła

Streszczenie:

One of the directions of logical optimization of multilevel representations of systems of Boolean functions is the methods based on the search of subsystems of functions that have the same parts in the domains of functions of selected subsystems. Such subsystems are called related. The good relationship of functions leads to the appearance of a large number of identical structural parts (conjunctions, algebraic expressions, subfunctions, etc.) in optimized forms of representation of functions which are used in the construction of combinational logic circuits. The more the functions of the selected subsystem are related, the sooner it is expected that in the representations of the functions of this subsystem will be more identical subexpressions and synthesized logic circuits will have less complexity. We describe software-implemented algorithms for extracting subsystems of related functions from a BDD representation of a system of Boolean functions based on introduced numerical estimates of the relationship of BDD representations of functions. The relationship of Boolean functions is the presence of Boolean vectors, where the functions take the value as one, or of the same equations in BDD representations. BDD representations of Boolean functions are compact forms defining functions and are constructed as the result of Shannon decomposition of the functions of the original system (resulting from the decomposition of subfunctions) by all variables, which the functions of the original system depend on. The experiments show the effectiveness of proposed algorithms and programs in the synthesis of logic circuits from logic elements library.

Style APA, Harvard, Vancouver, ISO itp.

43

Kubica, Marcin, i Dariusz Kania. "Area–Oriented Technology Mapping for LUT–Based Logic Blocks". International Journal of Applied Mathematics and Computer Science 27, nr 1 (28.03.2017): 207–22. http://dx.doi.org/10.1515/amcs-2017-0015.

Pełny tekst źródła

Streszczenie:

Abstract One of the main aspects of logic synthesis dedicated to FPGA is the problem of technology mapping, which is directly associated with the logic decomposition technique. This paper focuses on using configurable properties of CLBs in the process of logic decomposition and technology mapping. A novel theory and a set of efficient techniques for logic decomposition based on a BDD are proposed. The paper shows that logic optimization can be efficiently carried out by using multiple decomposition. The essence of the proposed synthesis method is multiple cutting of a BDD. A new diagram form called an SMTBDD is proposed. Moreover, techniques that allow finding the best technology mapping oriented to configurability of CLBs are presented. In the experimental section, the presented method (MultiDec) is compared with academic and commercial tools. The experimental results show that the proposed technology mapping strategy leads to good results in terms of the number of CLBs.

Style APA, Harvard, Vancouver, ISO itp.

44

Kubica, Marcin, Adam Opara i Dariusz Kania. "Logic Synthesis Strategy Oriented to Low Power Optimization". Applied Sciences 11, nr 19 (22.09.2021): 8797. http://dx.doi.org/10.3390/app11198797.

Pełny tekst źródła

Streszczenie:

The article presents a synthesis strategy focused on low power implementations of combinatorial circuits in an array-type FPGA structure. Logic functions are described by means of BDD. A new form of the SWitch activity BDD diagram (SWBDD) is proposed, which enables a function decomposition to minimize the switching activity of circuits. The essence of the proposed idea lies in the proper ordering of the variables and cutting the diagram, ensuring the minimization of switching in the combination circuit. This article contains the results of experiments confirming the effectiveness of the developed concept of decomposition. They were performed on popular benchmarks using academic and commercial synthesis systems.

Style APA, Harvard, Vancouver, ISO itp.

45

Bibilo, P. N., i V. I. Romanov. "Minimization of Binary Decision Diagrams for Systems of Completely Defined Boolean Functions using Algebraic Representations of Cofactors". INFORMACIONNYE TEHNOLOGII 27, nr 8 (11.08.2021): 395–408. http://dx.doi.org/10.17587/it.27.395-408.

Pełny tekst źródła

Streszczenie:

In design systems for digital VLSI (very large integrated circuits), the BDD is used for VLSI verification, as well as for technologically independent optimization, performed as the first stage in the synthesis of logic circuits in various technological bases. BDD is an acyclic graph defining a Boolean function or a system of Boolean functions. Each vertex of this graph corresponds to the complete or reduced Shannon expansion formula. Having constructed BDD representation for systems of Boolean functions, it is possible to perform additional logical optimization based on the proposed method of searching for algebraic representations of cofactors (subfunctions) of the same BDD level in the form of a disjunction or conjunction of other cofactors of this BDD level. The method allows to reduce the number of literals by replacing the Shannon expansion formulas with simpler formulas that are disjunctions or conjunctions of cofactors, and to reduce the number of literals in specifying a system of Boolean functions. The number of literals in algebraic multilevel representations of systems of fully defined Boolean functions is the main optimization criterion in the synthesis of combinational circuits from library logic gates.

Style APA, Harvard, Vancouver, ISO itp.

46

Bibilo, P. N., i V. I. Romanov. "Experimental Study of Algorithms for Minimization of Binary Decision Diagrams using Algebraic Representations of Cofactors". Programmnaya Ingeneria 13, nr 2 (17.02.2022): 51–67. http://dx.doi.org/10.17587/prin.13.51-67.

Pełny tekst źródła

Streszczenie:

BDD (Binary Decision Diagram) is used for technology-independent optimization, performed as the first stage in the synthesis of logic circuits in the design of ASIC (application-specific integrated circuit). BDD is an acyclic graph defining a Boolean function or a system of Boolean functions. Each vertex of this graph is associated with the complete or reduced Shannon expansion formula. Binary decision diagrams with mutually inverse subfunctions (cofac-tors) are considered. We have developed algorithms for finding algebraic representations of cofactors of the same BDD level in the form of a disjunction or conjunction of other inverse or non-inverse cofactors of the same BDD level. The algorithms make it possible to reduce the number of literals by replacing the Shannon expansion formulas with simpler logical formulas and to reduce the number of literals in the description of a system of Boolean functions. We propose to use the developed algorithms for an additional logical optimization of the constructed BDD representations of systems of Boolean functions. Experimental results of the application of the corresponding programs in the synthesis of logic circuits in the design library of custom VLSI CMOS circuits are presented.

Style APA, Harvard, Vancouver, ISO itp.

47

Jun, Young Bae, i Xiao Long Xin. "Complex Fuzzy Sets with Application in BCK/BCI-Algebras". Bulletin of the Section of Logic 48, nr 3 (30.10.2019): 173–85. http://dx.doi.org/10.18778/0138-0680.48.3.02.

Pełny tekst źródła

Streszczenie:

As a generation of fuzzy set, the notion of complex fuzzy set which is an innovative concept is introduced by Ramot, Milo, Friedman and Kandel. The purpose of this article is to apply complex fuzzy set to BCK/BCI-algebras. The notions of a complex subalgebra and a complex left (right) reduced ideal in a BCK/BCI- algebra are introduced, and related properties are investigated. Characterizations of a complex subalgebra are provided, and the homomorphic image (preimage) of a complex subalgebra and a complex left (right) reduced ideal.

Style APA, Harvard, Vancouver, ISO itp.

48

Wobcke, Wayne. "A logic of intention and action for regular BDI agents based on bisimulation of agent programs". Autonomous Agents and Multi-Agent Systems 29, nr 4 (18.05.2014): 569–620. http://dx.doi.org/10.1007/s10458-014-9263-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Bibilo, P. N., i V. I. Romanov. "Minimization of binary decision diagrams for systems of completely defined Boolean functions using Shannon expansions and algebraic representations of cofactors". Informatics 18, nr 2 (1.07.2021): 7–32. http://dx.doi.org/10.37661/1816-0301-2021-18-2-7-32.

Pełny tekst źródła

Streszczenie:

In the systems of digital VLSI design (Very Large Integrated Circuits), the BDD (Binary Decision Diagram) is used for VLSI verification, as well as for technologically independent optimization as the first stage in the synthesis of logic circuits in various technological bases. The BDD is an acyclic graph defining a Boolean function or a system of Boolean functions. Each vertex of this graph corresponds to the complete or reduced Shannon expansion formula. When BDD representation for systems of Boolean functions is constructed, it is possible to perform additional logical optimization based on the proposed method of searching for algebraic representations of cofactors (subfunctions) of the same BDD level in the form of a disjunction, conjunction either exclusive-or of cofactors of the same level or lower levels of BDD. A directed BDD graph for a system of functions is constructed on the basis of Shannon expansion of all component functions of the system by the same permutation of variables. The method allows to reduce the number of literals by replacing the Shannon expansion formulas with simpler formulas that are disjunctions or conjunctions of cofactors, and to reduce the number of literals in specifying a system of Boolean functions. The number of literals in algebraic multilevel representations of systems of fully defined Boolean functions is the main optimization criterion in the synthesis of combinational circuits from librarian logic elements.

Style APA, Harvard, Vancouver, ISO itp.

50

Kubica, Marcin, Adam Opara i Dariusz Kania. "Logic synthesis for FPGAs based on cutting of BDD". Microprocessors and Microsystems 52 (lipiec 2017): 173–87. http://dx.doi.org/10.1016/j.micpro.2017.06.010.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!