![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Artificial Intelligence, Volume 69
Volume 69, Numbers 1-2, August 1994
- Alberto M. Segre, Charles Elkan:
A High-Performance Explanation-Based Learning Algorithm. 1-50 - Feng Zhao:
Extracting and Representing Qualitative Behaviors of Complex Systems in Phase Space. 51-92 - Alan M. Frisch
, Peter Haddawy:
Anytime Deduction for Probabilistic Logic. 93-122 - Giorgio Satta
, Oliviero Stock:
Bidirectional Context-Free Grammar Parsing for Natural Language Processing. 123-164 - Tom Bylander:
The Computational Complexity of Propositional STRIPS Planning. 165-204 - Shie-Jue Lee, David A. Plaisted:
Problem Solving by Searching for Models with a Theorem Prover. 205-233 - Subbarao Kambhampati:
Multi-Contributor Causal Structures for Planning: A Formalization and Evaluation. 235-278 - Hussein Almuallim, Thomas G. Dietterich:
Learning Boolean Concepts in the Presence of Many Irrelevant Features. 279-305 - Simon Kasif, Arthur L. Delcher:
Local Consistency in Parallel Constraint Satisfaction Networks. 307-327
- Georg Gottlob
, Mingyi Zhang:
Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity. 329-345 - Christos H. Papadimitriou, Martha Sideri:
Default Theories that Always Have Extensions. 347-357 - Tad Hogg, Colin P. Williams:
The Hardest Constraint Problems: A Double Phase Transition. 359-377 - G. Neelakantan Kartha:
Two Counterexamples Related to Baker's Approach to the Frame Problem. 379-391 - Gunther Sablon, Luc De Raedt
, Maurice Bruynooghe:
Iterative Versionspaces. 393-409
![](https://dblp.org/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.