Results 101 to 110 of about 6,452,641 (347)

Tractable reasoning about Agent Programming in Dynamic Preference Logic [PDF]

, 2019
While several BDI logics have been proposed in the area of Agent Programming, it is not clear how these logics are connected to the agent programs they are supposed to specify. More yet, the reasoning problems in these logics, being based on modal logic, are not tractable in general, limiting their usage to tackle real-world problems.
arxiv   +1 more source

Inductive Logic Programming [PDF]

, 2011
Inductive logic programming is the subfield of machine learning that uses first order logic to represent hypotheses and data. Because first order logic is expressive and declarative, inductive logic programming specfically targets problems involving structured data and background knowledge. Inductive logic programming tackles a wide variety of problems
openaire   +3 more sources

Spin‐Selective Anisotropic Magnetoresistance Driven by Chirality in DNA

Advanced Functional Materials, EarlyView.
It is shown that magnetoresistance (MR) measurements carried out as a function of angular dependence between the magnetic field and a chiral (DNA) interface provide a valuable new insight into the charge transport mechanism associated with the chiral‐induced spin selectivity (CISS) effect.
Tapan Kumar Das, Naupada Preeyanka, Suryakant Mishra, Yutao Sang, Claudio Fontanesi   +4 more
wiley   +1 more source

DEDUCŢIA LOGICĂ – MECANISM DE CALCUL AL LIMBAJULUI DE PROGRAMARE LOGICĂ

Studia Universitatis Moldaviae: Stiinte Umanistice, 2008
The present article focuses on analysis and synthesis of elements which are the base of abstract interpreter of programs written in logic. Logic programming and Prolog language significance in studying computer science is appreciating.
USM ADMIN
doaj  

DNA logic programming: From concept to construction

View
DNA programming, which is based on the principle of base complementary pairing and Boolean operations, exhibits organizational structures and algorithms similar to those observed in machine language.
Yi Zhang, Ning Hu, Jiajie Xu, Zhen Wang
doaj   +1 more source

Stable models and an alternative logic programming paradigm [PDF]

The Logic Programming Paradigm, K.R. Apt, V.W. Marek, M. Truszczynski, D.S. Warren (eds.), pp. 375-398. Springer-Verlag, 1999, 1998
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting alternative to more traditional logic programming ...
arxiv  

Transforming normal logic programs to constraint logic programs

Theoretical Computer Science, 1992
AbstractA normal logic program P is transformed to another Pω 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ω. The completed predicate definitions in Pω, if they do not contain local variables, can be used as a basis for expanding
Peter J. Stuckey, Kanchana Kanchanasut
openaire   +2 more sources

Ternary Transistors With Reconfigurable Polarities

Advanced Functional Materials, EarlyView.
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, Yeonghyeon Ko, Youngkyu Ko, Heungsoon Im, Jungi Song, Yongwook Seok, Hanbyeol Jang, Jaeha Hwang, Seokhun Jin, Kenji Watanabe, Takashi Taniguchi, Kayoung Lee   +11 more
wiley   +1 more source

Deterministic Writing of Field‐Free and Unipolar Spin‐Transfer Torque Magnetic Random‐Access Memory

Advanced Functional Materials, EarlyView.
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, Ching Shih, Guan‐Long Chen, Yu‐Chen Hsin, Chen‐Yu Yang, Hsin‐Han Lee, Kuan‐Ming Chen, Yu‐Ho Kao, Tsai‐Yu Wu, Chiao‐Yun Lo, Sin‐You Huang, Cheng‐Yi Shih, Shan‐Yi Yang, I‐Jung Wang, Yao‐Jen Chang, Shih‐Ching Chiu, Yi‐Hui Su, Chih‐Yao Wang, Jeng‐Hua Wei, Shyh‐Shyuan Sheu, Wei‐Chung Lo, Shih‐Chieh Chang, Tuo‐Hung Hou   +22 more
wiley   +1 more source

Parallel defeasible argumentation

Journal of Computer Science and Technology, 2000
Implicitly exploitable parallelism for Logic Programming has received ample attention. Defeasible Argutmentation is specially apt for this optimizing technique.
Alejandro Javier García, Guillermo Ricardo Simari   +1 more
doaj