Results 61 to 70 of about 1,803,631 (274)
The community‐driven Platform MaterialDigital Core Ontology (PMDco) 3.0 is introduced as a Basic Formal Ontology‐aligned semantic backbone for the processing–structure–properties paradigm in Materials Science and Engineering. Modular engineering, automated releases, and validation workflows are highlighted and key semantic patterns for materials ...
Markus Schilling +15 more
wiley +1 more source
Exploiting parallelism in coalgebraic logic programming [PDF]
We present a parallel implementation of Coalgebraic Logic Programming (CoALP) in the programming language Go. CoALP was initially introduced to reflect coalgebraic semantics of logic programming, with coalgebraic derivation algorithm featuring both ...
Schmidt, Martin +5 more
core +1 more source
An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone +11 more
wiley +1 more source
Complexities of Logic Programs with Convex Aggregates [PDF]
ASP is a paradigm for descriptive problem solving and is widely used in fields such as planning,diagnosis,scheduling and bioinformatics.To enhance the expressive power of ASP,it has introduced aggregate functions from database systems and proposed ...
WANG Xianglong, WANG Yisong, XIE Zhongtao
doaj +1 more source
Negation and Constraint Logic Programming
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Transforming constraint logic programs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guessarian, Irene, Bensaou, N.
openaire +4 more sources
Anti-unification in Constraint Logic Programming [PDF]
AbstractAnti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what is often called a most specific generalization, that is a generalization that captures a maximal amount of ...
Gonzague Yernaux, Wim Vanhoof
openaire +4 more sources
The physical realization of artificial neurons is a critical challenge for energy‐efficient neuromorphic computing. This review presents a comprehensive analysis of the evolution of artificial neuron implementations from conventional CMOS to emerging post‐CMOS technologies.
Kannan Udaya Mohanan +4 more
wiley +1 more source
Hierarchical constraint logic programming
Summary: We describe a scheme for extending CLP(\(\mathcal D\)) to include both required and preferential constraints. An arbitrary number of strengths of preference are allowed. We present a theory of such constraint hierarchies, and an extension, hierarchical constraint logic programming (HCLP), of the CLP scheme to include constraint hierarchies. We
Molly Wilson, Alan Borning
openaire +3 more sources
Relational and Allegorical Semantics for Constraint Logic Programming [PDF]
El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de
Gallego Arias, Emilio Jesús
core +1 more source

