Results 301 to 310 of about 471,293 (319)
Integration of Real Signals Acquired Through External Sensors into RoboDK Simulation of Robotic Industrial Applications. [PDF]
Cristoiu C, Ivan AM.
europepmc +1 more source
A Blending Approach for Dual Surface and Bulk Functionality in Organic Transistors
Dual‐mode organic transistor, combining Electrolyte‐Gated Organic Field‐Effect Transistor (EGOFET) and Organic Electrochemical Transistor (OECT) functionalities, is achieved by blending p‐type semiconducting polymer and n‐type mixed conducting fullerene.
Sasha Simotko+2 more
wiley +1 more source
TittaLSL: A toolbox for creating networked eye-tracking experiments in Python and MATLAB with Tobii eye trackers. [PDF]
Niehorster DC, Nyström M.
europepmc +1 more source
Inkjet Printable Semiconducting Inks for Enhancement‐Mode Organic Electrochemical Transistors
Inkjet‐printable semiconducting inks based on the p‐type molecularly de‐doped PEDOT:PSS and the n‐type BBL enable cleanroom‐free fabrication of enhancement‐mode organic electrochemical transistors (OECTs). Printed devices are used for logic gate operation and electrochemical sensing of ascorbic acid.
Alan Eduardo Avila Ramirez+7 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Logic programs as types for logic programs
[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 2002Optimistic type systems for logic programs are considered. In such systems types are conservative approximations to the success set of the program predicates. The use of logic programs to describe types is proposed. It is argued that this approach unifies the denotational and operational approaches to descriptive type systems and is simpler and more ...
Thom Frühwirth+3 more
openaire +2 more sources
Studia Logica, 1985
The paper is concerned with a relationship between programs and Gentzen type formalizations of predicate and propositional logics. It turns out that finite control algorithms (which serve as models of iterative programs) are sufficient for describing the proof searching procedures for propositional logics which admit cut-free Gentzen type formalization,
openaire +3 more sources
The paper is concerned with a relationship between programs and Gentzen type formalizations of predicate and propositional logics. It turns out that finite control algorithms (which serve as models of iterative programs) are sufficient for describing the proof searching procedures for propositional logics which admit cut-free Gentzen type formalization,
openaire +3 more sources
Fundamenta Informaticae, 1992
Starting from a general dynamic analysis of reasoning and programming, we develop two main dynamic perspectives upon logic programming. First, the standard fixed point semantics for Horn clause programs naturally supports imperative programming styles.
openaire +3 more sources
Starting from a general dynamic analysis of reasoning and programming, we develop two main dynamic perspectives upon logic programming. First, the standard fixed point semantics for Horn clause programs naturally supports imperative programming styles.
openaire +3 more sources
Autoepistemic logic programming
Journal of Automated Reasoning, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
ACM SIGMOD Record, 1990
An extension of logic programming, called “ordered logic programming”, which includes some abstractions of the object-oriented paradigm, is presented. An ordered program consists of a number of modules (objects), where each module is composed by a number of rules possibly with negated head predicates.
Laenens E., SACCA', Domenico, Vermeir D.
openaire +5 more sources
An extension of logic programming, called “ordered logic programming”, which includes some abstractions of the object-oriented paradigm, is presented. An ordered program consists of a number of modules (objects), where each module is composed by a number of rules possibly with negated head predicates.
Laenens E., SACCA', Domenico, Vermeir D.
openaire +5 more sources
Logic Programming and Default Logic
International Journal on Artificial Intelligence Tools, 1994We present several ideas of increasing complexity how to translate default theories to normal logic programs that make direct use of the deductive capacity of logic programming. We show the limitations of simple, ad hoc approaches, and arrive at a more general construction; its main property is that the answer substitutions computed by the logic ...
openaire +2 more sources