Cognitive theories for reasoning are about understanding how humans come to conclusions from a set of premises. Starting from hypothetical thoughts, we are interested which are the implications behind basic everyday l...
详细信息
Over the last decades a number of guidelines have been proposed for best practices, frameworks, and cyber risk assessment in present computational environments. In order to improve cyber security vulnerability, in thi...
详细信息
ISBN:
(纸本)9783030456962;9783030456979
Over the last decades a number of guidelines have been proposed for best practices, frameworks, and cyber risk assessment in present computational environments. In order to improve cyber security vulnerability, in this work it is proposed and characterized a feasible methodology for problem solving that allows for the evaluation of cyber security in terms of an estimation of its entropic state, i.e., a predictive evaluation of its risk and vulnerabilities, or in other words, the cyber security level of such ecosystem. The analysis and development of such a model is based on a line of logical formalisms for Knowledge Representation and Reasoning, consistent with an Artificial Neural Networks approach to computing, a model that considers the cause behind the action.
Answer Set Planning refers to the use of Answer Set programming (ASP) to compute plans, i.e., solutions to planning problems, that transform a given state of the world to another state. The development of efficient an...
详细信息
In this article, we present a new version of the language of Epistemic Specifications. The goal is to simplify and improve the intuitive and formal semantics of the language. We describe an algorithm for computing sol...
详细信息
In this article, we present a new version of the language of Epistemic Specifications. The goal is to simplify and improve the intuitive and formal semantics of the language. We describe an algorithm for computing solutions of programs written in this new version of the language. The new semantics is illustrated by a number of examples, including an Epistemic Specifications-based framework for conformant planning. In addition, we introduce the notion of an epistemic logic program with sorts. This extends recent efforts to define a logic programming language that includes the means for explicitly specifying the domains of predicate parameters. An algorithm and its implementation as a solver for epistemic logic programs with sorts is also discussed.
The decision-making process in the Nuclear Power Plant (NPP) control room faces some challenges: operator incomplete knowledge, insufficient time for responding to the highly dynamic events, and a large number of indi...
详细信息
The decision-making process in the Nuclear Power Plant (NPP) control room faces some challenges: operator incomplete knowledge, insufficient time for responding to the highly dynamic events, and a large number of indicators to monitor. Because of the complexity of the NPP system, it is hard to pre-plan all the failures/mitigative actions. An intelligent operator support system is vital to mitigate these shortcomings. In this paper, an AI declarative approach (Answer Set programming (ASP)) is employed to represent our knowledge of the nuclear power plant in the form of logic rules. This represented knowledge is structured to form a reasoning-based operator support system. When an incident occurs, this ASP-based reasoning support system is demonstrated to be capable of fault identification (diagnosis), informing the operator of different scenarios and consequences, and generating the control options (decision making). (C) 2020 Elsevier Ltd. All rights reserved.
To date, logic-based technologies are either built on top or as extensions of the Prolog language, mostly working as monolithic solutions tailored upon specific inference procedures, unification mechanisms, or knowled...
详细信息
To date, logic-based technologies are either built on top or as extensions of the Prolog language, mostly working as monolithic solutions tailored upon specific inference procedures, unification mechanisms, or knowledge representation techniques. Instead, to maximise their impact, logic-based technologies should support and enable the general-purpose exploitation of all the manifold contributions from logic programming. Accordingly, we present 2P-Kt, a reboot of the tuProlog project offering a general, extensible, and interoperable ecosystem for logic programming and symbolic AI. (C) 2021 The Authors. Published by Elsevier B.V.
Tabling for contextual abduction in logic programming has been introduced as a means to store previously obtained abductive solutions in one context to be reused in another context. This paper identifies a number of i...
详细信息
Tabling for contextual abduction in logic programming has been introduced as a means to store previously obtained abductive solutions in one context to be reused in another context. This paper identifies a number of issues in the existing implementations of tabling in contextual abduction and aims to mitigate the issues. We propose a new program transformation for integrity constraints to deal with their proper application for filtering solutions while also reducing the table memory usage. We further optimize the table memory usage by selectively picking predicates to table and by pragmatically simplifying the representation of the problem. The evaluation of our proposed approach, on both artificial and real world problems, shows that they improve the scalability of tabled abduction compared to previous implementations.
With the increasing popularity and diversity of Blockchain systems, smart contracts were introduced as a necessity to automatically execute certain operation depending on the occurred events. The programming languages...
详细信息
ISBN:
(纸本)9783030456870;9783030456887
With the increasing popularity and diversity of Blockchain systems, smart contracts were introduced as a necessity to automatically execute certain operation depending on the occurred events. The programming languages used in defining the triggering events and their consequent actions depends on the Blockchain implementation. In this article, we will investigate the advantages and suitable scenarios for using a formal approach in defining smart contracts. We will use a particular python implementation of a Blockchain and add the interface with a Prolog component for defining and querying smart contracts.
Answer set programming (ASP) has become an increasingly popular approach for declarative problem solving. In order to address the needs of applications, ASP has been extended in different approaches with means for int...
详细信息
Answer set programming (ASP) has become an increasingly popular approach for declarative problem solving. In order to address the needs of applications, ASP has been extended in different approaches with means for interfacing the outside world, of which hex programs are one of the most powerful such extension that provides API-style interfaces to access arbitrary external sources of information and computation, respectively. Adhering to the principle of founded derivation, computing answer sets of hex programs requires an external (e-) minimality check for answer set candidates in order to prevent cyclic justifications via external sources. Due to the generic nature of external sources, the check can be a bottleneck in practice. To mitigate this, various optimizations have been developed previously, including the use of syntactic information about atom dependencies in order to detect cases when an e-minimality check can be avoided. However, the approach largely over-approximates the real dependencies due to the black-box nature of external sources. We thus consider in this work the use of semantic information for achieving better approximations. To this end, we introduce input-output (io-) dependencies for external sources, which intuitively link the occurrence of values in the result of a call to an external source to the occurrence of values in the input provided to this call. It appears that disposing of information about io-dependencies significantly increases the potential for pruning e-minimality checks, and an empirical evaluation exhibits a clear benefit of this approach. Moreover, we study semantic and computational properties of io-dependencies and provide algorithms for constructing and optimizing sets of io-dependencies. Our work aims at laying some foundations for the use of semantic dependency information in external source access from ASP. The results are not limited to hex programs, but may analogously be deployed to other approaches that integrate e
We propose answer-set programs that specify and compute counterfactual interventions as a basis for causality-based explanations to decisions produced by classification models. They can be applied with black-box model...
详细信息
ISBN:
(纸本)9783030579777;9783030579760
We propose answer-set programs that specify and compute counterfactual interventions as a basis for causality-based explanations to decisions produced by classification models. They can be applied with black-box models and models that can be specified as logic programs, such as rule-based classifiers. The main focus is on the specification and computation of maximum responsibility causal explanations. The use of additional semantic knowledge is investigated.
暂无评论