Results 61 to 70 of about 6,500,790 (324)
The Journal of Logic Programming, 1986 Summary: Consider the class of programs P where the greatest fixpoint of \(T_ P\) is equal to the complement of the finite failure set of P. Programs in this class possess some important properties which others do not. The main result in this paper proves that this class is representative of all programs.
Joxan Jaffar, Peter J. Stuckey
openaire +3 more sources
Advanced Functional Materials, EarlyView.Edible electronics needs integrated logic circuits for computation and control. This work presents a potentially edible printed chitosan‐gated transistor with a design optimized for integration in circuits. Its implementation in integrated logic gates and circuits operating at low voltage (0.7 V) is demonstrated, as well as the compatibility with an ...
Giulia Coco +8 more
wiley +1 more source
Logic programming and ultrametric spaces [PDF]
Rendiconti di Matematica e delle Sue Applicazioni, 1999 By this expository paper we would like to call the attention to ultrametric spaces and their applications to logic programming. We present the essentials of logic programming and give an introduction to the theory of ultrametric spaces.
Sibylla Priess-Crampe, Paulo Ribenboim
doaj
Avoidance of operational sampling errors in drinking water analysis
Aqua, 2022 The internal audits carried out in the first half of 2019 in water laboratories as part of quality accreditation in accordance with ISO/IEC 17025:2017 showed a high frequency of adverse events in connection with sampling.
Ana Fernandes +4 more
doaj +1 more source
Probabilistic logic programming
Information and Computation, 1992 The logic programming language for expressing a probabilistic information is proposed. \(P\)-programs are finite sets of clauses of a special kind: the head of a clause is an atomic formula loaded by a closed interval \([a,b]\), and the body is a set of formulae (not only atomic) which are loaded by closed intervals too. The formula \(F:[a,b]\) denotes
Raymond T. Ng, V. S. Subrahmanian
openaire +3 more sources
Atmospheric Doping of Stretchable Polymer Semiconductors for Skin Electronics
Advanced Functional Materials, EarlyView.An atmospheric doping system using oxygen molecules in air as dopants is introduced for stretchable polymer semiconductors. The chemisorbed oxygen molecules act as acceptor, lead to increase not only the hole concentration of the semiconductor film over two orders of magnitude (3.37 × 1017 cm−3) but also electrical properties of the field‐effect ...
Min Woo Jeong +7 more
wiley +1 more source
Space Syntax with Logic Programming: An Application to a Modern Estate
Urban Science, 2023 Space syntax is a set of theories and techniques for analysing urban settlements and buildings. Here, we propose a new approach to perform syntactic analyses that requires only the declaration in a computer program of the connections between axial lines ...
Pedro Afonso Fernandes
doaj +1 more source
The Journal of Logic Programming, 1999 Summary: We present the notion of steadfastness that at once embodies modularity, reusability, and formal correctness. A steadfast program is an open program with parameters, which is parametrically correct in the sense that it will always be correct with respect to its (open) specification whenever its parameters are computed correctly.
Mario Ornaghi +2 more
openaire +2 more sources
Advanced Functional Materials, EarlyView.Herein, the synthesis of Ta₂Pd₃S₈ nanowires is reported via scalable liquid cascade exfoliation and their integration into high‐mobility field‐effect transistors (FETs) and sensitive photodetectors, achieving carrier mobility of up to 27.3 cm2 V⁻¹ s⁻¹ and responsivities of 322.40 A W⁻¹ and 1.85 mA W⁻¹ for single nanowire and network devices ...
Kyung Hwan Choi +13 more
wiley +1 more source
Transformations of logic programs
The Journal of Logic Programming, 1984 The paper introduces a new concept of computation tree of a logic program that will be used in reasoning about programs. Three types of transformations improving the structure of logic programs are described. There are two natural measures of complexity suggested by computation trees, namely, the number of nodes called by recursion and the maximal ...
Petr Štěpánek, Olga Štěpánková
openaire +2 more sources