With the rise of machine learning, and more recently the overwhelming interest in deep learning, knowledge representation and reasoning (KRR) approaches struggle to maintain their position within the wider Artificial ...
详细信息
With the rise of machine learning, and more recently the overwhelming interest in deep learning, knowledge representation and reasoning (KRR) approaches struggle to maintain their position within the wider Artificial Intelligence (AI) community. Often considered as part of the good old-fashioned AI (Haugeland 1985) – like a memory of glorious old days that have come to an end – many consider KRR as no longer applicable (on its own) to the problems faced by AI today (Blackwell 2015; Garnelo et al. 2016). What they see are logical languages with symbols incomprehensible by most, inference mechanisms that even experts have difficulties tracing and debugging, and the incapability to process unstructured data like text.
The field of DNA computing is devoted to the creation of devices capable of processing information signals encoded on biological substrates. These signals are intended to propagate in cascades of biochemical reactions...
详细信息
The field of DNA computing is devoted to the creation of devices capable of processing information signals encoded on biological substrates. These signals are intended to propagate in cascades of biochemical reactions in which they naturally undergo a progressive reduction. Preventing signal reduction becomes crucial considering applications in biological environments where molecular cues are scarce. Although catalytic gates have been developed using the toehold-exchange mechanism for logic gate circuits, the matter remains unaddressed for logic reasoning devices. Inspired by the main work in biomolecular logic programming, we present a new encoding scheme for facts, rules, and queries to implement backward/forward chaining inference paths via catalytic DNA strand displacement cascades. In this context, we take advantage of fueling reactions to recover inputs, which preserve their availability to react with different implication gates. Our molecular design is thermodynamically analyzed by providing suitable sequences for the correct formation of structures. With regard to the kinetic performance, data from simulations suggest that the model operates efficiently even with identified crosstalk reactions.
The aim of this paper is to show that logic programming is a powerful tool for representing scientific theories and for scientific inference. In a logic program it is possible to encode the qualitative and quantitativ...
详细信息
The aim of this paper is to show that logic programming is a powerful tool for representing scientific theories and for scientific inference. In a logic program it is possible to encode the qualitative and quantitative components of a theory in first order predicate logic, which is a highly expressive formal language. A theory program can then be handed to an algorithm that reasons about the theory. We discuss the advantages of logic programming with regard to building formal theories and present a novel software package for scientific inference: Theory Toolbox. Theory Toolbox can derive any conclusions that are entailed by a theory, explain why a certain conclusion follows from a theory, and evaluate a theory with regard to its internal coherence and generalizability. Because logic is, or should be, a cornerstone of scientific practice, we believe that our paper can make an important contribution to scientific psychology.
Computational nucleic acid devices show great potential for enabling a broad range of biotechnology applications, including smart probes for molecular biology research, in vitro assembly of complex compounds, high-pre...
详细信息
Computational nucleic acid devices show great potential for enabling a broad range of biotechnology applications, including smart probes for molecular biology research, in vitro assembly of complex compounds, high-precision in vitro disease diagnosis and, ultimately, computational theranostics inside living cells. This diversity of applications is supported by a range of implementation strategies, including nucleic acid strand displacement, localization to substrates, and the use of enzymes with polymerase, nickase, and exonuclease functionality. However, existing computational design tools are unable to account for these strategies in a unified manner. This paper presents a logic programming language that allows a broad range of computational nucleic acid systems to be designed and analyzed. The language extends standard logic programming with a novel equational theory to express nucleic acid molecular motifs. It automatically identifies matching motifs present in the full system, in order to apply a specified transformation expressed as a logical rule. The language supports the definition of logic predicates, which provide constraints that need to be satisfied in order for a given rule to be applied. The language is sufficiently expressive to encode the semantics of nucleic strand displacement systems with complex topologies, together with computation performed by a broad range of enzymes, and is readily extensible to new implementation strategies. Our approach lays the foundation for a unifying framework for the design of computational nucleic acid devices.
This proceedings contains abstracts and position papers for the work to bepresented at the fourth logic and Practice of programming (LPOP) Workshop. Theworkshop is to be held in Dallas, Texas, USA, and as a hybrid eve...
详细信息
This proceedings contains abstracts and position papers for the workpresented at the third logic and Practice of programming (LPOP) Workshop. Theworkshop was held online, using zoom, at ***, on December 13,2022. The w...
详细信息
A propositional logic program P may be identified with a P-f P-f-coalgebra on the set of atomic propositions in the program. The corresponding C(P-f P-f)-coalgebra, where C(PfPf) is the cofree comonad on Pf Pf, descri...
详细信息
A propositional logic program P may be identified with a P-f P-f-coalgebra on the set of atomic propositions in the program. The corresponding C(P-f P-f)-coalgebra, where C(PfPf) is the cofree comonad on Pf Pf, describes derivations by resolution. That correspondence has been developed to model first-order programs in two ways, with lax semantics and saturated semantics, based on locally ordered categories and right Kan extensions respectively. We unify the two approaches, exhibiting them as complementary rather than competing, reflecting the theorem-proving and proof-search aspects of logic programming. While maintaining that unity, we further refine lax semantics to give finitary models of logic programs with existential variables, and to develop a precise semantic relationship between variables in logic programming and worlds in local state. Crown Copyright (C) 2018 Published by Elsevier Inc. All rights reserved.
New generations of distributed systems are opening novel perspectives for logic programming (LP): On the one hand, service-oriented architectures represent nowadays the standard approach for distributed systems engine...
详细信息
New generations of distributed systems are opening novel perspectives for logic programming (LP): On the one hand, service-oriented architectures represent nowadays the standard approach for distributed systems engineering;on the other hand, pervasive systems mandate for situated intelligence. In this paper, we introduce the notion of logic programming as a Service (LPaaS) as a means to address the needs of pervasive intelligent systems through logic engines exploited as a distributed service. First, we define the abstract architectural model by re-interpreting classical LP notions in the new context;then we elaborate on the nature of LP interpreted as a service by describing the basic LPaaS interface. Finally, we show how LPaaS works in practice by discussing its implementation in terms of distributed tuProlog engines, accounting for basic issues such as interoperability and configurability.
Autonomous intelligent agents are playing increasingly important roles in our lives. They contain information about us and start to perform tasks on our behalves. Chatbots are an example of such agents that need to en...
详细信息
Autonomous intelligent agents are playing increasingly important roles in our lives. They contain information about us and start to perform tasks on our behalves. Chatbots are an example of such agents that need to engage in a complex conversations with humans. Thus, we need to ensure that they behave ethically. In this work we propose a hybrid logic-based approach for ethical chatbots.
This paper presents a framework to integrate Science and Computing teaching using logic programming We developed two modules: one for chemistry and the other for chemistry and physics. They are implemented in an elect...
详细信息
ISBN:
(纸本)9781577358091
This paper presents a framework to integrate Science and Computing teaching using logic programming We developed two modules: one for chemistry and the other for chemistry and physics. They are implemented in an elective course for 8th graders. Through clinical interviews, video taped class observations, exit interviews and our own experiences with the class, logic programming based approach is accessible to the students.
暂无评论