Answer Set Planning refers to the use of Answer Set programming (ASP) to compute plans, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient...
详细信息
Answer Set Planning refers to the use of Answer Set programming (ASP) to compute plans, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.
Modal logic S5 has attracted significant attention and has led to several practical applications, owing to its simplified approach to dealing with nesting modal operators. Efficient implementations for evaluating sati...
详细信息
In this work, we provide an extensive analysis of Hohfeld's theory of normative relations, focusing in particular on diagrammatic structures. Our contribution is threefold. First, we specify an extensional formal ...
详细信息
In this work, we provide an extensive analysis of Hohfeld's theory of normative relations, focusing in particular on diagrammatic structures. Our contribution is threefold. First, we specify an extensional formal language to represent the main notions in the two families of normative relations identified by Hohfeld (i.e. the deontic and the potestative family). Our primary focus is on the part of the theory concerning potestative relations. In this regard, we assign a key role to the concept of ability, which is treated as a primitive notion and used to formulate three fine-grained definitions of power (outcome-centered, change-centered and force-centered). Second, on the basis of these definitions we build Aristotelian diagrams of opposition for deontic and potestative relations, improving, extending and systematizing previous proposals formulated in the literature. Third, we present a model-theoretic interpretation and a logic programming (ASP) implementation of the proposed framework, elaborating on the procedural dimension of normative reasoning.
Almost 10 years ago, I wrote about the "Future of the PLC" for this publication. Even back then, it was important to mention that programmable logic controller (PLC) technology was mature at nearly 50 years ...
详细信息
Almost 10 years ago, I wrote about the "Future of the PLC" for this publication. Even back then, it was important to mention that programmable logic controller (PLC) technology was mature at nearly 50 years old. A decade later, a fair question is whether today’s PLCs have fully entered senior citizen status, and if future iterations are destined for the grave.
The relevance of polynomial classes of formulas to deductive efficiency motivated their further research, and currently, a great number of such classes is known. Nevertheless, they have been exclusively sought in the ...
详细信息
The relevance of polynomial classes of formulas to deductive efficiency motivated their further research, and currently, a great number of such classes is known. Nevertheless, they have been exclusively sought in the setting of propositional logic and clausal form, which is of course expressively limiting for real-world *** these lines and towards making tractability applicable beyond propositional clausal logic, firstly, we define the Regular many-valued Horn Non-Clausal (NC) class, or RH, obtained by suitably amalgamating both regular classes: Horn and NC. Then we show that recognizing whether any NC formula is Horn-NC takes only linear ***, we demonstrate that the relationship between RH and: (1) its subclass of regular Horn formulas is that syntactically RH subsumes the Horn class but semantically both classes are equivalent;and (2) its superclass of regular non-clausal formulas is that RH contains all non-clausal formulas whose clausal form is ***, we define Regular Non-Clausal Unit-Resolution, or RURNC, and prove that RURNC is complete for RH and also checks its satisfiability in polynomial time. Altogether, RH is a class recognized and solved polynomially, which shows that our intended goal is reached since RH is many-valued, non-clausal and tractable. Fourthly, based on RH, we characterize extensive classes of Horn-NC-like formulas, super-classes of RH, which are composed of formulas that are logically equivalent to some formula in RH. We furnish syntactical patterns of such Horn-NC-like formulas, being outside RH and whose satisfiability test is also decidable in polynomial *** RH and RURNC are, both, basic in the DPLL scheme, the most efficient in propositional logic, and can be extended to some other non-classical logics, we argue that they pave the way for efficient non-clausal DPLL-based approximate ***: Tractable Approximate Automated Reasoning.(c) 2022 Elsevier B.V. All rights reserved.
Intensional sets are sets given by a property rather than by enumerating their elements. In a previous work, we have proposed a decision procedure for a first-order logic language which provides restricted intensional...
详细信息
Intensional sets are sets given by a property rather than by enumerating their elements. In a previous work, we have proposed a decision procedure for a first-order logic language which provides restricted intensional sets (RISs), i.e. a sub-class of intensional sets that are guaranteed to denote finite-though unbounded-sets. In this paper, we show how RIS can be exploited as a convenient programming tool also in a conventional setting, namely the imperative O-O language Java. We do this by considering a Java library, called JSetL, that integrates the notions of logical variable, (set) unification and constraints that are typical of constraint logic programming languages into the Java language. We show how JSetL is naturally extended to accommodate for RIS and RIS constraints and how this extension can be exploited;on the one hand, to support a more declarative style of programming and, on the other hand, to effectively enhance the expressive power of the constraint language provided by the library.
Affective competence encompasses the capacity to identify, comprehend, and manage one's own emotions as well as discern and appropriately respond to the emotions of others. This concept, first introduced by psycho...
详细信息
ISBN:
(纸本)9789819750344;9789819750351
Affective competence encompasses the capacity to identify, comprehend, and manage one's own emotions as well as discern and appropriately respond to the emotions of others. This concept, first introduced by psychotherapist Silvan Tomkins in the 1960s, plays a pivotal role in empathy, i.e., the ability to grasp someone else's perspective. Training programs aimed at bolstering affective competence focus on teaching individuals to recognize their emotions and those of others, and the impact these emotions have on behavior. In the realm of healthcare, affective competence is intricately linked to the delivery of care. The recognition and understanding of both self and others' emotions, coupled with the ability to apply this insight to guide actions, are fundamental to providing high-caliber care. Affective competence is a crucial aspect of patient care as it contributes to reducing patient anxiety, fostering comfort during treatment, and aiding in their understanding of their medical journey and recovery path. Achieving this level of competence is a vital objective for healthcare providers in their mission to offer exemplary care.
Weather forecasting is important for saving lives, protecting property, and supporting economic activities. It provides timely warnings for severe weather, improves agricultural planning, and aids in disaster manageme...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Weather forecasting is important for saving lives, protecting property, and supporting economic activities. It provides timely warnings for severe weather, improves agricultural planning, and aids in disaster management. Neural networks and deep learning methods can achieve impressive accuracy in weather prediction, but their black-box nature lacks in explainability. To address this limitation, we investigated the potential of FastLAS, an Inductive logic programming (ILP) framework, to produce reliable and, more important, explainable weather predictions. FastLAS learns ASP programs whose syntax and structural semantics resemble natural human language, making them easily understandable and interpretable by humans. The supportedness of stable models allows a clear explanation of the predictions. Our empirical evaluation on data from an Italian weather forecasting center shows that our approach is capable of learning predictive models from small dataset (a few samples instead of the thousands needed by neural networks) achieving an accuracy higher than statistical machine learning base lines.
Virtual reconstruction should move beyond merely presenting 3D models by documenting the scientific context and reasoning underlying the reconstruction process. For instance, the collapsed arch in the nave of Notre-Da...
详细信息
ISBN:
(纸本)9783031789540;9783031789557
Virtual reconstruction should move beyond merely presenting 3D models by documenting the scientific context and reasoning underlying the reconstruction process. For instance, the collapsed arch in the nave of Notre-Dame de Paris serves as a case study to make explicit the reconstruction argumentation encapsulated in relation to the spatial configuration of the arch and the voussoirs. The experiment is twofold: (1) setting up of the 3D dataset where the hypotheses are modeled as versions using logic programming, and (2) evaluating the scientific narrative of reconstruction through both a custom 2D-3D visualization and competency questions on the enriched 3D data. Formalization, reasoning, and visualization are combined to explore the nonlinear scientific hypotheses and narrative of the reconstruction. The results explicitly show both the factual information on the physical and digital objects, as well as the counterfactual propositions allowing the reasoning at play in the reconstruction. The hypotheses are visualized as counterfactual trajectories creating an open dynamic visualization that makes possible the spatialized querying of conflicting interpretations and embedded memory in place.
Functions containing arithmetic operations have often restrictions not expressible by standard type systems of programming languages. The division operation requires that the divisor is non-zero and the factorial func...
详细信息
ISBN:
(纸本)9789819789429;9789819789436
Functions containing arithmetic operations have often restrictions not expressible by standard type systems of programming languages. The division operation requires that the divisor is non-zero and the factorial function should not be applied to negative numbers. Such partial operations might lead to program crashes if they are applied to unintended arguments. Checking the arguments before each call is tedious and decreases the run-time efficiency. To avoid these disadvantages and support the safe use of partially defined operations, we present an approach to verify the correct use of operations at compile time. To simplify its use, our approach automatically infers non-fail conditions of operations from their definitions and checks whether these conditions are satisfied for all uses of the operations. Arithmetic conditions can be verified by SMT solvers, whereas conditions in operations defined on algebraic data types can be inferred and verified by appropriate type abstractions. Therefore, we present a hybrid method which is applicable to larger programs since only a few arithmetic non-fail conditions need to be checked by an external SMT solver. This approach is implemented for functional logic Curry programs so that it is also usable for purely functional or logic programs.
暂无评论