Results 71 to 80 of about 471,293 (319)
Logic programming with equations
This paper is a contribution to the amalgamation of logic programming (as embodied in PROLOG and functional programming (as embodied in languages like SASL, KRC, HOPE, or in dialects of LISP like LISPKIT LISP or SCHEME). We investigate how equational rewriting, which we assume is an adequate model for functional programming, can be performed within the
Keitaro Yukawa, Maarten H. van Emden
openaire +3 more sources
Logic programming with satisfiability [PDF]
Abstract This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other.
Michael Codish+2 more
openaire +2 more sources
Ultrasoft Iontronics: Stretchable Diodes Enabled by Ionically Conductive Bottlebrush Elastomers
This work introduces a solvent‐free, ultrasoft, and stretchable ionic diode based on oppositely charged bottlebrush elastomers (BBEs). The BBE diode exhibits an ultralow Young's modulus (<23 kPa), a high rectification ratio of 46, and stretchability over 400%.
Xia Wu+6 more
wiley +1 more source
Logic Macroprogramming for Wireless Sensor Networks
It is notoriously difficult and tedious to program wireless sensor networks (WSNs). To simplify WSN programming, we propose Sense2P, a logic macroprogramming system for abstracting, programming, and using WSNs as globally deductive databases.
Supasate Choochaisri+2 more
doaj +1 more source
Constraint Logic Programming approach to protein structure prediction
Background The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models.
Fogolari Federico+2 more
doaj +1 more source
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
An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone+11 more
wiley +1 more source
Probabilistic logic programming
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
Electric control of magnetic tunnel junctions offers a path to drastically reduce the energy requirements of the device. Electric field control of magnetization can be realized in a multitude of ways. These mechanisms can be integrated into existing spintronic devices to further reduce the operational energy.
Will Echtenkamp+7 more
wiley +1 more source
Proof-theoretic semantics (P-tS) is the paradigm of semantics in which meaning in logic is based on proof (as opposed to truth). A particular instance of P-tS for intuitionistic propositional logic (IPL) is its base-extension semantics (B-eS).
Alexander V. Gheorghiu, David J. Pym
doaj +1 more source