In this paper, we present an informal introduction to logical English (LE) and illustrate its use to standardise the legal wording of the Automatic Early Termination (AET) clauses of International Swaps and Derivative...
详细信息
In this paper, we present an informal introduction to logical English (LE) and illustrate its use to standardise the legal wording of the Automatic Early Termination (AET) clauses of International Swaps and Derivatives Association (ISDA) Agreements. LE can be viewed both as an alternative to conventional legal English for expressing legal documents, and as an alternative to conventional computer languages for automating legal documents. LE is a controlled natural language (CNL), which is designed both to be computer-executable and to be readable by English speakers without special training. The basic form of LE is syntactic sugar for logic programs, in which all sentences have the same standard form, either as rules of the form conclusion if conditions or as unconditional sentences of the form conclusion. However, LE extends normal logic programming by introducing features that are present in other computer languages and other logics. These features include typed variables signalled by common nouns, and existentially quantified variables in the conclusions of sentences signalled by indefinite articles. Although LE translates naturally into a logic programming language such as Prolog or ASP, it can also serve as a neutral standard, which can be compiled into other lower-level computer languages.
Tsetlin machines (TMs) are a pattern recognition approach that uses finite state machines for learning and propositional logic to represent patterns. In addition to being natively interpretable, they have provided com...
详细信息
Tsetlin machines (TMs) are a pattern recognition approach that uses finite state machines for learning and propositional logic to represent patterns. In addition to being natively interpretable, they have provided competitive accuracy for various tasks. In this paper, we increase the computing power of TMs by proposing a first-order logic-based framework with Herbrand semantics. The resulting TM is relational and can take advantage of logical structures appearing in natural language, to learn rules that represent how actions and consequences are related in the real world. The outcome is a logic program of Horn clauses, bringing in a structured view of unstructured data. In closed-domain question-answering, the first-order representation produces 10 x more compact KBs, along with an increase in answering accuracy from 94.83% to 99.48%. The approach is further robust towards erroneous, missing, and superfluous information, distilling the aspects of a text that are important for real-world understanding
Reasoning in Abstract Argumentation is the activity of understanding subsets of arguments that resolve conflicts or can be used as a justification for a thesis. Several semantics have been proposed so far to identify ...
详细信息
System analyses deal with interrelationships between different variables that keep the system in balance. In many analysis of complex thinking, a system is viewed as a complex unit in which the 'whole' is not ...
详细信息
System analyses deal with interrelationships between different variables that keep the system in balance. In many analysis of complex thinking, a system is viewed as a complex unit in which the 'whole' is not reduced to the 'sum' of its parts;the system becomes an ambiguous item because it consists of several entities that interact with unforeseen results or, in other words, it is situated at a transdisciplinary level, it is impossible for an area to have a complete reading of its complexity. It was also mentioned that the concept of the open system best describes complexity by stating that 'the laws of the organization are not equilibrium, but an imbalance that is restored or compensated for by stabilized dynamics'. This idea originated from the field of thermodynamics and the second law, in which the imbalance that it maintains allows the system for an apparent balance. This fragile steady state has something of a paradox, since the structures remain the same, but their constituents are changeable. The concept of open system undoes the door to a theory of evolution that can only derive from the interactions between a system and its ecosystem. Within this systemic approach, the focus of the analysis takes into account the ambiguity, multidisciplinary and complexity associated with system adjustment, i.e. it is intended to qualify an employee job based on their experience and knowledge as a measure of their impact on the organization performance.
Graph theory has been a useful tool for logic programming in many aspects. In this paper, we propose an equivalent representation of multi-adjoint logic programs using hypergraphs, which are a generalization of classi...
详细信息
Graph theory has been a useful tool for logic programming in many aspects. In this paper, we propose an equivalent representation of multi-adjoint logic programs using hypergraphs, which are a generalization of classical graphs that allows the use of hypergraph theory in logic programming. Specifically, this representation has been considered in this paper to increase the level and flexibility of different termination results of the computation of the least model of fuzzy logic programs via the immediate consequence operator. Consequently, the least model of more general and versatile fuzzy logic programs can be obtained after finitely many iterations, although infinite programs or programs with loops and general aggregators will be considered. (c) 2022 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).
We study the computation of constrained explanations in the framework of abductive logic programming. A general characteristic of abductive reasoning is the existence of multiple abductive explanations. Therefore, ide...
详细信息
We study the computation of constrained explanations in the framework of abductive logic programming. A general characteristic of abductive reasoning is the existence of multiple abductive explanations. Therefore, identifying a subclass of "preferred explanations " is a relevant problem. A typical approach is to "prefer " explanations that are, in some sense, simple. Several concepts of simplicity were considered in the literature, most notably those based on minimality with respect to inclusion and cardinality. We adopt, as a measure of the quality of an explanation, its degree of arbitrariness that can be briefly described as the number of arbitrary assumptions that have been made to derive the explanation. The more arbitrary the explanation, the less appealing it is, with explanations having no arbitrariness, called constrained, being the preferred ones. In this article, we present a technique that, for a special class of theories, computes constrained explanations. It is based on a rewriting of the theory and the observation into a disjunctive logic program with negation so that the constrained explanations correspond to a subset of its stable models. The proposed technique lays the foundation for using ASP solvers to compute constrained explanations.
One of the key challenges in computer networks is network security. For securing the network, various solutions have been proposed, including network security protocols and firewalls. In the case of so-called packet-f...
详细信息
One of the key challenges in computer networks is network security. For securing the network, various solutions have been proposed, including network security protocols and firewalls. In the case of so-called packet-filtering firewalls, policy rules are implemented to monitor changes to the network and preserve the required security level. Due to the dramatic increase of devices, however, and herewith the rapid increase of the size of the policy rules, firewall policy anomalies occur more frequently. This requires careful implementation of the policy rules to ensure cost-efficient solutions for anomaly detection to support network security. In this study, we present an anomaly detection framework for detecting intrafirewall policy anomaly rules. The framework supports the simulation of packets through the firewall ruleset for validating and enhancing the security level of the network. The framework is validated using four different types of firewall policy anomalies. Experimental results demonstrate that the framework is effective and efficient in detecting firewall policy anomalies.
In order to meet the diverse needs of smart substation users for relay protection devices, and to realize the personalized customization function of protection logic by engineering users, a user secondary development ...
详细信息
Don’t Starve is a survival video game where the objective is for the player to survive as long as possible without dying. The game is challenging to play due to new situations being randomly generated making survival...
详细信息
Strong Persistence pSPq, since its perception ten years ago, has been at the center of attention in the realm of forgetting in logic programming. So-called forgetting instances, for which it is possible to obtain pSPq...
详细信息
暂无评论