Answer Set programming (ASP) is a prominent rule-based language for knowledge representation and reasoning with roots in logic programming and non-monotonic reasoning. The aim to capture the essence of removing (ir)re...
详细信息
ISBN:
(纸本)1577358872
Answer Set programming (ASP) is a prominent rule-based language for knowledge representation and reasoning with roots in logic programming and non-monotonic reasoning. The aim to capture the essence of removing (ir)relevant details in ASP programs led to the investigation of different notions, from strong persistence (SP) forgetting, to faithful abstractions, and, recently, strong simplifications, where the latter two can be seen as relaxed and strengthened notions of forgetting, respectively. Although it was observed that these notions are related, especially given that they have characterizations through the semantics for strong equivalence, it remained unclear whether they can be brought together. In this work, we bridge this gap by introducing a novel relativized equivalence notion, which is a relaxation of the recent simplification notion, that is able to capture all related notions from the literature. We provide necessary and sufficient conditions for relativized simplifiability, which shows that the challenging part is for when the context programs do not contain all the atoms to remove. We then introduce an operator that combines projection and a relaxation of (SP)-forgetting to obtain the relativized simplifications. We furthermore present complexity results that complete the overall picture.
This paper presents the Relational Machine Calculus (RMC): a simple, foundational model of first-order relational programming. The RMC originates from the Functional Machine Calculus (FMC), which generalizes the lambd...
详细信息
ISBN:
(纸本)9798400706608
This paper presents the Relational Machine Calculus (RMC): a simple, foundational model of first-order relational programming. The RMC originates from the Functional Machine Calculus (FMC), which generalizes the lambda-calculus and its standard call-byname stack machine in two directions. One, "locations", introduces multiple stacks, which enable effect operators to be encoded into the abstraction and application constructs. The second, "sequencing", introduces the imperative notions of "skip" and "sequence", similar to kappa-calculus and concatenative programming languages. The key observation of the RMC is that the first-order fragment of the FMC exhibits a latent duality which, given a simple decomposition of the relevant constructors, can be concretely expressed as an involution on syntax. Semantically, this gives rise to a sound and complete calculus for string diagrams of Frobenius monoids. We consider unification as the corresponding symmetric generalization of beta-reduction. By further including standard operators of Kleene algebra, the RMC embeds a range of computational models: the kappa-calculus, logic programming, automata, Interaction Nets, and Petri Nets, among others. These embeddings preserve operational semantics, which for the RMC is again given by a generalization of the standard stack machine for the lambda-calculus. The equational theory of the RMC (which supports reasoning about its operational semantics) is conservative over both the first-order lambda-calculus and Kleene algebra, and can be oriented to give a confluent reduction relation.
BoNesis is a Python library which offers a declarative framework for the synthesis of Boolean networks from advanced dynamical properties, such as reachability, bifurcation, minimal trap spaces, stable states, and mut...
详细信息
ISBN:
(纸本)9783031716706;9783031716713
BoNesis is a Python library which offers a declarative framework for the synthesis of Boolean networks from advanced dynamical properties, such as reachability, bifurcation, minimal trap spaces, stable states, and mutations. It combines recent theoretical advances on Boolean networks with the Most Permissive update mode and efficient resolution of logic programs expressed in Answer-Set programming. Its main application domain is the inference of Boolean models from bulk and single-cell gene expression data of cell-fate, differentiation and reprogramming processes. BoNesis is distributed under the GPLv3-compatible free software license CeCILL and is available at https://***/bonesis.
Common approaches to behavioral artificial intelligence, like behavior trees, utility-based approaches, and machine learning are often lacking with regards to expressivity of the decision-making process. Behavior tree...
详细信息
ISBN:
(纸本)9798400706257
Common approaches to behavioral artificial intelligence, like behavior trees, utility-based approaches, and machine learning are often lacking with regards to expressivity of the decision-making process. Behavior trees are too rigid;utility-based approaches are focused on outcomes, not process;and machine learned agents seek only to maximize reward and minimize loss. A combination of AI approaches, however, may provide more nuanced, visible, and coherent processes that can be realized through the performance of character behaviors. In this extended abstract, we present Viv: a system that blends defeasible logic programming with dynamic behavior trees. To our knowledge, no extant works have bridged the gap between defeasible reasoning and action, particularly in regards to the performances of virtual nonplayer characters. We begin by explaining the design of our system, which was heavily influenced by the Stanislavski method of acting. We then describe the technical implementation of our system. Finally, we describe future directions of research that could provide benefit to, or benefit from, our system.
We report on yet another formalization of the Church-Rosser property in lambda-calculi, carried out with the proof environment B ELUGA . After the well-known proofs of confluence for beta-reduction in the untyped sett...
详细信息
We report on yet another formalization of the Church-Rosser property in lambda-calculi, carried out with the proof environment B ELUGA . After the well-known proofs of confluence for beta-reduction in the untyped settings, with and without Takahashi's complete developments method, we concentrate on eta-reduction and obtain the result for beta eta modularly. We further extend the analysis to typed-calculi, in particular System F. Finally, we investigate the idea of pursuing the encoding directly in B ELUGA 's meta-logic, as well as the use of B ELUGA 's logic programming engine to search for counterexamples.
Despite their language-integrated design, Java exceptions can be difficult to use effectively. Although Java exceptions are syntactically straightforward, negligent practices often result in code logic that is not onl...
详细信息
ISBN:
(纸本)9798400711183
Despite their language-integrated design, Java exceptions can be difficult to use effectively. Although Java exceptions are syntactically straightforward, negligent practices often result in code logic that is not only inelegant but also unsafe. This paper explores the challenge of auditing Java software to enhance the effectiveness and safety of its exception logic. We revisit common anti-patterns associated with Java exception usage and argue that, for auditing, their detection requires a more nuanced approach than mere identification. Specifically, we investigate whether reporting such anti-patterns can be prioritized for subsequent examination. We prototype our approach as HANDEL, in which anti-patterns and their priority, or weight, are expressed declar-atively using probabilistic logic programming. Evaluation with representative open-source code bases suggests HANDEL'S promise in detecting, reporting, and ranking the anti-patterns, thus helping streamline Java software auditing to ensure the safety and quality of exception-handling logic.
Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for its subprograms. This can be used to increase solving performance and to prove the correctness of programs. We...
详细信息
ISBN:
(纸本)9781577358800
Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for its subprograms. This can be used to increase solving performance and to prove the correctness of programs. We generalize the conditions under which this technique is applicable, by considering not only dependencies between predicates but also their arguments and context. This allows splitting programs commonly used in practice to which previous results were not applicable.
Thom Fruhwirth presented a short, elegant, and efficient Prolog program for the n queens problem. However, the program may be seen as rather tricky and one may not be convinced about its correctness. This paper explai...
详细信息
Thom Fruhwirth presented a short, elegant, and efficient Prolog program for the n queens problem. However, the program may be seen as rather tricky and one may not be convinced about its correctness. This paper explains the program in a declarative way and provides proofs of its correctness and completeness. The specification and the proofs are declarative, that is they abstract from any operational semantics. The specification is approximate, it is unnecessary to describe the program's semantics exactly. Despite the program works on non-ground terms, this work employs the standard semantics, based on logical consequence and Herbrand interpretations. Another purpose of the paper is to present an example of precise declarative reasoning about the semantics of a logic program.
As urban development stands on the brink of a new epoch, the imperative exploration of artificial intelligence, logic programming, and entropy demands visionary planning, ethical conduct, and a deep appreciation of th...
详细信息
ISBN:
(纸本)9783031809453;9783031809460
As urban development stands on the brink of a new epoch, the imperative exploration of artificial intelligence, logic programming, and entropy demands visionary planning, ethical conduct, and a deep appreciation of their far-reaching impact when synergized within smart city frameworks. This study delves into the complex relationship between artificial intelligence, logic programming, and entropy, highlighting their pivotal role in advancing smart cities towards operational excellence and evolutionary success. By harnessing artificial intelligence's understanding of human emotions and sentiments, urban centers are redefining city living. Employing cutting-edge technologies not only empowers healthcare innovation but also improves city planning, public safety, transit systems, and environmental management, significantly enhancing the quality of life for citizens. The key finding of this study underscores the importance of addressing challenges inherent in such integration, particularly in healthcare, leading to a high degree of citizens' wellbeing.
Insurance Portfolio Analysis (IPA) is the process of comparing multiple, potentially overlapping insurance portfolios with an eye to detecting and characterizing redundancies and gaps in coverage. Unfortunately, insur...
详细信息
ISBN:
(纸本)9781643684727;9781643684734
Insurance Portfolio Analysis (IPA) is the process of comparing multiple, potentially overlapping insurance portfolios with an eye to detecting and characterizing redundancies and gaps in coverage. Unfortunately, insurees usually do not have the time or patience to compare policies from multiple insurance providers, and they often do not have the legal background needed to understand the complex legal wording of the contracts associated with those policies. Past work has shown that, by encoding policies as logic programs, it is possible to automatically determine compliance of specific claims with a policy's terms and conditions. In this paper, we show that it is also possible to automatically analyze multiple-policy portfolios for gaps and redundancies by assessing coverage over multiple hypothetical claims. We formalize the process of IPA and show how to use well-studied techniques for logic program containment testing to automate the process.
暂无评论