A Computationally Tractable Nonmonotonic Logic.

@article{DBLP:journals/tkde/WeigertT94,
  author    = {Thomas J. Weigert and
               Jeffrey J. P. Tsai},
  title     = {A Computationally Tractable Nonmonotonic Logic},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {6},
  number    = {1},
  year      = {1994},
  pages     = {57-63},
  ee        = {db/journals/tkde/WeigertT94.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1994 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Krzysztof R. Apt, Maarten H. van Emden: Contributions to the Theory of Logic Programming. J. ACM 29(3): 841-862(1982)

[2]

...

[3]

Keith L. Clark: Negation as Failure. Logic and Data Bases 1977: 293-322

[4]

Martin Davis: The Mathematics of Non-Monotonic Reasoning. Artif. Intell. 13(1-2): 73-80(1980)

[5]

David W. Etherington, Raymond Reiter: On Inheritance Hierarchies With Exceptions. AAAI 1983: 104-108

[6]

David W. Etherington: More on Inheritance Hierarchies with Exceptions: Default Theories and Inferential Distance. AAAI 1987: 352-357

[7]

David W. Etherington: Formalizing Nonmonotonic Reasoning Systems. Artif. Intell. 31(1): 41-85(1987)

[8]

Michael Gelfond, Vladimir Lifschitz: Compiling Circumscriptive Theories into Logic Programs. NMR 1988: 74-99

[9]

...

[10]

...

[11]

John F. Horty, Richmond H. Thomason, David S. Touretzky: A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks. AAAI 1987: 358-363

[12]

Jean-Louis Lassez, Michael J. Maher: Closures and Fairness in the Semantics of Programming Logic. Theor. Comput. Sci. 29: 167-184(1984)

[13]

Vladimir Lifschitz: Computing Circumscription. IJCAI 1985: 121-127

[14]

...

[15]

John W. Lloyd: Foundations of Logic Programming, 1st Edition. Springer 1984, ISBN 3-540-13299-6

[16]

...

[17]

John McCarthy: Circumscription - A Form of Non-Monotonic Reasoning. Artif. Intell. 13(1-2): 27-39(1980)

[18]

John McCarthy: Applications of Circumscription to Formalizing Common-Sense Knowledge. Artif. Intell. 28(1): 89-116(1986)

[19]

Drew V. McDermott, Jon Doyle: Non-Monotonic Logic I. Artif. Intell. 13(1-2): 41-72(1980)

[20]

Drew V. McDermott: Nonmonotonic Logic II: Nonmonotonic Modal Theories. J. ACM 29(1): 33-57(1982)

[21]

Robert C. Moore: Semantical Considerations on Nonmonotonic Logic. Artif. Intell. 25(1): 75-94(1985)

[22]

Raymond Reiter: A Logic for Default Reasoning. Artif. Intell. 13(1-2): 81-132(1980)

[23]

Raymond Reiter: Circumscription Implies Predicate Completion (Sometimes). AAAI 1982: 418-420

[24]

Yoav Shoham: A Semantical Approach to Nonmonotic Logics. LICS 1987: 275-279

[25]

...

[26]

Jeffrey J. P. Tsai, Thomas J. Weigert, Hung-Chin Jang: A Hybrid Knowledge Representation as a Basis of Requirement Specification and Specification Analysis. IEEE Trans. Software Eng. 18(12): 1076-1100(1992)

[27]

...

[28]

...

[29]

...

[30]

...