Results 91 to 100 of about 165,831 (331)

Origami‐Inspired Structural Design for Aquatic‐Terrestrial Amphibious Robots

open access: yesAdvanced Robotics Research, EarlyView.
This work presents a lightweight amphibious origami robot actuated by a single shape memory alloy wire. A rigid foldable origami structure with displacement amplification enables efficient terrestrial crawling and aquatic swimming. The addition of fan‐shaped units allows controllable turning in both environments.
Weiqi Liu   +5 more
wiley   +1 more source

Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers

open access: yes, 2004
We show that the satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.Comment: 24 pages, 1 pstex_t ...
Pratt-Hartmann, Ian
core   +2 more sources

Algebraic logic for the negation fragment of classical logic

open access: yesLogic Journal of the IGPL, 2023
Abstract The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary (Abstract) Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically associated with a logic in Algebraic Logic, i.e. we find the classes $\textrm{Alg}^*$, $\textrm{Alg}
openaire   +3 more sources

CellPolaris: Transfer Learning for Gene Regulatory Network Construction to Guide Cell State Transitions

open access: yesAdvanced Science, EarlyView.
CellPolaris decodes how transcription factors guide cell fate by building gene regulatory networks from transcriptomic data using transfer learning. It generates tissue‐ and cell‐type‐specific networks, identifies master regulators in cell state transitions, and simulates TF perturbations in developmental processes.
Guihai Feng   +27 more
wiley   +1 more source

Distributed Logic Objects A Fragment of Rewriting Logic and its Implementation

open access: yesElectronic Notes in Theoretical Computer Science, 1996
AbstractThis paper presents a logic language (called Distributed Logic Objects, DLO for short) that supports objects, messages and inheritance. The operational semantics of the language is given in terms of rewriting rules acting upon the (possibly distributed) state of the system. In this sense, the logic underlying the language is Rewriting Logic. In
A. Ciampolini   +3 more
openaire   +3 more sources

Non-commutative logic I: the multiplicative fragment

open access: yesAnnals of Pure and Applied Logic, 1999
The paper introduces a noncommutative \textit{extension} of the multiplicative fragment of linear logic (LL), called ``noncommutative logic'' (NL). When noncommutative LL was already studied, it was usually done in strictly noncommutative systems (which did not contain commutative LL). This is the first time that such a simple and elegant way to extend
Abrusci, V.Michele, Ruet, Paul
openaire   +1 more source

A Microfluidic Digital Shutter of Liquid–Liquid Interface for Fabrication of Multifaceted Hydrogel Microfiber Structure

open access: yesAdvanced Science, EarlyView.
A programmable passive digital shutter based on multiphase liquid–liquid interface dynamics is introduced for precise fabrication of hydrogel microfibers. By modulating the shutter operation, microfibers with tunable geometry—including linear, helical, tadpole‐like, and spherical forms—are produced.
Dongrui Zhang   +14 more
wiley   +1 more source

The Disordered Region of ASXL1 Acts as an Auto‐Regulator Through Condensation

open access: yesAdvanced Science, EarlyView.
ASXL1's long IDR encodes an electrostatic “basic platform + acidic brake” that autoregulates condensation. Truncation at a clinical hotspot lifts this brake, forming condensates that retarget BRD2, remodel local chromatin accessibility, and impair neutrophil maturation.
Xiao Fang, Qiwei Li, Wenqing Zhang
wiley   +1 more source

On the Complexity of Temporal-Logic Path Checking

open access: yes, 2014
Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this task was recently shown to be in NC.
B. Finkbeiner   +7 more
core   +1 more source

Combinatorial Bitstring Semantics for Arbitrary Logical Fragments

open access: yesJournal of Philosophical Logic, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Demey, Lorenz, Smessaert, Hans
openaire   +1 more source

Home - About - Disclaimer - Privacy