![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Artificial Intelligence, Volume 49
Volume 49, Numbers 1-3, 1991
- Ronald J. Brachman, Hector J. Levesque, Raymond Reiter:
Introduction to the Special Volume on Knowledge Representation. 1-3 - Andrew B. Baker:
Nonmonotonic Reasoning in the Framework of Situation Calculus. 5-23 - Tom Bylander, Dean Allemang, Michael C. Tanner, John R. Josephson:
The Computational Complexity of Abduction. 25-60 - Rina Dechter, Itay Meiri, Judea Pearl:
Temporal Constraint Networks. 61-95 - Jon Doyle
, Michael P. Wellman
:
Impediments to Universal Preference-Based Default Theories. 97-128 - Oren Etzioni:
Embedding Decision-Analytic Control in a Learning Architecture. 129-159 - Alan M. Frisch
:
The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning. 161-198 - Graeme Hirst:
Existence Assumptions in Knowledge Representation. 199-242 - Henry A. Kautz
, Bart Selman:
Hard Problems for Simple Default Logics. 243-279 - David Poole:
The Effect of Knowledge on Belief: Conditioning, Specificity and the Lottery Paradox in Default Reasoning. 281-307 - Teodor C. Przymusinski:
Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs. 309-343 - Manny Rayner:
On the Applicability of Nonmonotonic Logic to Formal Reasoning in Continuous Time. 345-360 - Stuart Russell, Eric Wefald:
Principles of Metareasoning. 361-395
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.