Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,549 papers from all fields of science
Search
Sign In
Create Free Account
Non-monotonic logic
Known as:
Non-monotonic reasoning
, Nonmonotonic logic
, Nonmonotonic reasoning
A non-monotonic logic is a formal logic whose consequence relation is not monotonic. In other words, non-monotonic logics are devised to capture and…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
32 relations
Abductive reasoning
Answer set programming
Araucaria
Artificial intelligence
Expand
Broader (1)
Belief revision
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Poster: towards attribute based group key management
Mohamed Nabeel
,
E. Bertino
Conference on Computer and Communications…
2011
Corpus ID: 7333118
Attribute based systems enable fine-grained access control among a group of users each identified by a set of attributes. Secure…
Expand
2011
2011
Worst-case temperature analysis for real-time systems
Devendra Rai
,
Hoeseok Yang
,
Iuliana Bacivarov
,
Jian-Jia Chen
,
L. Thiele
Design, Automation and Test in Europe
2011
Corpus ID: 13258002
With the evolution of today's semiconductor technology, chip temperature increases rapidly mainly due to the growth in power…
Expand
Review
2010
Review
2010
Low latency and energy efficient routing protocols for wireless sensor networks
D. Baghyalakshmi
,
J. Ebenezer
,
S. Satyamurty
International Conference on Wireless…
2010
Corpus ID: 18822575
Wireless sensor network (WSN) consists of tiny sensor nodes with sensing, computation and wireless communication capabilities…
Expand
2007
2007
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
Azzurra Ragone
,
T. D. Noia
,
E. Sciascio
,
F. Donini
,
Simona Colucci
,
Francesco Colasuonno
International Journal of Web Services Research
2007
Corpus ID: 16915379
We propose a framework and tractable algorithms for semantic-based automated Web service composition, fully compliant with…
Expand
Highly Cited
2006
Highly Cited
2006
Mobility and threshold-voltage comparison between [110]- and (100)-oriented ultrathin-body silicon MOSFETs
Gen Tsutsui
,
T. Hiramoto
IEEE Transactions on Electron Devices
2006
Corpus ID: 31348144
Mobility and threshold-voltage (Vth) behaviour in (110) and (100) ultrathin body (UTB) n- and p-MOSFETs are experimentally…
Expand
Highly Cited
1999
Highly Cited
1999
Numerical methods for reactive transport on rectangular and streamline-oriented grids
O. Cirpka
,
E. Frind
,
R. Helmig
1999
Corpus ID: 2228273
Highly Cited
1998
Highly Cited
1998
An efficient RMS admission control and its application to multiprocessor scheduling
Sylvain Lauzac
,
R. Melhem
,
D. Mossé
Proceedings of the First Merged International…
1998
Corpus ID: 820062
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks…
Expand
Highly Cited
1990
Highly Cited
1990
Three-valued formalization of logic programming: is it needed?
Jia-Huai You
,
Li-Yan Yuan
ACM SIGACT-SIGMOD-SIGART Symposium on Principles…
1990
Corpus ID: 15339662
The central issue of this paper concerns the truth value undefined in Przymusinsi's 3-valued formalization of nonmonotonic…
Expand
Highly Cited
1983
Highly Cited
1983
On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
E. Polak
,
D. Mayne
,
Y. Wardi
1983
Corpus ID: 53073809
This paper presents three general schemes for extending differentiable optimization algorithms to nondifferentiable problems. It…
Expand
Highly Cited
1975
Highly Cited
1975
Fourier transform carbon-13 nuclear magnetic resonance study of Group VIB transition metal carbonyl complexes
G. Bodner
1975
Corpus ID: 101444333
13C h M R spectra have been obtained for a series of LnM(C0)6-n derivatives, (n = 0 , 1. 2; M = Cr, Mo, W; L = CO, PC13, P(OPh)3…
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