Extensions of Answer Set programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELƒ), provide an expressive computational framework for modeling dynamic appl...
详细信息
Extensions of Answer Set programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELƒ), provide an expressive computational framework for modeling dynamic applications. In this paper, we study the so-called past-present syntactic subclass, which consists of a set of logic programming rules whose body references to the past and head to the present. Such restriction ensures that the past remains independent of the future, which is the case in most dynamic domains. We extend the definitions of completion and loop formulas to the case of past-present formulas, which allows capturing the temporal stable models of a set of past-present temporal programs by means of an LTLƒexpression. 2023 Copyright for this paper by its authors.
作者：
Lima, RuiFdez-Riverola, FlorentinoCapita, AntonioBorges, IsabelVicente, HenriqueNeves, JoseCESPU
Inst Politecn Saude Norte Famalicao Portugal Univ Vigo
ESEI Escuela Super Ingn Informat Dept Informat Campus Univ As Lagoas Orense Spain SERGAS UVIGO
SING Res Grp Galicia Sur Hlth Res Inst IIS Galicia Sur Pontevedra Spain Univ Inst Hlth Sci IUCS
CESPU Dept Sci IINFACTS Inst Res & Adv Training Hlth Sci & Techn P-4585116 Gandra Crl Portugal CEGOT
Ctr Invest Desenvolvimento & Inovacao Inst Estudos Super Fafe CIDI IESF Porto Portugal REMIT
Porto Portugal Univ Evora
REQUIMTE LAQV Dept Quim & Bioquim Escola Ciencias & Tecnol Evora Portugal Univ Minho
Ctr Algoritmi Braga Portugal
Job satisfaction is an important factor in hospitality industry, figuratively, its chimera. A concept has not a single cause;rather, it is the product of elements such as conditions and relationships that determine th...
详细信息
ISBN:
(纸本)9789811697012;9789811697005
Job satisfaction is an important factor in hospitality industry, figuratively, its chimera. A concept has not a single cause;rather, it is the product of elements such as conditions and relationships that determine the workplace, the organizational system of employment, and social, cultural, and economic uncertainties. For example, and as its antonym, Maslach defined burnout "as a psychological syndrome involving emotional exhaustion, depersonalization, and a diminished sense of personal accomplishment that occurred among various professionals who work with other people in challenging situations". This multidimensional approach describes the plight of a three-dimensional concept that is derived empirically, has a similarity with stress, adds an important social dimension to emotional issues such as exhaustion, depersonalization, and challenging situations, i.e., there is the perception that the entropic state that each kitchen staff team member conveys is relevant for an appropriate personnel management of the kitchen staff team, and mirrors the social dimension that is object of study in this work.
The rapid growth of the Web and the information overload problem demand the development of practical information extraction (IE) solutions for web content processing. Ontology Population (OP) concerns both the extract...
详细信息
The rapid growth of the Web and the information overload problem demand the development of practical information extraction (IE) solutions for web content processing. Ontology Population (OP) concerns both the extraction and classification of instances of the concepts and relations defined by an ontology. Developing IE rules for OP is an intensive and time-consuming process. Thus, an automated mechanism, based on machine-learning techniques, able to convert textual data from web pages into ontology instances may be a crucial path. This paper presents an inductive logic programming-based method that automatic induces symbolic extraction rules, which are used for populating a domain ontology with instances of entity classes. This method uses domain-independent linguistic patterns for retrieving candidate instances from web pages, and a WordNet semantic similarity measure as background knowledge to be used as input by a generic inductive logic programming system. Experiments were conducted concerning both the instance classification problem and a comparison with other popular machine learning algorithms, with encouraging results.
This study aimed to investigate the learning concepts of logic programming for high-school students introducing the arduino tool as a pedagogical strategy. therefore, the methodology applied initially consisted in pre...
详细信息
This study aimed to investigate the learning concepts of logic programming for high-school students introducing the arduino tool as a pedagogical strategy. therefore, the methodology applied initially consisted in presencial classes, as well as the subsequent interaction with the tool and assessment activities. initial results indicate that this strategy was adequate for materialization of abstract concepts that are taught in logic programming, but it also allows one to identify formalization difficulties of mathematical concepts for solving activities that were proposed.
Building reliable software is challenging because today's software supply chains are built and secured from tools and individuals from a broad range of organizations with complex trust relationships. In this setti...
详细信息
ISBN:
(纸本)9781450398855
Building reliable software is challenging because today's software supply chains are built and secured from tools and individuals from a broad range of organizations with complex trust relationships. In this setting, tracking the origin of each piece of software and understanding the security and privacy implications of using it is essential. In this work we aim to secure software supply chains by using verifiable policies in which the origin of information and the trust assumptions are first-order concerns and abusive evidence is discoverable. To do so, we propose Policy Transparency, a new paradigm in which policies are based on authorization logic and all claims issued in this policy language are made transparent by inclusion in a transparency log. Achieving this goal in a real-world setting is non-trivial and to do so we propose a novel software architecture called PolyLog. We find that this combination of authorization logic and transparency logs is mutually beneficial - transparency logs allow authorization logic claims to be widely available aiding in discovery of abuse, and making claims interpretable with policies allows misbehavior captured in the transparency logs to be handled proactively.
We describe how answer-set programs can be used to declaratively specify counterfactual interventions on entities under classification, and reason about them. In particular, they can be used to define and compute resp...
详细信息
ISBN:
(数字)9783030974541
ISBN:
(纸本)9783030974541;9783030974534
We describe how answer-set programs can be used to declaratively specify counterfactual interventions on entities under classification, and reason about them. In particular, they can be used to define and compute responsibility scores as attribution-based explanations for outcomes from classification models. The approach allows for the inclusion of domain knowledge and supports query answering. A detailed example with a naive-Bayes classifier is presented.
The topic of forgetting has been extensively studied in the field of knowledge representation and reasoning for many major formalisms. Quite recently it has been introduced to abstract argumentation. However, many alr...
详细信息
ISBN:
(纸本)9781956792003
The topic of forgetting has been extensively studied in the field of knowledge representation and reasoning for many major formalisms. Quite recently it has been introduced to abstract argumentation. However, many already known as well as essential aspects about forgetting like strong persistence or strong invariance have been left unconsidered. We show that forgetting in abstract argumentation cannot be reduced to forgetting in logic programming. In addition, we deal with the more general problem of forgetting whole sets of arguments and show that iterative application of existing operators for single arguments does not necessarily yield a desirable result as it may not produce an informationally economic argumentation framework. As a consequence we provide a systematic and exhaustive study of forgetting desiderata and associated operations adapted to the intrinsics of abstract argumentation. We show the limits and shed light on the possibilities.
Researchers have used Distributed Constraint Optimization Problems (DCOPs) to model various multi-agent coordination and resource allocation problems. However, existing DCOP algorithms have focused almost exclusively ...
详细信息
ISBN:
(纸本)9781634391313
Researchers have used Distributed Constraint Optimization Problems (DCOPs) to model various multi-agent coordination and resource allocation problems. However, existing DCOP algorithms have focused almost exclusively on imperative programming techniques. This paper explores a new direction, which is to develop algorithms that use declarative programming, specifically logic programming, techniques.
In this paper, we present a system, called xASP, for generating explanations that explain why an atom belongs to (or does not belong to) an answer set of a given program. The system can generate all possible explanati...
详细信息
ISBN:
(纸本)9783031157073;9783031157066
In this paper, we present a system, called xASP, for generating explanations that explain why an atom belongs to (or does not belong to) an answer set of a given program. The system can generate all possible explanations for a query without the need to simplify the program before computing explanations, i.e., it works with non-ground programs. These properties distinguish xASP from existing systems such as xClingo, DiscASP, exp(ASP(c)), and s(CASP), which also generate explanations for queries to logic programs under the answer set semantics but simplify and ground the programs (the three systems xClingo, DiscASP, exp(ASP(c))) or do not always generate all possible explanations (the system s(CASP)). In addition, the output of xASP is insensitive to syntactic variations such as the order conditions and the order of rules, which is also different from the output of s(CASP).
Writing correct models for combinatorial problems is relatively straightforward;however, they must be efficient to be usable with instances producing many solution candidates. In this work, we aim to automatically gen...
详细信息
ISBN:
(纸本)9781956792003
Writing correct models for combinatorial problems is relatively straightforward;however, they must be efficient to be usable with instances producing many solution candidates. In this work, we aim to automatically generalise the discarding of symmetric solutions of Answer Set programming instances, improving the efficiency of the programs with first-order constraints derived from propositional symmetry-breaking constraints(1).
暂无评论