Aarhus University Seal / Aarhus Universitets segl

Danish

You are here: AU » About Aarhus University » Organisation » Determining lower and upper bounds on probabilities of at...

About Aarhus University

Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

Standard

Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs. / Andersen, Kim Allan; Hooker, John N.

In: Annals of Operations Research, Vol. 65, 1996, p. 1-20.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

Harvard

Andersen, KA & Hooker, JN 1996, 'Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs', Annals of Operations Research, vol. 65, pp. 1-20.

APA

Andersen, K. A., & Hooker, J. N. (1996). Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs. Annals of Operations Research, 65, 1-20.

CBE

Andersen KA, Hooker JN. 1996. Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs. Annals of Operations Research. 65:1-20.

MLA

Andersen, Kim Allan and John N. Hooker. "Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs". Annals of Operations Research. 1996, 65. 1-20.

Vancouver

Andersen KA, Hooker JN. Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs. Annals of Operations Research. 1996;65:1-20.

Author

Andersen, Kim Allan ; Hooker, John N. / Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs. In: Annals of Operations Research. 1996 ; Vol. 65. pp. 1-20.

Bibtex

@article{3c9d49a0b8c511daad69000ea68e967b,
title = "Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs",
author = "Andersen, {Kim Allan} and Hooker, {John N.}",
year = "1996",
language = "English",
volume = "65",
pages = "1--20",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer New York LLC",

}

RIS

TY - JOUR

T1 - Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs

AU - Andersen, Kim Allan

AU - Hooker, John N.

PY - 1996

Y1 - 1996

M3 - Journal article

VL - 65

SP - 1

EP - 20

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

ER -