메뉴 건너뛰기




Volumn 12, Issue 4, 1996, Pages 541-565

Computation of best bounds of probabilities from uncertain data

Author keywords

Linear programming; Uncertain reasoning

Indexed keywords

BOUNDARY VALUE PROBLEMS; COMPUTATIONAL METHODS; FORMAL LOGIC; LINEAR PROGRAMMING; PROBLEM SOLVING;

EID: 0030284785     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-8640.1996.tb00276.x     Document Type: Article
Times cited : (11)

References (35)
  • 1
    • 0000447723 scopus 로고
    • On the uncertainties transmitted from promises to conclusions in deductive inferences
    • ADAMS, E. W., and LEVINE, H. F. 1975. On the uncertainties transmitted from promises to conclusions in deductive inferences. Synthese, 30:429-460.
    • (1975) Synthese , vol.30 , pp. 429-460
    • Adams, E.W.1    Levine, H.F.2
  • 3
  • 4
    • 0042692397 scopus 로고
    • Inductive proof of the Simplex method
    • DANTZIG, G. B. 1960. Inductive proof of the Simplex method. IBM, Journal of Res. Development, 4(5):500-506.
    • (1960) IBM, Journal of Res. Development , vol.4 , Issue.5 , pp. 500-506
    • Dantzig, G.B.1
  • 5
    • 5844422663 scopus 로고
    • An efficient evaluation strategy for non-Horn deductive database
    • DEMOLOMBE, R. 1989. An efficient evaluation strategy for non-Horn deductive database. In Proceedings of IFIP.
    • (1989) Proceedings of IFIP
    • Demolombe, R.1
  • 12
    • 84976840781 scopus 로고
    • New direction for uncertainty reasoning in deductive databases
    • Boston, MA
    • GÜNTZER, U., KIESSLING, W., and THÖNE, H. 1991. New direction for uncertainty reasoning in deductive databases. In Proceedings of the ACM SIGMOD, Boston, MA, Vol. 21, pp. 178-187.
    • (1991) Proceedings of the ACM SIGMOD , vol.21 , pp. 178-187
    • Güntzer, U.1    Kiessling, W.2    Thöne, H.3
  • 13
    • 0001139257 scopus 로고
    • Best possible inequalities for the probability of a logical function of events
    • HAILPERIN, T. 1965. Best possible inequalities for the probability of a logical function of events. American Mathematical Monthly, 72:343-359.
    • (1965) American Mathematical Monthly , vol.72 , pp. 343-359
    • Hailperin, T.1
  • 16
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • KARMARKAR, N. 1984. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 17
    • 5844399639 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • Boston
    • KARMARKAR, N. 1985. A new polynomial-time algorithm for linear programming, Presented at the ORSA/TIMS Meeting, Boston.
    • (1985) ORSA/TIMS Meeting
    • Karmarkar, N.1
  • 19
    • 0025591386 scopus 로고
    • Expert database systems: Knowledge/data management environments for intelligent information systems
    • KERSCHBERG, L. 1990. Expert database systems: knowledge/data management environments for intelligent information systems. Information Systems, 15(1):151-160.
    • (1990) Information Systems , vol.15 , Issue.1 , pp. 151-160
    • Kerschberg, L.1
  • 26
    • 0027575760 scopus 로고    scopus 로고
    • A semantical framework for supporting subjective and conditional probabilities in deductive databases
    • To appear
    • NG, R., and SUBRAHMANIAN, V. S. To appear. A semantical framework for supporting subjective and conditional probabilities in deductive databases. Journal of Automated Reasoning.
    • Journal of Automated Reasoning
    • Ng, R.1    Subrahmanian, V.S.2
  • 32
  • 34
    • 77956972419 scopus 로고
    • Probabilistic inference and the concept of total evidence
    • SUPPES, P. 1966. Probabilistic inference and the concept of total evidence. Aspects of Inductive Logic. pp. 49-65.
    • (1966) Aspects of Inductive Logic , pp. 49-65
    • Suppes, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.