33 research outputs found
Computers from plants we never made. Speculations
We discuss possible designs and prototypes of computing systems that could be
based on morphological development of roots, interaction of roots, and analog
electrical computation with plants, and plant-derived electronic components. In
morphological plant processors data are represented by initial configuration of
roots and configurations of sources of attractants and repellents; results of
computation are represented by topology of the roots' network. Computation is
implemented by the roots following gradients of attractants and repellents, as
well as interacting with each other. Problems solvable by plant roots, in
principle, include shortest-path, minimum spanning tree, Voronoi diagram,
-shapes, convex subdivision of concave polygons. Electrical properties
of plants can be modified by loading the plants with functional nanoparticles
or coating parts of plants of conductive polymers. Thus, we are in position to
make living variable resistors, capacitors, operational amplifiers,
multipliers, potentiometers and fixed-function generators. The electrically
modified plants can implement summation, integration with respect to time,
inversion, multiplication, exponentiation, logarithm, division. Mathematical
and engineering problems to be solved can be represented in plant root networks
of resistive or reaction elements. Developments in plant-based computing
architectures will trigger emergence of a unique community of biologists,
electronic engineering and computer scientists working together to produce
living electronic devices which future green computers will be made of.Comment: The chapter will be published in "Inspired by Nature. Computing
inspired by physics, chemistry and biology. Essays presented to Julian Miller
on the occasion of his 60th birthday", Editors: Susan Stepney and Andrew
Adamatzky (Springer, 2017
Differentiable Inductive Logic Programming in High-Dimensional Space
Synthesizing large logic programs through symbolic Inductive Logic
Programming (ILP) typically requires intermediate definitions. However,
cluttering the hypothesis space with intensional predicates typically degrades
performance. In contrast, gradient descent provides an efficient way to find
solutions within such high-dimensional spaces. Neuro-symbolic ILP approaches
have not fully exploited this so far. We propose extending the {\delta}ILP
approach to inductive synthesis with large-scale predicate invention, thus
allowing us to exploit the efficacy of high-dimensional gradient descent. We
show that large-scale predicate invention benefits differentiable inductive
synthesis through gradient descent and allows one to learn solutions for tasks
beyond the capabilities of existing neuro-symbolic ILP systems. Furthermore, we
achieve these results without specifying the precise structure of the solution
within the language bias.Comment: 8 pages, under revie
Fuzzy Logic
Fuzzy Logic is becoming an essential method of solving problems in all domains. It gives tremendous impact on the design of autonomous intelligent systems. The purpose of this book is to introduce Hybrid Algorithms, Techniques, and Implementations of Fuzzy Logic. The book consists of thirteen chapters highlighting models and principles of fuzzy logic and issues on its techniques and implementations. The intended readers of this book are engineers, researchers, and graduate students interested in fuzzy logic systems
Fuzzy Sets, Fuzzy Logic and Their Applications 2020
The present book contains the 24 total articles accepted and published in the Special Issue “Fuzzy Sets, Fuzzy Logic and Their Applications, 2020” of the MDPI Mathematics journal, which covers a wide range of topics connected to the theory and applications of fuzzy sets and systems of fuzzy logic and their extensions/generalizations. These topics include, among others, elements from fuzzy graphs; fuzzy numbers; fuzzy equations; fuzzy linear spaces; intuitionistic fuzzy sets; soft sets; type-2 fuzzy sets, bipolar fuzzy sets, plithogenic sets, fuzzy decision making, fuzzy governance, fuzzy models in mathematics of finance, a philosophical treatise on the connection of the scientific reasoning with fuzzy logic, etc. It is hoped that the book will be interesting and useful for those working in the area of fuzzy sets, fuzzy systems and fuzzy logic, as well as for those with the proper mathematical background and willing to become familiar with recent advances in fuzzy mathematics, which has become prevalent in almost all sectors of the human life and activity
Automated Deduction – CADE 28
This open access book constitutes the proceeding of the 28th International Conference on Automated Deduction, CADE 28, held virtually in July 2021. The 29 full papers and 7 system descriptions presented together with 2 invited papers were carefully reviewed and selected from 76 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience. The papers are organized in the following topics: Logical foundations; theory and principles; implementation and application; ATP and AI; and system descriptions
Metasemantics and fuzzy mathematics
The present thesis is an inquiry into the metasemantics of natural languages, with a particular focus on the philosophical motivations for countenancing degreed formal frameworks for both psychosemantics and truth-conditional semantics. Chapter 1 sets out to offer a bird's eye view of our overall research project and the key questions that we set out to address. Chapter 2 provides a self-contained overview of the main empirical findings in the cognitive science of concepts and categorisation. This scientific background is offered in light of the fact that most variants of psychologically-informed semantics see our network of concepts as providing the raw materials on which lexical and sentential meanings supervene. Consequently, the metaphysical study of internalistically-construed meanings and the empirical study of our mental categories are overlapping research projects. Chapter 3 closely investigates a selection of species of conceptual semantics, together with reasons for adopting or disavowing them. We note that our ultimate aim is not to defend these perspectives on the study of meaning, but to argue that the project of making them formally precise naturally invites the adoption of degreed mathematical frameworks (e.g. probabilistic or fuzzy). In Chapter 4, we switch to the orthodox framework of truth-conditional semantics, and we present the limitations of a philosophical position that we call "classicism about vagueness". In the process, we come up with an empirical hypothesis for the psychological pull of the inductive soritical premiss and we make an original objection against the epistemicist position, based on computability theory. Chapter 5 makes a different case for the adoption of degreed semantic frameworks, based on their (quasi-)superior treatments of the paradoxes of vagueness. Hence, the adoption of tools that allow for graded membership are well-motivated under both semantic internalism and semantic externalism. At the end of this chapter, we defend an unexplored view of vagueness that we call "practical fuzzicism". Chapter 6, viz. the final chapter, is a metamathematical enquiry into both the fuzzy model-theoretic semantics and the fuzzy Davidsonian semantics for formal languages of type-free truth in which precise truth-predications can be expressed
19th Brazilian Logic Conference: Book of Abstracts
This is the book of abstracts of the 19th Brazilian Logic Conferences. The Brazilian Logic Conferences (EBL) is one of the most traditional logic conferences in South America. Organized by the Brazilian Logic Society (SBL), its main goal is to promote the dissemination of research in logic in a broad sense. It has been occurring since 1979, congregating logicians of different fields — mostly philosophy, mathematics and computer science — and with different backgrounds — from undergraduate students to senior researchers. The meeting is an important moment for the Brazilian and South American logical community to join together and discuss recent developments of the field. The areas of logic covered in the conference spread over foundations and philosophy of science, analytic philosophy, philosophy and history of logic, mathematics, computer science, informatics, linguistics and artificial intelligence. Previous editions of the EBL have been a great success, attracting researchers from all over Latin America and elsewhere.
The 19th edition of EBL takes place from May 6-10, 2019, in the beautiful city of João Pessoa, at the northeast coast of Brazil. It is conjointly organized by Federal University of Paraíba (UFPB), whose main campus is located in João Pessoa, Federal University of Campina Grande (UFCG), whose main campus is located in the nearby city of Campina Grande (the second-largest city in Paraíba state) and SBL. It is sponsored by UFPB, UFCG, the Brazilian Council for Scientific and Technological Development (CNPq) and the State Ministry of Education, Science and Technology of Paraíba. It takes place at Hotel Luxxor Nord Tambaú, privileged located right in front Tambaú beach, one of João Pessoa’s most famous beaches
Kiel Declarative Programming Days 2013
This report contains the papers presented at the Kiel Declarative Programming Days 2013, held in Kiel (Germany) during September 11-13, 2013. The Kiel Declarative Programming Days 2013 unified the following events: * 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013) * 22nd International Workshop on Functional and (Constraint) Logic Programming (WFLP 2013) * 27th Workshop on Logic Programming (WLP 2013) All these events are centered around declarative programming, an advanced paradigm for the modeling and solving of complex problems. These specification and implementation methods attracted increasing attention over the last decades, e.g., in the domains of databases and natural language processing, for modeling and processing combinatorial problems, and for high-level programming of complex, in particular, knowledge-based systems