• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

An SE-tree-based Prime Implicant Generation Algorithm (1994)

by R Rymon
Venue:IEEE Trans
Add To MetaCart

Tools

Sorted by:
Results 1 - 4 of 4

Better reasoning about software engineering activities

by Tim Menzies - Proceedings 16 th International Conference on Automated Software Engineering , 2001
"... Software management oracles often contain numerous subjective features. At each subjective point, a range of behaviors is possible. Stochastic simulation samples a subset of the possible behaviors. After many such stochastic simulations, the TAR2 treatment learner can find control actions that have ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Software management oracles often contain numerous subjective features. At each subjective point, a range of behaviors is possible. Stochastic simulation samples a subset of the possible behaviors. After many such stochastic simulations, the TAR2 treatment learner can find control actions that have (usually) the same impact despite the subjectivity of the oracle. 1.

Random Search of AND-OR Graphs Representing Finite–State Models

by Tim Menzies, David Owen - In Proceedings of the First International Workshop on Model-based Requirements Engineering, 2001. Available fromhttp://menzies.us/pdf/01randandor.pdf , 2002
"... ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
Abstract not found

On Kernel Rules and Prime Implicants

by Ron Rymon - In Proc. of the Twelfth Nat'l Conf. on Artificial Intelligence , 1994
"... We draw a simple correspondence between kernel rules and prime implicants. Kernel (minimal) rules play an important role in many induction techniques. Prime implicants were previously used to formally model many other problem domains, including Boolean circuit minimization and such classical AI prob ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
We draw a simple correspondence between kernel rules and prime implicants. Kernel (minimal) rules play an important role in many induction techniques. Prime implicants were previously used to formally model many other problem domains, including Boolean circuit minimization and such classical AI problems as diagnosis, truth maintenance and circumscription. This correspondence allows computing kernel rules using any of a number of prime implicant generation algorithms. It also leads us to an algorithm in which learning is boosted by an auxiliary domain theory, e.g., a set of rules provided by an expert, or a functional description of a device or system; we discuss this algorithm in the context of SE-tree-based generation of prime implicants. Introduction Rules have always played an important role in Artificial Intelligence (AI). In machine learning, while a variety of other representations have also been used, a great deal of research has focused on rule induction. Moreover, many of the...

Verification and validation and artificial intelligence

by Tim Menzies, Charles Pecheur - Advances in Computers , 2005
"... Artifical Intelligence (AI) is useful. AI can deliver more functionality for reduced cost. AI should be used more widely but won’t be unless developers can trust adapative, nondeterministic, or complex AI systems. Verification and validation is one method used by software analysts to gain that trust ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Artifical Intelligence (AI) is useful. AI can deliver more functionality for reduced cost. AI should be used more widely but won’t be unless developers can trust adapative, nondeterministic, or complex AI systems. Verification and validation is one method used by software analysts to gain that trust. AI systems have features that make them hard to check using conventional V&V methods. Nevertheless, as we show in this article, there are enough alternative readily-available methods that enable the V&V of AI software.
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University