Results 71 to 80 of about 5,727 (317)

Tool support for reasoning in display calculi [PDF]

, 2016
We present a tool for reasoning in and about propositional sequent calculi. One aim is to support reasoning in calculi that contain a hundred rules or more, so that even relatively small pen and paper derivations become tedious and error prone.
Balco, Samuel, Frittella, Sabine, Greco, Giuseppe, Kurz, Alexander, Palmigiano, Alessandra   +4 more
core   +2 more sources

An intracellular transporter mitigates the CO2‐induced decline in iron content in Arabidopsis shoots

FEBS Letters, EarlyView.
This study identifies a gene encoding a transmembrane protein, MIC, which contributes to the reduction of shoot Fe content observed in plants under elevated CO2. MIC is a putative Fe transporter localized to the Golgi and endosomal compartments. Its post‐translational regulation in roots may represent a potential target for improving plant nutrition ...
Timothy Mozzanino, Meijie Li, Cécile Fizames, Mattia Adamo, Laurence Lejay, Christian Dubos, Matthieu Platre, Antoine Martin   +7 more
wiley   +1 more source

A Cre‐dependent lentiviral vector for neuron subtype‐specific expression of large proteins

FEBS Letters, EarlyView.
We designed a versatile and modular lentivector comprising a Cre‐dependent switch and self‐cleaving 2A peptide and tested it for co‐expression of GFP and a 2.8 kb gene of interest (GOI) in mouse cortical parvalbumin (PV+) interneurons and midbrain dopamine (TH+) neurons.
Weixuan Xue, Sandrine Picaud, Régine Hepp, Stéphanie Pons, Uwe Maskos, Bertrand Lambolez, Ludovic Tricoire   +6 more
wiley   +1 more source

Gentzen and Temporal Sequents

Studies in Logic, Grammar and Rhetoric
The paper presents a comparison of two generalised sequent calculi for temporal logics. In both cases the main technical solution is the multiplication of the sorts of sequents and, additionally, the application of some kind of labelling to formulae. The
Indrzejczak Andrzej
doaj   +1 more source

Converting ALC Connection Proofs into ALC Sequents [PDF]

Electronic Proceedings in Theoretical Computer Science, 2019
The connection method has earned good reputation in the area of automated theorem proving, due to its simplicity, efficiency and rational use of memory. This method has been applied recently in automatic provers that reason over ontologies written in the
Eunice Palmeira, Fred Freitas, Jens Otten   +2 more
doaj   +1 more source

Modular Labelled Sequent Calculi for Abstract Separation Logics

, 2017
separation logics are a family of extensions of Hoare logic for reasoning about programs that manipulate resources such as memory locations. These logics are "abstract" because they are independent of any particular concrete resource model.
Clouston, Ranald, Goré, Rajeev, Hóu, Zhé, Tiu, Alwen   +3 more
core   +1 more source

Structural insights into lacto‐N‐biose I recognition by a family 32 carbohydrate‐binding module from Bifidobacterium bifidum

FEBS Letters, EarlyView.
Bifidobacterium bifidum establishes symbiosis with infants by metabolizing lacto‐N‐biose I (LNB) from human milk oligosaccharides (HMOs). The extracellular multidomain enzyme LnbB drives this process, releasing LNB via its catalytic glycoside hydrolase family 20 (GH20) lacto‐N‐biosidase domain.
Xinzhe Zhang, Naoki Sunagawa, Toma Kashima, Kiyohiko Igarashi, Akimasa Miyanaga, Shinya Fushinobu   +5 more
wiley   +1 more source

The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity

FEBS Letters, EarlyView.
The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley   +1 more source

Grouping based calculus for propositional linear temporal logic

Lietuvos Matematikos Rinkinys
In this paper, the authors research the problem of loops in linear temporal logic PLTL. The task involves defining the standard rule application process for the derivation procedure (as used in [4] and [5]), determining and proving properties for the ...
Kostas Ragauskas, Adomas Birštunas
doaj   +3 more sources

Loop-check free sequent calculi for unary fragment of temporal logic

Lietuvos Matematikos Rinkinys
This paper explores the construction of an efficient sequent calculus for a selected fragment of porpositional linear temporal logic (PLTL), extending the ideas of classical calculi discussed in [1], and builds upon previous investigations into the ...
Lukas Maksimiak, Adomas Birštunas
doaj   +1 more source