Отображение 1,971 - 1,980 результаты of 2,262 для поиска '"Logic"', время запроса: 0.02сек. Отмена результатов
  1. 1971

    Software verification and validation with destiny a parallel approach to automated theorem proving. по Dykstra, Josiah

    Опубликовано в: Crossroads : the ACM student magazine.
    Статья

    Software verification and validation with destiny a parallel approach to automated theorem proving.
  2. 1972

    Relational expressive power of constraint query languages. по Benedikt, Michael

    Опубликовано в: Journal of the ACM
    Статья

    Relational expressive power of constraint query languages.
  3. 1973

    Implementing sequentially consistent shared objects using broadcast and point-to-point communication. по Fekete, Alan

    Опубликовано в: Journal of the ACM
    Статья

    Implementing sequentially consistent shared objects using broadcast and point-to-point communication.
  4. 1974

    Probabilistic checking of proofs a new characterization of NP. по Arora, Sanjeev

    Опубликовано в: Journal of the ACM
    Статья

    Probabilistic checking of proofs a new characterization of NP.
  5. 1975

    Theory of neuromata. по íma, Jiří

    Опубликовано в: Journal of the ACM
    Статья

    Theory of neuromata.
  6. 1976

    Corrigendum Reasoning about knowledge and probability?. по Fagin, Ronald

    Опубликовано в: Journal of the ACM
    Статья

    Corrigendum Reasoning about knowledge and probability?.
  7. 1977

    Software reliability via run-time result-checking. по Wasserman, Hal

    Опубликовано в: Journal of the ACM
    Статья

    Software reliability via run-time result-checking.
  8. 1978

    Compositional refinement of interactive systems. по Broy, Manfred

    Опубликовано в: Journal of the ACM
    Статья

    Compositional refinement of interactive systems.
  9. 1979

    Applications of a logic of knowledge to motion planning under uncertainty. по Brafman, Ronen I.

    Опубликовано в: Journal of the ACM
    Статья

    Applications of a logic of knowledge to motion planning under uncertainty.
  10. 1980

    Satisfiability of word equations with constants is in PSPACE. по Plandowski, Wojciech

    Опубликовано в: Journal of the ACM
    Статья

    Satisfiability of word equations with constants is in PSPACE.

Инструменты поиска: