메뉴 건너뛰기




Volumn 5291 LNAI, Issue , 2008, Pages 386-400

Measuring the ignorance and degree of satisfaction for answering queries in imprecise probabilistic logic programs

Author keywords

[No Author keywords available]

Indexed keywords

ANSWERING QUERIES; DEGREE OF SATISFACTION; MAXIMUM ENTROPY PRINCIPLE; PRIORI KNOWLEDGE; PROBABILISTIC LOGIC PROGRAMS; SECOND ORDERS;

EID: 77049086605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87993-0_30     Document Type: Conference Paper
Times cited : (10)

References (16)
  • 1
    • 2942639704 scopus 로고    scopus 로고
    • Combining probabilistic logic programming with the power of maximum entropy
    • Kern-Isberner, G., Lukasiewicz, T.: Combining probabilistic logic programming with the power of maximum entropy. Artificial Intelligence 157(1-2), 139-202 (2004)
    • (2004) Artificial Intelligence , vol.157 , Issue.1-2 , pp. 139-202
    • Kern-Isberner, G.1    Lukasiewicz, T.2
  • 2
    • 77049087479 scopus 로고    scopus 로고
    • Lukasiewicz, T.: Probabilistic logic programming. In: ECAI, pp. 388-392 (1998)
    • Lukasiewicz, T.: Probabilistic logic programming. In: ECAI, pp. 388-392 (1998)
  • 3
    • 0010842519 scopus 로고    scopus 로고
    • Probabilistic logic programming with conditional constraints
    • Lukasiewicz, T.: Probabilistic logic programming with conditional constraints. ACM Trans. Comput. Log. 2(3), 289-339 (2001)
    • (2001) ACM Trans. Comput. Log , vol.2 , Issue.3 , pp. 289-339
    • Lukasiewicz, T.1
  • 5
    • 77049092676 scopus 로고    scopus 로고
    • Costa, V.S., Page, D., Qazi, M., Cussens, J.: CLP(BN): Constraint logic programming for probabilistic knowledge. In: UAI, pp. 517-524 (2003)
    • Costa, V.S., Page, D., Qazi, M., Cussens, J.: CLP(BN): Constraint logic programming for probabilistic knowledge. In: UAI, pp. 517-524 (2003)
  • 6
    • 9444264710 scopus 로고    scopus 로고
    • Probabilistic reasoning with answer sets
    • Lifschitz, V, Niemelä, I, eds, LPNMR 2004, Springer, Heidelberg
    • Baral, C., Gelfond, M., Rushton, J.N.: Probabilistic reasoning with answer sets. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 21-33. Springer, Heidelberg (2003)
    • (2003) LNCS (LNAI , vol.2923 , pp. 21-33
    • Baral, C.1    Gelfond, M.2    Rushton, J.N.3
  • 7
    • 84880896814 scopus 로고    scopus 로고
    • Using the probabilistic logic programming language p-log for causal and counterfactual reasoning and non-naive conditioning
    • Baral, C., Hunsaker,M.: Using the probabilistic logic programming language p-log for causal and counterfactual reasoning and non-naive conditioning. In: IJCAI, pp. 243-249 (2007)
    • (2007) IJCAI , pp. 243-249
    • Baral, C.1    Hunsaker, M.2
  • 9
    • 84880905111 scopus 로고    scopus 로고
    • Problog: A probabilistic prolog and its application in link discovery
    • Raedt, L.D., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: IJCAI, pp. 2462-2467 (2007)
    • (2007) IJCAI , pp. 2462-2467
    • Raedt, L.D.1    Kimmig, A.2    Toivonen, H.3
  • 10
    • 0033878293 scopus 로고    scopus 로고
    • Probabilistic datalog: Implementing logical information retrieval for advanced applications
    • Fuhr, N.: Probabilistic datalog: Implementing logical information retrieval for advanced applications. JASIS 51(2), 95-110 (2000)
    • (2000) JASIS , vol.51 , Issue.2 , pp. 95-110
    • Fuhr, N.1
  • 11
    • 35048852527 scopus 로고    scopus 로고
    • Dekhtyar, A., Dekhtyar, M.I.: Possible worlds semantics for probabilistic logic programs. In: ICLP, pp. 137-148 (2004)
    • Dekhtyar, A., Dekhtyar, M.I.: Possible worlds semantics for probabilistic logic programs. In: ICLP, pp. 137-148 (2004)
  • 13
    • 25144473063 scopus 로고    scopus 로고
    • Weak nonmonotonic probabilistic logics
    • Lukasiewicz, T.: Weak nonmonotonic probabilistic logics. Artif. Intell. 168(1-2), 119-161 (2005)
    • (2005) Artif. Intell , vol.168 , Issue.1-2 , pp. 119-161
    • Lukasiewicz, T.1
  • 14
    • 33846450337 scopus 로고    scopus 로고
    • Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: Complexity, algorithms, and implementation
    • Lukasiewicz, T.: Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: Complexity, algorithms, and implementation. Int. J. Approx. Reasoning 44(3), 301-321 (2007)
    • (2007) Int. J. Approx. Reasoning , vol.44 , Issue.3 , pp. 301-321
    • Lukasiewicz, T.1
  • 15
    • 0345381807 scopus 로고    scopus 로고
    • From information to probability: An axiomatic approach - inference isinformation processing
    • Rödder, W., Kern-Isberner, G.: From information to probability: An axiomatic approach - inference isinformation processing. Int. J. Intell. Syst. 18(4), 383-403 (2003)
    • (2003) Int. J. Intell. Syst , vol.18 , Issue.4 , pp. 383-403
    • Rödder, W.1    Kern-Isberner, G.2
  • 16
    • 0038558162 scopus 로고    scopus 로고
    • On the measurability of knowledge acquisition, query processing
    • Rödder, W.: On the measurability of knowledge acquisition, query processing. Int. J. Approx. Reasoning 33(2), 203-218 (2003)
    • (2003) Int. J. Approx. Reasoning , vol.33 , Issue.2 , pp. 203-218
    • Rödder, W.1


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