|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
CLARKE, M. R. B., AND GABBAY, D.M. An intuitionistic basis for non-monotonic reasoning. In P. Smets, E. H. Mamduni, D. Dubois, and H. Prade, eds. Non-Standard Logics for Automated Reasoning. Academic Press, San Diego, Calif., 1988, pp. 163-178.
|
| |
2
|
|
| |
3
|
|
| |
4
|
HUGHES, G. E., AND CRESSWELL, M.J. An Introduction to Modal Logic. Methuen and Co., London, England, 1972.
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
KRWK~, S. A A completeness theorem in modal logic, J. Symb Logic 24 (1959), 1-14.
|
| |
9
|
KRIPKE, S.A.Semantical analysis of modal logic. I. Normal proposmonal calcuh. Z Math. Logik Grund.Math. 9 (1963), 67-96.
|
| |
10
|
KRIPKE, S.A. Necessity and identity. In S. P Schwartz, ed. Naming, Necessity, and Natural Kinds. Cornell Umverslty Press, Ithaca, N.Y., 1977, pp. 66-10I.
|
| |
11
|
KRIPKE, S, A. Naming and Necessity. Harvard University Press, Cambridge, Mass., 1980.
|
| |
12
|
LEHMANN, D Preferential models and cumulaUve logic. In E. Shapiro, ed. Proceedings of the 5th Israeli Symposium on Artificial Intelligence. Information Processing Association of Israel, Tel Avav, 1988, pp 365-381.
|
| |
13
|
|
| |
14
|
MCCARTHY, J. Circumscription--A form of non-monotonic reasoning. Artif Int. 13 (1980), 27-39.
|
| |
15
|
MCDERMOTT, D., AND DOYLE, J. Non-monotonic logic I. Arnf. Int. 13 (1980), 41-72.
|
 |
16
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
RE~TER, R, A logic for default reasoning. Artif. Int 13 (1980), 81-132
|
| |
21
|
ZARNECKA-BIaLY, E. A. note on deduction theorem for G6del's propositional calculus G4 Stud. Log. XXIII (I968), 35-40.
|
| |
22
|
|
REVIEW
"Doris C. Appleby : Reviewer"
The authors deal with logical extensions to the predicate calculus
(PC), the modal system first formalized in 1932 by C. I. Lewis [1]. They
consider McDermott logics [2], but the notions go back to Aristotle, who
used four modal operators: nec
more...
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|