Results 71 to 80 of about 575,998 (339)
AbstractWe construct Scott domains well suited to use in an abstract implementation of logic programming, and perhaps to the modelling of other first-order data structures. The domain elements, which we call “grafts”, are in effect a sort of directed graphs.
Filippenko, I., Morris, F. L.
openaire +2 more sources
The PDEM‐based SIGPE provides a dynamic nanophase from Li+‐bridged molecular self‐association, enhancing electrochemical stability and facilitating uniform Li+ ion flux at the interface. This unique solvation structure results in a hetero species‐driven inorganic‐rich SEI and long‐term cycle stability, suggesting that a PFAS‐free Li+‐containing monomer
Susung Yun+5 more
wiley +1 more source
Logic Macroprogramming for Wireless Sensor Networks
It is notoriously difficult and tedious to program wireless sensor networks (WSNs). To simplify WSN programming, we propose Sense2P, a logic macroprogramming system for abstracting, programming, and using WSNs as globally deductive databases.
Supasate Choochaisri+2 more
doaj +1 more source
Constraint Logic Programming approach to protein structure prediction
Background The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models.
Fogolari Federico+2 more
doaj +1 more source
In this work we present work in progress on functionality duplication detection in logic programs. Eliminating duplicated functionality recently became prominent in context of refactoring. We describe a quantitative approach that allows to measure the ``similarity'' between two predicate definitions.
Serebrenik, A., Vanhoof, W.
openaire +4 more sources
Declaratively solving Google Code Jam problems with Picat
In this paper we present several examples of solving algorithmic problems from the Google Code Jam programming contest with Picat programming language using declarative techniques: constraint logic programming and tabled logic programming.
Dymchenko, Sergii, Mykhailova, Mariia
core +1 more source
Ternary Transistors With Reconfigurable Polarities
Polarity‐reconfigurable ternary transistors are demonstrated using black phosphorus homojunction with asymmetric contacts and split‐gate structures. Suppression of majority carrier injection, while Fowler–Nordheim tunneling of low‐density minority carriers persists, enables a well‐defined intermediate state with improved on/off ratios.
Dongju Yeom+11 more
wiley +1 more source
Deterministic Writing of Field‐Free and Unipolar Spin‐Transfer Torque Magnetic Random‐Access Memory
Deterministic unipolar‐switching STT‐MRAM with field‐free operation is experimentally demonstrated. The device features a compact 4F2 cell architecture using a diode as the access device and a single magnetic tunneling junction. Unlike conventional bipolar switching STT‐MRAM requiring a three‐terminal access transistor in the array, this design offers ...
Ming‐Chun Hong+22 more
wiley +1 more source
A Survey of the Proof-Theoretic Foundations of Logic Programming [PDF]
Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this paper, we will survey the use of structural proof theory as an alternative foundation. Researchers have been using this foundation for the past 35 years to elevate logic programming from its roots in first-order classical logic ...
arxiv
Ultrasoft Iontronics: Stretchable Diodes Enabled by Ionically Conductive Bottlebrush Elastomers
This work introduces a solvent‐free, ultrasoft, and stretchable ionic diode based on oppositely charged bottlebrush elastomers (BBEs). The BBE diode exhibits an ultralow Young's modulus (<23 kPa), a high rectification ratio of 46, and stretchability over 400%.
Xia Wu+6 more
wiley +1 more source