Results 111 to 120 of about 165,990,627 (290)

Relational Rippling: A General Approach [PDF]

open access: yes, 1995
We propose a new version of rippling, called relational rippling. Rippling is a heuristic for guiding proof search, especially in the step cases of inductive proofs. Relational rippling is designed for representations in which value passing is by shared
Vincent Lombart   +3 more
core  

Disturb‐Resilient and Wake‐up‐Free 2T‐MFMFET Array for Storage and Computing Applications

open access: yesAdvanced Materials Technologies, EarlyView.
A disturb‐resilient and wake‐up‐free 2T‐MFMFET array fabricated using a FeRAM‐compatible process demonstrates excellent uniformity, a large memory window, and 3‐bit multi‐level‐cell storage capability. A newly proposed hybrid in‐memory computing scheme further enables accurate multiply–accumulate operations with minimal refresh overhead, highlighting ...
Chen‐Yi Cho   +6 more
wiley   +1 more source

Microfabrication of Soft Millirobots Propelled by Low Voltage Electrohydraulic Actuators

open access: yesAdvanced Materials Technologies, EarlyView.
Manual layer‐by‐layer assembly is replaced by wafer‐level MEMS batch fabrication for compliant polymer‐based electrohydraulic actuators. The microfabricated devices integrate sacrificially defined microcavities, Parylene‐C‐sealed inlets, and multilayer polymer–metal films.
Shai Shmulevich   +2 more
wiley   +1 more source

A second order logic of existence [PDF]

open access: yes, 1969
Publisher's, offprint versionA. N. Prior in [9] has suggested an approach towards a second order logic of existence where, following medieval logicians, we distinguish “between predicates (like ‘is red’, ‘is hard’, etc.) which entail existence, and ...
Cocchiarella, Nino
core   +1 more source

The Informal Logic Of Mathematical Proof [PDF]

open access: yes, 2006
Informal logic is a method of argument analysis which is complementary to that of formal logic, providing for the pragmatic treatment of features of argumentation which cannot be reduced to logical form. The central claim of this paper is that a more nuanced understanding of mathematical proof and discovery may be achieved by paying attention to the ...
openaire   +3 more sources

On‐Chip Photonic Neural Network Architectures

open access: yesAdvanced Optical Materials, EarlyView.
This review presents a comprehensive overview of on‐chip photonic neural network architectures, covering key photonic building blocks, representative network types, and emerging applications. Recent advances, implementation challenges, and future directions are examined, highlighting the potential of integrated photonics to enable ultrafast, energy ...
Seokjin Hong   +7 more
wiley   +1 more source

A Hybrid Intuitionistic Logic: Semantics and Decidability

open access: yes, 2005
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced by Jia and Walker. The modalities of the logic allow validation of properties in a particular place, in some place and in all places.
Damiano Macedonio   +5 more
core  

Proving properties of logic programs: A Progress Report [PDF]

open access: yes, 1988
We outline the progress we have made in connection with the Alvey Grant "Proving Properties of Logic Programs" (SERC GR/D/44270 and Alvey IKBS 137). This grant runs for three years from 1st November 1985. The grant holders are Professor Alan Bundy and Dr
Bundy, Alan   +9 more
core  

A Proof‐of‐Concept Assessment of a Novel Wearable Eyelid Muscle Device: A Pre‐Clinical Animal Cadaver Study for Eyelid Closure Restoration

open access: yesAdvanced Robotics Research, EarlyView.
This article introduces a soft wearable eyelid sling device incorporating a hydraulic soft artificial muscle (SAM) for achieving complete closure of an eyelid. The SAM is driven by a cam mechanism that provides a displacement profile closely matched with those of a healthy eyelid.
Patrick Pruscino   +7 more
wiley   +1 more source

Reducing Scheduling Overheads for Concurrent Logic Programs [PDF]

open access: yes, 1991
Strictness analysis is crucial for the efficient implementation of the lazy functional languages. A related technique for the concurrent logic languages (CLLs) called schedule analysis is presented which divides at compile-time a CLL program into threads
Soper, Paul   +3 more
core  

Home - About - Disclaimer - Privacy