Concurrent Metareasoning

@article{Pourazin2006ConcurrentM,
  title={Concurrent Metareasoning},
  author={Shahriar Pourazin and A. A. Barforoush},
  journal={The Journal of Supercomputing},
  year={2006},
  volume={35},
  pages={51-64}
}
  • Shahriar Pourazin, A. A. Barforoush
  • Published 2006
  • Computer Science
  • The Journal of Supercomputing
  • Metaresoning is again under focus in the AI community. Here in this paper, a new classification for types of metareasoning has been proposed. In recent years, only the ones that are here named as pre-metareasoning and para-metareasoning have been studied. The first one is for predicting the best computation path for having better performance programs. The second, mostly known as interruptible anytime algorithm, is to limit the computation time externally when the approximate answer is better… CONTINUE READING
    1 Citations

    Figures and Topics from this paper

    References

    SHOWING 1-10 OF 56 REFERENCES
    Principles of Metareasoning
    • 363
    • PDF
    FLENG : THE FLEXIBLE INFERENCE ENGINE
    • 1
    Elf: a language for logic definition and verified metaprogramming
    • F. Pfenning
    • Mathematics, Computer Science
    • [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
    • 1989
    • 166
    • PDF
    Functional representation and reasoning for reflective systems
    • 69
    Reflection and semantics in LISP
    • 547
    • PDF
    FreshML: programming with binders made simple
    • 184
    • PDF
    Logic Program Synthesis and Transformation — Meta-Programming in Logic
    • 41
    The Future of Knowledge Representation
    • 54
    Introspective Metatheoretic Reasoning
    • 20