Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
Procedural reasoning system
Known as:
PRS
In artificial intelligence, a procedural reasoning system (PRS) is a framework for constructing real-time reasoning systems that can perform complex…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
AgentSpeak
Amy L. Lansky
Artificial intelligence
Australian Artificial Intelligence Institute
Expand
Broader (1)
Cognitive architecture
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Reduction target structure-based hierarchical attribute reduction for two-category decision-theoretic rough sets
Xianyong Zhang
,
Duoqian Miao
Information Sciences
2014
Corpus ID: 205459909
2014
2014
Secured cooperative cognitive radio networks with relay selection
T. Duong
,
Tran Trung Duy
,
M. Elkashlan
,
N. Tran
,
O. Dobre
IEEE Global Communications Conference
2014
Corpus ID: 18722136
In this paper, we propose physical layer security for cooperative cognitive radio networks (CCRNs) with relay selection in the…
Expand
2011
2011
Feedback Cancellation for T-DMB Repeaters Based on Frequency-Domain Channel Estimation
Young-Jun Lee
,
Ji-Bong Lee
,
S. Park
,
Yong-Tae Lee
,
H. Kim
,
Hyoung-Nam Kim
IEEE transactions on broadcasting
2011
Corpus ID: 8140909
This paper presents a novel feedback canceller for a terrestrial digital multimedia broadcasting (T-DMB) on-channel repeater (OCR…
Expand
2010
2010
A Modified Pole-Zero Technique for the Synthesis of Waveguide Leaky-Wave Antennas Loaded With Dipole-Based FSS
M. García-Vigueras
,
J. Gómez-Tornero
,
G. Goussetis
,
J. S. Gómez-Díaz
,
Alejandro Álvarez Melcón
IEEE Transactions on Antennas and Propagation
2010
Corpus ID: 19946572
An extension of the pole-zero matching method proposed by Stefano Maci for the analysis of electromagnetic bandgap (EBG…
Expand
2009
2009
Computations modulo regular chains
Xin Li
,
M. M. Maza
,
Wei Pan
International Symposium on Symbolic and Algebraic…
2009
Corpus ID: 14666322
The computation of triangular decompositions involve two fundamental operations: polynomial GCDs modulo regular chains and…
Expand
2009
2009
Starvation resistance and metabolic response to food deprivation and recovery feeding in Fenneropenaeus chinensis juveniles
Pei-dong Zhang
,
Xiumei Zhang
,
Jian Li
,
T. Gao
Aquaculture International
2009
Corpus ID: 35370153
Starvation resistance in the juveniles of Chinese shrimp, Fenneropenaeus chinensis Osbeck, was studied by point-of-no-return (PNR…
Expand
2007
2007
Political Space, Pro-Poor Growth and Poverty Reduction Strategy in Honduras
J. Cuesta
2007
Corpus ID: 55710989
This paper assesses the political and socio-economic consequences of the Poverty Reduction Strategy (PRS) in Honduras. The…
Expand
2000
2000
Loop Based Detection of Isomorphism Among Chains, Inversions and Type of Freedom in Multi Degree of Freedom Chain
W. Kim
,
Byung-Ju Yi
,
+23 authors
Eugene Hundertmark
2000
Corpus ID: 122879092
Structural synthesis of kinematic chains usually involves the creation of a complete list of kinematic chains, followed by a…
Expand
1999
1999
Photon recycling semiconductor light emitting diode
Xiaoyun Guo
,
J. Graff
,
E. F. Schubert
,
R. Karlicek
International Electron Devices Meeting…
1999
Corpus ID: 6033057
A new white light emitting diode, the photon recycling semiconductor light emitting diode (PRS-LED) is demonstrated. The device…
Expand
Highly Cited
1987
Highly Cited
1987
Crosslink architectures for a multiple satellite system
R. Binder
,
S. Huffman
,
I. Gurantz
,
P. Vena
Proceedings of the IEEE
1987
Corpus ID: 2123696
Several candidate crosslink communications architectures are described for a packet-switched, low-altitude, multiple satellite…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE