440 research outputs found
Computing and Information Science
Cornell University Courses of Study Vol. 98 2006/200
Computing and Information Science (CIS)
Cornell University Courses of Study Vol. 97 2005/200
Dagstuhl News January - December 2001
"Dagstuhl News" is a publication edited especially for the members of the Foundation "Informatikzentrum Schloss Dagstuhl" to thank them for their support. The News give a summary of the scientific work being done in Dagstuhl. Each Dagstuhl Seminar is presented by a small abstract describing the contents and scientific highlights of the seminar as well as the perspectives or challenges of the research topic
Connectionist Theory Refinement: Genetically Searching the Space of Network Topologies
An algorithm that learns from a set of examples should ideally be able to
exploit the available resources of (a) abundant computing power and (b)
domain-specific knowledge to improve its ability to generalize. Connectionist
theory-refinement systems, which use background knowledge to select a neural
network's topology and initial weights, have proven to be effective at
exploiting domain-specific knowledge; however, most do not exploit available
computing power. This weakness occurs because they lack the ability to refine
the topology of the neural networks they produce, thereby limiting
generalization, especially when given impoverished domain theories. We present
the REGENT algorithm which uses (a) domain-specific knowledge to help create an
initial population of knowledge-based neural networks and (b) genetic operators
of crossover and mutation (specifically designed for knowledge-based networks)
to continually search for better network topologies. Experiments on three
real-world domains indicate that our new algorithm is able to significantly
increase generalization compared to a standard connectionist theory-refinement
system, as well as our previous algorithm for growing knowledge-based networks.Comment: See http://www.jair.org/ for any accompanying file
The Future of Fundamental Science Led by Generative Closed-Loop Artificial Intelligence
Recent advances in machine learning and AI, including Generative AI and LLMs,
are disrupting technological innovation, product development, and society as a
whole. AI's contribution to technology can come from multiple approaches that
require access to large training data sets and clear performance evaluation
criteria, ranging from pattern recognition and classification to generative
models. Yet, AI has contributed less to fundamental science in part because
large data sets of high-quality data for scientific practice and model
discovery are more difficult to access. Generative AI, in general, and Large
Language Models in particular, may represent an opportunity to augment and
accelerate the scientific discovery of fundamental deep science with
quantitative models. Here we explore and investigate aspects of an AI-driven,
automated, closed-loop approach to scientific discovery, including self-driven
hypothesis generation and open-ended autonomous exploration of the hypothesis
space. Integrating AI-driven automation into the practice of science would
mitigate current problems, including the replication of findings, systematic
production of data, and ultimately democratisation of the scientific process.
Realising these possibilities requires a vision for augmented AI coupled with a
diversity of AI approaches able to deal with fundamental aspects of causality
analysis and model discovery while enabling unbiased search across the space of
putative explanations. These advances hold the promise to unleash AI's
potential for searching and discovering the fundamental structure of our world
beyond what human scientists have been able to achieve. Such a vision would
push the boundaries of new fundamental science rather than automatize current
workflows and instead open doors for technological innovation to tackle some of
the greatest challenges facing humanity today.Comment: 35 pages, first draft of the final report from the Alan Turing
Institute on AI for Scientific Discover
Verification of Stateful Cryptographic Protocols with Exclusive OR
International audienceIn cryptographic protocols, in particular RFID protocols, exclusive-or (XOR) operations are common. Due to the inherent complexity of faithful models of XOR, there is only limited tool support for the verification of cryptographic protocols using XOR. In this paper, we improve the TAMARIN prover and its underlying theory to deal with an equational theory modeling XOR operations. The XOR theory can be combined with all equational theories previously supported, including user-defined equational theories. This makes TAMARIN the first verification tool for cryptographic protocols in the symbolic model to support simultaneously this large set of equational theories, protocols with global mutable state, an unbounded number of sessions, and complex security properties including observational equivalence. We demonstrate the effectiveness of our approach by analyzing several protocols that rely on XOR, in particular multiple RFID-protocols, where we can identify attacks as well as provide proofs
OpenCog Hyperon: A Framework for AGI at the Human Level and Beyond
An introduction to the OpenCog Hyperon framework for Artificiai General
Intelligence is presented. Hyperon is a new, mostly from-the-ground-up
rewrite/redesign of the OpenCog AGI framework, based on similar conceptual and
cognitive principles to the previous OpenCog version, but incorporating a
variety of new ideas at the mathematical, software architecture and
AI-algorithm level. This review lightly summarizes: 1) some of the history
behind OpenCog and Hyperon, 2) the core structures and processes underlying
Hyperon as a software system, 3) the integration of this software system with
the SingularityNET ecosystem's decentralized infrastructure, 4) the cognitive
model(s) being experimentally pursued within Hyperon on the hopeful path to
advanced AGI, 5) the prospects seen for advanced aspects like reflective
self-modification and self-improvement of the codebase, 6) the tentative
development roadmap and various challenges expected to be faced, 7) the
thinking of the Hyperon team regarding how to guide this sort of work in a
beneficial direction ... and gives links and references for readers who wish to
delve further into any of these aspects
Twenty years of rewriting logic
AbstractRewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems
- …