Results 61 to 70 of about 471,293 (319)
Transforming normal logic programs to constraint logic programs
A normal logic program \(P\) is transformed to another \(P^ \omega\) by a bottom-up computation on the positive component of \(P\) while the negative counterpart is left untouched. The declarative semantics of \(P\) is given by the completion of \(P^ \omega\). The completed predicate definitions in \(P^ \omega\), if they do not contain local variables,
Peter J. Stuckey, Kanchana Kanchanasut
openaire +3 more sources
The PDEM‐based SIGPE provides a dynamic nanophase from Li+‐bridged molecular self‐association, enhancing electrochemical stability and facilitating uniform Li+ ion flux at the interface. This unique solvation structure results in a hetero species‐driven inorganic‐rich SEI and long‐term cycle stability, suggesting that a PFAS‐free Li+‐containing monomer
Susung Yun+5 more
wiley +1 more source
2P-Kt: A logic-based ecosystem for symbolic AI
To date, logic-based technologies are either built on top or as extensions of the Prolog language, mostly working as monolithic solutions tailored upon specific inference procedures, unification mechanisms, or knowledge representation techniques. Instead,
Giovanni Ciatto+2 more
doaj
Detecting Malware Activities With MalpMiner: A Dynamic Analysis Approach
Day by day, malware as a service becomes more popular and easy to acquire, thus allowing anyone to start an attack without any technical background, which in turn introduces challenges for detecting such attacks.
Mustafa F. Abdelwahed+2 more
doaj +1 more source
Logic programs as specifications in the inductive verification of logic programs
AbstractIn this paper we define a new verification method based on an assertion language able to express properties defined by the user through a logic program. We first apply the verification framework defined in [3] to derive sufficient inductive conditions to prove partial correctness.
Comini M, GORI, ROBERTA, Levi G.
openaire +4 more sources
Ternary Transistors With Reconfigurable Polarities
Polarity‐reconfigurable ternary transistors are demonstrated using black phosphorus homojunction with asymmetric contacts and split‐gate structures. Suppression of majority carrier injection, while Fowler–Nordheim tunneling of low‐density minority carriers persists, enables a well‐defined intermediate state with improved on/off ratios.
Dongju Yeom+11 more
wiley +1 more source
SUNNY-CP and the MiniZinc Challenge [PDF]
In Constraint Programming (CP) a portfolio solver combines a variety of different constraint solvers for solving a given problem. This fairly recent approach enables to significantly boost the performance of single solvers, especially when multicore ...
Amadini, Roberto+2 more
core +3 more sources
Deterministic Writing of Field‐Free and Unipolar Spin‐Transfer Torque Magnetic Random‐Access Memory
Deterministic unipolar‐switching STT‐MRAM with field‐free operation is experimentally demonstrated. The device features a compact 4F2 cell architecture using a diode as the access device and a single magnetic tunneling junction. Unlike conventional bipolar switching STT‐MRAM requiring a three‐terminal access transistor in the array, this design offers ...
Ming‐Chun Hong+22 more
wiley +1 more source
Defeasible logic programming: language definition, operational semantics, and parallelism
This thesis defines Defeasible Logic Programming and provides a concrete specification of this new language through its operational semantics. Defeasible Logic Programming, or DeLP for short, has been defined based on the Logic Programming paradigm and ...
Alejandro Javier García
doaj
Logic programming and ultrametric spaces [PDF]
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