In connexive logic,two fundamental ideas are observed:first,no proposition im-plies or is implied by its own negation;second,if a proposition implies p then it will not imply the negation of 4p.In classical logic,neit...In connexive logic,two fundamental ideas are observed:first,no proposition im-plies or is implied by its own negation;second,if a proposition implies p then it will not imply the negation of 4p.In classical logic,neither of the ideas holds,which makes it difficult to give a natural semantics for connexive logic.By combining Kleene's three valued logic and Lewis'conditional logic,we propose a new natural semantics for connexive logic.We give four ax-iomatic systems characterizing different classes of selection models in the new semantics.We prove soundness and completeness of these logics and compare them with some comexive 1og-ics in the literature.展开更多
In modal logic,topological semantics is an intuitive and natural special case of neighbourhood semantics.This paper stems from the observation that the satisfaction relation of topological semantics applies to subset ...In modal logic,topological semantics is an intuitive and natural special case of neighbourhood semantics.This paper stems from the observation that the satisfaction relation of topological semantics applies to subset spaces which are more general than topological spaces.The minimal modal logic which is strongly sound and complete with respect to the class of subset spaces is found.Soundness and completeness results of some famous modal logics(e.g.S4,S5 and Tr)with respect to various important classes of subset spaces(eg intersection structures and complete fields of sets)are also proved.In the meantime,some known results,e.g.the soundness and completeness of Tr with respect to the class of discrete topological spaces,are proved directly using some modifications of the method of canonical mode1,without a detour via neighbourhood semantics or relational semantics.展开更多
Institutional logic theory,a pivotal framework within organizational studies,delineates the multifaceted and intricate logics that underpin organizational fields.This theoretical perspective elucidates the manner in w...Institutional logic theory,a pivotal framework within organizational studies,delineates the multifaceted and intricate logics that underpin organizational fields.This theoretical perspective elucidates the manner in which diverse individuals or groups within an organization internalize and manifest distinct institutional logics,alongside the ensuing political and cultural conflicts.Furthermore,the theory endeavors to elucidate the complexities inherent in institutional logic across organizational fields,examining the reflection of these logics among various individuals or groups and their associated political and cultural dichotomies.Central to this discourse is the acknowledgment of the core systems that constitute the fabric of a country,encompassing the state,market,familial structures,corporate entities,professional bodies,and religious institutions.These components not only coexist with inherent conflicts but also exhibit a high degree of interdependence,underlined by their shared institutional logics.This literature attempts to review and analysis institutional logic in the field of entrepreneurship and integrates institutional logic into entrepreneurs’personal background,experience,and other social characteristics,and study how institutional logic operates.It is recommended that future researchers take entrepreneurs as the research object and conduct more in-depth research on the evolution of organizational response strategies when political and cultural conflicts occur between different groups within the enterprise,combined with institutional logic theory.展开更多
This article extends the foundational work of Wang and Wang on modal logic over lattices.Building upon their framework using polyadic modal logic with binary modalities<sup>and<inf>under standard Kripke se...This article extends the foundational work of Wang and Wang on modal logic over lattices.Building upon their framework using polyadic modal logic with binary modalities<sup>and<inf>under standard Kripke semantics to axiomatize lattice structures,we focus on the modal characterization of bounded lattices and their extensions relevant to logical systems.By introducing nullary modalities 1(maximum element)and 0(minimum element),we first establish a modal axiomatic system for bounded lattices.Subsequently,we provide pure formula characterizations of complementation and orthocomplementation relations in lattices,along with corresponding completeness results.As key applications,we present modal characterizations of fundamental logical algebraic structures:Boolean algebras,orthomodular lattices,and Heyting algebras.The last section develops novel axiomatization results for atomic lattices and atomless lattices.Throughout this work,all axiomatic systems are shown to be strongly complete via pureformula extensions,demonstrating how hybrid modal languages with nullary operators can uniformly capture boundary elements,complementation properties,and latticetheoretic operations central to both classical and nonclassical logics.展开更多
In recent years,acoustic logic gates has attracted growing interest in acoustics due to their promising applications in acoustic communication and signal processing.For practical implementation,these logic gates must ...In recent years,acoustic logic gates has attracted growing interest in acoustics due to their promising applications in acoustic communication and signal processing.For practical implementation,these logic gates must operate over a certain bandwidth to ensure reliable performance.However,current experimental realizations have predominantly been confined to single-frequency or narrowband operation,leaving their broadband capabilities largely unverified.To address this gap,we present both numerical and experimental demonstrations of three basic acoustic logic gates(OR,NOT,and AND)using a phased unit cell composed of a central channel flanked by two arrays of semicircular cavities.By leveraging phase modulation of the unit cells and linear interference of sound,we achieve these logic operations with a uniform threshold of I_(t)=0.25.Remarkably,the measured fractional bandwidths(bandwidth relative to center frequency)reach approximately 111.5%(OR),37.2%(NOT),and 48.5%(AND),demonstrating ultra-broadband functionality.The proposed logic gates combine exceptional bandwidth with structural simplicity,offering significant potential for applications in acoustic computing,information processing,and integrated acoustic systems.展开更多
This paper explores the algebraic essence of universal logic functions(ULFs)from an algebraic perspective.Under the framework of semi-tensor product of matrices,the“sequential nature”of ULFs is revealed.Utilizing th...This paper explores the algebraic essence of universal logic functions(ULFs)from an algebraic perspective.Under the framework of semi-tensor product of matrices,the“sequential nature”of ULFs is revealed.Utilizing the nature,a technique called universal transformation method is proposed,by which any ULF can be transformed into an equivalent expression with desired features that facilitate achieving specific objectives,such as modeling,analyzing and synthesizing universal logical systems.Furthermore,several useful logical operators are constructed in a mixed-dimensional situation,including power-raising operator,power-descending operator,erasure operator,and appending operator.Finally,these results are applied to model and analyze finite state machines and their networks,which demonstrate the practical value of the method and operators.展开更多
To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressi...To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressions （FCDLs） is presented. The syntax and semantics of FCDLs are formally defined, and the forms of axioms and assertions in FCDLs knowledge bases are specified. FCDLs combine both fuzzy concepts from the fuzzy description logics （FDLs） and cut concepts from the extended fuzzy description logics （EFDLs） in the same theory. Furthermore, cut concepts are extended into comparison cut concepts in FCDLs to represent comparison expressions between fuzzy membership degrees, which are often used in practice but not supported by the other fuzzy extensions of description logics. FCDLs have more expressive power than FDLs and EFDLs, and are able to represent expressive fuzzy knowledge and to perform reasoning tasks based on them. Therefore, FCDLs can enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.展开更多
We demonstrate the flaws of Mao's method, which is an augmentation ofprotocol idealization in BAN-like logics, and then offer some new idealization rules based on Mao'smethod. Furthermore, we give some theoret...We demonstrate the flaws of Mao's method, which is an augmentation ofprotocol idealization in BAN-like logics, and then offer some new idealization rules based on Mao'smethod. Furthermore, we give some theoretical analysis of our rules using the strand spaceformalism, and show the soundness of our idealization rules under strand spaces Some examples onusing the new rules to analyze security protocols are also concerned. Our idealization method ismore effective than Mao's method towards many protocol instances, and is supported by a formalmodel.展开更多
Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term...Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term definition set, instantiation assertion set and term restriction set. Based on the extended model, the issue on ontology checking was studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.展开更多
This paper proposes an algorithm applied in se mantic P2P network based on the description logics with the purpose for realizing the concepts distribution of resources, which makes the resources semantic locating easy...This paper proposes an algorithm applied in se mantic P2P network based on the description logics with the purpose for realizing the concepts distribution of resources, which makes the resources semantic locating easy. With the idea of the consistent hashing in the Chord, our algorithm stores the addresses and resources with the values of the same type to select instance. In addition, each peer has its own ontology, which will be completed by the knowledge distributed over the network during the exchange of CHGs （classification hierarchy graphs）. The hierarchy classification of concepts allows to find matching resource by querying to the upper level concept because the all concepts described in the CHG have the same root.展开更多
Neurons with complex-valued weights have stronger capability because of their multi-valued threshold logic. Neurons with such features may be suitable for solution of different kinds of problems including associative ...Neurons with complex-valued weights have stronger capability because of their multi-valued threshold logic. Neurons with such features may be suitable for solution of different kinds of problems including associative memory,image recognition and digital logical mapping. In this paper,robustness or tolerance is introduced and newly defined for this kind of neuron ac-cording to both their mathematical model and the perceptron neuron's definition of robustness. Also,the most robust design for basic digital logics of multiple variables is proposed based on these robust neurons. Our proof procedure shows that,in robust design each weight only takes the value of i or -i,while the value of threshold is with respect to the number of variables. The results demonstrate the validity and simplicity of using robust neurons for realizing arbitrary digital logical functions.展开更多
In the quantum mechanical Hilbert space formalism, the probabilistic interpretation is a later ad-hoc add-on, more or less enforced by the experimental evidence, but not motivated by the mathematical model itself. A m...In the quantum mechanical Hilbert space formalism, the probabilistic interpretation is a later ad-hoc add-on, more or less enforced by the experimental evidence, but not motivated by the mathematical model itself. A model involving a clear probabilistic interpretation from the very beginning is provided by the quantum logics with unique conditional probabilities. It includes the projection lattices in von Neumann algebras and here probability conditionalization becomes identical with the state transition of the Lueders-von Neumann measurement process. This motivates the definition of a hierarchy of five compatibility and comeasurability levels in the abstract setting of the quantum logics with unique conditional probabilities. Their meanings are： the absence of quantum interference or influence, the existence of a joint distribution, simultaneous measurability, and the independence of the final state after two successive measurements from the sequential order of these two measurements. A further level means that two elements of the quantum logic （events） belong to the same Boolean subalgebra. In the general case, the five compatibility and comeasurability levels appear to differ, but they all coincide in the common Hilbert space formalism of quantum mechanics, in von Neumann algebras, and in some other cases.展开更多
Nonmonotonic reasoning and nonmonotonic truth maintenance are two important research aspects of artificial intelligence, which have close relations. Existing nonmonotonic truth maintenance systems can be used as the t...Nonmonotonic reasoning and nonmonotonic truth maintenance are two important research aspects of artificial intelligence, which have close relations. Existing nonmonotonic truth maintenance systems can be used as the theorem provers of conventional nonmonotonic logics, but they can't represent and deal with prioritized nonmonotonic reasoning. This paper presented stratified truth maintenance systems which can represent and deal with prioritized justifications. It will be shown that the stratified ATMS can be used as a theorem prover of prioritized nonmonotonic logics.展开更多
Cells are open systems that exchange energy and molecules with their environment.As any material system,they perform all the complex activities required for homeostasis and reproduction,obeying the thermodynamic laws....Cells are open systems that exchange energy and molecules with their environment.As any material system,they perform all the complex activities required for homeostasis and reproduction,obeying the thermodynamic laws.This viewpoint will argue that the basic logic governing the energy flux required to preserve cell organization and function is simple:to decrease the activation energy(Ea)of specific processes.Almost none of the possible chemical reactions and energy transformations inside a cell occur at a measurable speed at room or body temperature.Enzymes or other macromolecular structures speed up particular transformations by decreasing the corresponding energetic barriers.However,to maintain the systems in a homeostatic state,capable of sophisticated functions based on this simple strategy requires an inconceivably complex solution.The conclusion will point to the challenging and intricate problems that cells have solved to carve the highly regulated channel through which the energy flows,fueling the work of these nanoscale machines.展开更多
Logicians have worked with so many different logical systems that it is not possible even to esti-mate the number. Of these, many are best seen as extensions of classical logic, including both thoseof interest to math...Logicians have worked with so many different logical systems that it is not possible even to esti-mate the number. Of these, many are best seen as extensions of classical logic, including both thoseof interest to mathematics and those of interest to philosophy and computer science. (Henceforth Iwill use the term "intelligent systems theory" for the common ground of philosophical logic and展开更多
Description logics (DLs) are a family of logic-based knowledge representation formalisms with a number of computer science applications. DLs are especially well-known to be valuable for obtaining logical foundations o...Description logics (DLs) are a family of logic-based knowledge representation formalisms with a number of computer science applications. DLs are especially well-known to be valuable for obtaining logical foundations of web ontology languages (e.g., W3C’s ontology language OWL). Paraconsistent (or inconsistency-tolerant) description logics (PDLs) have been studied to cope with inconsistencies which may frequently occur in an open world. In this paper, a comparison and survey of PDLs is presented. It is shown that four existing paraconsistent semantics (i.e., four-valued semantics, quasi-classical semantics, single-interpretation semantics and dual-interpretation semantics) for PDLs are essentially the same semantics. To show this, two generalized and extended new semantics are introduced, and an equivalence between them is proved.展开更多
In industrial control systems,such as power transmission facilities and water treatment plants,Programmable Logic Controllers(PLCs)can work consistently and stably over long periods if there are no faults.Black-box id...In industrial control systems,such as power transmission facilities and water treatment plants,Programmable Logic Controllers(PLCs)can work consistently and stably over long periods if there are no faults.Black-box identification aims to automatically construct Petri net models with the help of I/O signals from PLC devices only.The main challenge is how to convert the infinitely long PLC signals into an event sequence,which is the foundation for subsequent modeling.The current algorithms are confronted with a number of challenges,including an exponential increase in the number of transitions,high time complexity,and susceptibility to noisy signals.To solve these problems,this paper proposes a new method for converting PLC signals into a transition sequence.The method is based on the principles of Boolean absorption law,which filters out noise information in the I/O signals.Then firing functions representing input–output causality are constructed from the filtered signals.Finally,the original signal sequence is traversed to generate a transition sequence.The experimental results show that these methods can rapidly identify a transition sequence.Compared to traditional methods,the proposed algorithms have polynomial time complexity.展开更多
As one of the oldest human civilizations,the Chinese nation once created brilliant ancient and classical culture.However,in transition to modernity,as China became a late comer of modernization,the Chinese nation has ...As one of the oldest human civilizations,the Chinese nation once created brilliant ancient and classical culture.However,in transition to modernity,as China became a late comer of modernization,the Chinese nation has chosen the Party as the leading force in constructing its modern culture.Guided by Marxism,the Communist Party of China(CPC)has advanced展开更多
International aid,always concerned as the Western aid,has been in decades' development after the Second World War.From the Post-colonial time to the era of globalisation,from Washington Consensus to the Post-Washi...International aid,always concerned as the Western aid,has been in decades' development after the Second World War.From the Post-colonial time to the era of globalisation,from Washington Consensus to the Post-Washington Consensus,there are various aid discourses,motives and the intervention logics.This paper explores the Western aid through a critical review to the history and the contemporary development of "aid".It argues,despite these changes,the fundamental logic of aid,the logic of "catching up",has not been changed.The related economic and political interventions,such as the aid conditionalities,are all working for this logic,and have caused a lot of criticisms.Aid has not been very successful within the changing agendas.While the foreign aid is moving from intervention to cooperation,to make a more effective "aid",the traditional donors may learn lessons from the South-South relations.展开更多
基金supported by the MOE Project of Humanities and Social Sciences of China(Grant No.21YJA72040001)。
文摘In connexive logic,two fundamental ideas are observed:first,no proposition im-plies or is implied by its own negation;second,if a proposition implies p then it will not imply the negation of 4p.In classical logic,neither of the ideas holds,which makes it difficult to give a natural semantics for connexive logic.By combining Kleene's three valued logic and Lewis'conditional logic,we propose a new natural semantics for connexive logic.We give four ax-iomatic systems characterizing different classes of selection models in the new semantics.We prove soundness and completeness of these logics and compare them with some comexive 1og-ics in the literature.
基金supported by the National Social Science Fund of China(No.20CZX048)。
文摘In modal logic,topological semantics is an intuitive and natural special case of neighbourhood semantics.This paper stems from the observation that the satisfaction relation of topological semantics applies to subset spaces which are more general than topological spaces.The minimal modal logic which is strongly sound and complete with respect to the class of subset spaces is found.Soundness and completeness results of some famous modal logics(e.g.S4,S5 and Tr)with respect to various important classes of subset spaces(eg intersection structures and complete fields of sets)are also proved.In the meantime,some known results,e.g.the soundness and completeness of Tr with respect to the class of discrete topological spaces,are proved directly using some modifications of the method of canonical mode1,without a detour via neighbourhood semantics or relational semantics.
文摘Institutional logic theory,a pivotal framework within organizational studies,delineates the multifaceted and intricate logics that underpin organizational fields.This theoretical perspective elucidates the manner in which diverse individuals or groups within an organization internalize and manifest distinct institutional logics,alongside the ensuing political and cultural conflicts.Furthermore,the theory endeavors to elucidate the complexities inherent in institutional logic across organizational fields,examining the reflection of these logics among various individuals or groups and their associated political and cultural dichotomies.Central to this discourse is the acknowledgment of the core systems that constitute the fabric of a country,encompassing the state,market,familial structures,corporate entities,professional bodies,and religious institutions.These components not only coexist with inherent conflicts but also exhibit a high degree of interdependence,underlined by their shared institutional logics.This literature attempts to review and analysis institutional logic in the field of entrepreneurship and integrates institutional logic into entrepreneurs’personal background,experience,and other social characteristics,and study how institutional logic operates.It is recommended that future researchers take entrepreneurs as the research object and conduct more in-depth research on the evolution of organizational response strategies when political and cultural conflicts occur between different groups within the enterprise,combined with institutional logic theory.
基金supported by China Postdoctoral Science Foundation(2024M750225).
文摘This article extends the foundational work of Wang and Wang on modal logic over lattices.Building upon their framework using polyadic modal logic with binary modalities<sup>and<inf>under standard Kripke semantics to axiomatize lattice structures,we focus on the modal characterization of bounded lattices and their extensions relevant to logical systems.By introducing nullary modalities 1(maximum element)and 0(minimum element),we first establish a modal axiomatic system for bounded lattices.Subsequently,we provide pure formula characterizations of complementation and orthocomplementation relations in lattices,along with corresponding completeness results.As key applications,we present modal characterizations of fundamental logical algebraic structures:Boolean algebras,orthomodular lattices,and Heyting algebras.The last section develops novel axiomatization results for atomic lattices and atomless lattices.Throughout this work,all axiomatic systems are shown to be strongly complete via pureformula extensions,demonstrating how hybrid modal languages with nullary operators can uniformly capture boundary elements,complementation properties,and latticetheoretic operations central to both classical and nonclassical logics.
基金Project supported by the National Natural Science Foundation of China(Grant No.12174159)。
文摘In recent years,acoustic logic gates has attracted growing interest in acoustics due to their promising applications in acoustic communication and signal processing.For practical implementation,these logic gates must operate over a certain bandwidth to ensure reliable performance.However,current experimental realizations have predominantly been confined to single-frequency or narrowband operation,leaving their broadband capabilities largely unverified.To address this gap,we present both numerical and experimental demonstrations of three basic acoustic logic gates(OR,NOT,and AND)using a phased unit cell composed of a central channel flanked by two arrays of semicircular cavities.By leveraging phase modulation of the unit cells and linear interference of sound,we achieve these logic operations with a uniform threshold of I_(t)=0.25.Remarkably,the measured fractional bandwidths(bandwidth relative to center frequency)reach approximately 111.5%(OR),37.2%(NOT),and 48.5%(AND),demonstrating ultra-broadband functionality.The proposed logic gates combine exceptional bandwidth with structural simplicity,offering significant potential for applications in acoustic computing,information processing,and integrated acoustic systems.
基金supported in part by the National Natural Science Foundation of China under Grants 62073124 and U1804150.
文摘This paper explores the algebraic essence of universal logic functions(ULFs)from an algebraic perspective.Under the framework of semi-tensor product of matrices,the“sequential nature”of ULFs is revealed.Utilizing the nature,a technique called universal transformation method is proposed,by which any ULF can be transformed into an equivalent expression with desired features that facilitate achieving specific objectives,such as modeling,analyzing and synthesizing universal logical systems.Furthermore,several useful logical operators are constructed in a mixed-dimensional situation,including power-raising operator,power-descending operator,erasure operator,and appending operator.Finally,these results are applied to model and analyze finite state machines and their networks,which demonstrate the practical value of the method and operators.
基金The National Natural Science Foundation of China(No.60373066,60425206,90412003),the National Basic Research Pro-gram of China (973Program)(No.2002CB312000),the Innovation Plan for Jiangsu High School Graduate Student, the High TechnologyResearch Project of Jiangsu Province (No.BG2005032), and the Weap-onry Equipment Foundation of PLA Equipment Ministry ( No.51406020105JB8103).
文摘To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressions （FCDLs） is presented. The syntax and semantics of FCDLs are formally defined, and the forms of axioms and assertions in FCDLs knowledge bases are specified. FCDLs combine both fuzzy concepts from the fuzzy description logics （FDLs） and cut concepts from the extended fuzzy description logics （EFDLs） in the same theory. Furthermore, cut concepts are extended into comparison cut concepts in FCDLs to represent comparison expressions between fuzzy membership degrees, which are often used in practice but not supported by the other fuzzy extensions of description logics. FCDLs have more expressive power than FDLs and EFDLs, and are able to represent expressive fuzzy knowledge and to perform reasoning tasks based on them. Therefore, FCDLs can enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.
文摘We demonstrate the flaws of Mao's method, which is an augmentation ofprotocol idealization in BAN-like logics, and then offer some new idealization rules based on Mao'smethod. Furthermore, we give some theoretical analysis of our rules using the strand spaceformalism, and show the soundness of our idealization rules under strand spaces Some examples onusing the new rules to analyze security protocols are also concerned. Our idealization method ismore effective than Mao's method towards many protocol instances, and is supported by a formalmodel.
基金National Natural Science Foundation ofChina(No.70 2 710 3 8)
文摘Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term definition set, instantiation assertion set and term restriction set. Based on the extended model, the issue on ontology checking was studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.
基金Supported by the National Natural Science Foun-dation of China (60403027)
文摘This paper proposes an algorithm applied in se mantic P2P network based on the description logics with the purpose for realizing the concepts distribution of resources, which makes the resources semantic locating easy. With the idea of the consistent hashing in the Chord, our algorithm stores the addresses and resources with the values of the same type to select instance. In addition, each peer has its own ontology, which will be completed by the knowledge distributed over the network during the exchange of CHGs （classification hierarchy graphs）. The hierarchy classification of concepts allows to find matching resource by querying to the upper level concept because the all concepts described in the CHG have the same root.
文摘Neurons with complex-valued weights have stronger capability because of their multi-valued threshold logic. Neurons with such features may be suitable for solution of different kinds of problems including associative memory,image recognition and digital logical mapping. In this paper,robustness or tolerance is introduced and newly defined for this kind of neuron ac-cording to both their mathematical model and the perceptron neuron's definition of robustness. Also,the most robust design for basic digital logics of multiple variables is proposed based on these robust neurons. Our proof procedure shows that,in robust design each weight only takes the value of i or -i,while the value of threshold is with respect to the number of variables. The results demonstrate the validity and simplicity of using robust neurons for realizing arbitrary digital logical functions.
文摘In the quantum mechanical Hilbert space formalism, the probabilistic interpretation is a later ad-hoc add-on, more or less enforced by the experimental evidence, but not motivated by the mathematical model itself. A model involving a clear probabilistic interpretation from the very beginning is provided by the quantum logics with unique conditional probabilities. It includes the projection lattices in von Neumann algebras and here probability conditionalization becomes identical with the state transition of the Lueders-von Neumann measurement process. This motivates the definition of a hierarchy of five compatibility and comeasurability levels in the abstract setting of the quantum logics with unique conditional probabilities. Their meanings are： the absence of quantum interference or influence, the existence of a joint distribution, simultaneous measurability, and the independence of the final state after two successive measurements from the sequential order of these two measurements. A further level means that two elements of the quantum logic （events） belong to the same Boolean subalgebra. In the general case, the five compatibility and comeasurability levels appear to differ, but they all coincide in the common Hilbert space formalism of quantum mechanics, in von Neumann algebras, and in some other cases.
文摘Nonmonotonic reasoning and nonmonotonic truth maintenance are two important research aspects of artificial intelligence, which have close relations. Existing nonmonotonic truth maintenance systems can be used as the theorem provers of conventional nonmonotonic logics, but they can't represent and deal with prioritized nonmonotonic reasoning. This paper presented stratified truth maintenance systems which can represent and deal with prioritized justifications. It will be shown that the stratified ATMS can be used as a theorem prover of prioritized nonmonotonic logics.
文摘Cells are open systems that exchange energy and molecules with their environment.As any material system,they perform all the complex activities required for homeostasis and reproduction,obeying the thermodynamic laws.This viewpoint will argue that the basic logic governing the energy flux required to preserve cell organization and function is simple:to decrease the activation energy(Ea)of specific processes.Almost none of the possible chemical reactions and energy transformations inside a cell occur at a measurable speed at room or body temperature.Enzymes or other macromolecular structures speed up particular transformations by decreasing the corresponding energetic barriers.However,to maintain the systems in a homeostatic state,capable of sophisticated functions based on this simple strategy requires an inconceivably complex solution.The conclusion will point to the challenging and intricate problems that cells have solved to carve the highly regulated channel through which the energy flows,fueling the work of these nanoscale machines.
文摘Logicians have worked with so many different logical systems that it is not possible even to esti-mate the number. Of these, many are best seen as extensions of classical logic, including both thoseof interest to mathematics and those of interest to philosophy and computer science. (Henceforth Iwill use the term "intelligent systems theory" for the common ground of philosophical logic and
文摘Description logics (DLs) are a family of logic-based knowledge representation formalisms with a number of computer science applications. DLs are especially well-known to be valuable for obtaining logical foundations of web ontology languages (e.g., W3C’s ontology language OWL). Paraconsistent (or inconsistency-tolerant) description logics (PDLs) have been studied to cope with inconsistencies which may frequently occur in an open world. In this paper, a comparison and survey of PDLs is presented. It is shown that four existing paraconsistent semantics (i.e., four-valued semantics, quasi-classical semantics, single-interpretation semantics and dual-interpretation semantics) for PDLs are essentially the same semantics. To show this, two generalized and extended new semantics are introduced, and an equivalence between them is proved.
基金supported by the Science and Technology Planning Project of Fujian Province,China,under Grant No.2024H0014(2024H01010100).
文摘In industrial control systems,such as power transmission facilities and water treatment plants,Programmable Logic Controllers(PLCs)can work consistently and stably over long periods if there are no faults.Black-box identification aims to automatically construct Petri net models with the help of I/O signals from PLC devices only.The main challenge is how to convert the infinitely long PLC signals into an event sequence,which is the foundation for subsequent modeling.The current algorithms are confronted with a number of challenges,including an exponential increase in the number of transitions,high time complexity,and susceptibility to noisy signals.To solve these problems,this paper proposes a new method for converting PLC signals into a transition sequence.The method is based on the principles of Boolean absorption law,which filters out noise information in the I/O signals.Then firing functions representing input–output causality are constructed from the filtered signals.Finally,the original signal sequence is traversed to generate a transition sequence.The experimental results show that these methods can rapidly identify a transition sequence.Compared to traditional methods,the proposed algorithms have polynomial time complexity.
文摘As one of the oldest human civilizations,the Chinese nation once created brilliant ancient and classical culture.However,in transition to modernity,as China became a late comer of modernization,the Chinese nation has chosen the Party as the leading force in constructing its modern culture.Guided by Marxism,the Communist Party of China(CPC)has advanced
文摘International aid,always concerned as the Western aid,has been in decades' development after the Second World War.From the Post-colonial time to the era of globalisation,from Washington Consensus to the Post-Washington Consensus,there are various aid discourses,motives and the intervention logics.This paper explores the Western aid through a critical review to the history and the contemporary development of "aid".It argues,despite these changes,the fundamental logic of aid,the logic of "catching up",has not been changed.The related economic and political interventions,such as the aid conditionalities,are all working for this logic,and have caused a lot of criticisms.Aid has not been very successful within the changing agendas.While the foreign aid is moving from intervention to cooperation,to make a more effective "aid",the traditional donors may learn lessons from the South-South relations.
