Research on Universal Model of Speech Perceptual Hashing Authentication System in Mobile Environment

Author(s):  
Qiu-Yu Zhang ◽  
Wen-Jin Hu ◽  
Yi-Bo Huang ◽  
Si-Bin Qiao
2006 ◽  
Vol 65 (5) ◽  
pp. 427-439
Author(s):  
O. N. Katkov ◽  
V. A. Pimenov ◽  
A. P. Ryzhkov

Author(s):  
Markus Krötzsch

To reason with existential rules (a.k.a. tuple-generating dependencies), one often computes universal models. Among the many such models of different structure and cardinality, the core is arguably the “best”. Especially for finitely satisfiable theories, where the core is the unique smallest universal model, it has advantages in query answering, non-monotonic reasoning, and data exchange. Unfortunately, computing cores is difficult and not supported by most reasoners. We therefore propose ways of computing cores using practically implemented methods from rule reasoning and answer set programming. Our focus is on cases where the standard chase algorithm produces a core. We characterise this desirable situation in general terms that apply to a large class of cores, derive concrete approaches for decidable special cases, and generalise these approaches to non-monotonic extensions of existential rules.


2019 ◽  
Vol 7 (6) ◽  
pp. 633-635
Author(s):  
Payal . ◽  
Suman Sangwan ◽  
Arun Malik

2015 ◽  
Vol 4 (1) ◽  
pp. 33-38 ◽  
Author(s):  
Syeatha Merlin Thampy ◽  
Alphonsa Johny

2018 ◽  
Vol 6 (3) ◽  
pp. 1
Author(s):  
OMOROGIUWA O. S. ◽  
AZIKEN G. O. ◽  
◽  

2009 ◽  
Vol 28 (10) ◽  
pp. 2544-2547
Author(s):  
Li-sheng CHEN ◽  
Hai-bin GUO ◽  
Fei-yue YE

Sign in / Sign up

Export Citation Format

Share Document