


default search action
Computational Intelligence, Volume 11
Volume 11, 1995
- Eric Neufeld:

Simpson's Paradox in Artificial Intelligence and in Real Life. 1-10 - Laura Giordano

, Alberto Martelli:
A Logical Characterization for Truth Maintenance Systems with Dependency-Directed Backtracking. 11-46 - James P. Delgrande:

A Framework for Logics of Explicit Belief. 47-88 - José Alberto Fernández, Jack Minker, Adnan H. Yahya:

Computing Perfect and Stable Model Using Ordered Model Trees. 89-112 - Paul J. Krause, Simon Ambler, Morten Elvang-Gøransson, John Fox:

A Logic of Argumentation for Reasoning under Uncertainty. 113-131 - Sarit Kraus, Daniel Lehmann:

Designing and Building a Negotiating Automated Agent. 132-171 - Timothy K. Shih, Nam Ling, Ruth E. Davis, Fuyau Lin:

On the Construction of a Prolog-Based Verifier for Systolic Array Designs. 172-221 - Wojciech Ziarko:

Introduction to the Special Issue on Rough Sets and Knowledge Discovery. 223-226 - Theresa Beaubouef, Frederick E. Petry, Bill P. Buckles:

Extension of the Relational Database and its Algebra with Rough Set Techniques. 233-245 - Robert Godin, Rokia Missaoui, Hassan Alaoui:

Incremental Concept Formation Algorithms Based on Galois (Concept) Lattices. 246-267 - Dobroslawa M. Grzymala-Busse, Jerzy W. Grzymala-Busse:

The Usefulness of a Machine Learning Approach to Knowledge Acquisition. 268-279 - Zdzislaw Pawlak:

Vagueness and Uncertainty: A Rough Set Perspective. 277-232 - Howard J. Hamilton, David R. Fudger:

Estimating DBLEARN's Potential for Knowledge Discovery in Databases. 280-296 - Michel Herment, Ewa Orlowska

:
Handling Information Logics in a Graphical Proof Editor. 297-322 - Xiaohua Hu, Nick Cercone:

Learning in Relational Databases: A Rough Set Approach. 323-338 - Jacek Jelonek, Krzysztof Krawiec

, Roman Slowinski
:
Rough Set Reduction of Attributes and their Domains for Neural Networks. 339-347 - Leszek Plonka, Adam Mrózek:

Rule-Based Stabilization of the Inverted Pendulum. 348-356 - Ning Shan, Wojciech Ziarko:

Data-Based Acqusition and Incremental Modification of Classification Rules. 357-370 - Andrzej Skowron

:
Extracting Laws from Decision Tables: A Rough Set Approach. 371-388 - Shusaku Tsumoto, Hiroshi Tanaka:

PRIMEROSE: Probabilistic Rule Induction Method based on Rough Sets and Resampling Methods. 389-405 - S. K. Michael Wong, Lusheng Wang, Yiyu Yao

:
On Modeling Uncertainty with Interval Structures. 406-426 - Yang Xiang, S. K. Michael Wong, Nick Cercone:

Quantification of Unvertainty in Classification Rules Discovered from Databases. 427-441 - Alfonso Gerevini

, Lenhart K. Schubert:
On Computing the Minimal Labels in Time Point Algebra Networks. 443-448 - Paul Snow:

An Intuitive Motivation of Bayesian Belief Models. 449-459 - Andrew R. Haas:

An Epistemic Logic with Quantification over Names. 460-497 - Runping Qi, David L. Poole:

A New Method for Influence Diagram Evaluation. 498-528 - Paolo Terenziani

, Pietro Torasso:
Time, Action-Types, Causation: An Integrated Analysis. 529-552 - Robin Hirsch

:
Intractability in the Allen and Koomen Planner. 553-564 - Sunil Cherian, Wade Troxell:

Intelligent Behavior in Machines Emerging from a Collection of Interactive Control Structures. 565-592 - Andrew R. Haas:

Planning to Find the Referents of Noun Phrases. 593-624 - Christer Bäckström, Bernhard Nebel

:
Complexity Results for SAS+ Planning. 625-656

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID







last updated on 2026-07-04 00:27 CEST by the 







