메뉴 건너뛰기




Volumn 9, Issue 3, 2009, Pages 245-308

CP-logic: A language of causal probabilistic events and its relation to logic programming

Author keywords

Causality; Probabilistic logic programming; Uncertainty

Indexed keywords

CAUSALITY; DYNAMIC ASPECTS; DYNAMIC CONTEXTS; FORMAL SEMANTICS; LOGIC PROGRAMS; LOGICAL LANGUAGE; LOGICAL REPRESENTATIONS; PROBABILISTIC LOGIC PROGRAMS; PROBABILITY TREES; UNCERTAINTY; WELL-FOUNDED MODELS;

EID: 69749117260     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068409003767     Document Type: Article
Times cited : (112)

References (58)
  • 1
    • 0347594595 scopus 로고
    • Using first-order probability logic for the construction of Bayesian networks
    • Morgan Kaufmann, San Fransisco, USA
    • Bacchus, F. 1993. Using first-order probability logic for the construction of Bayesian networks. In Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, , 219-226. Morgan Kaufmann, San Fransisco, USA.
    • (1993) Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence , pp. 219-226
    • Bacchus, F.1
  • 4
    • 84880896814 scopus 로고    scopus 로고
    • Using the probabilistic logic programming language P-log for causal and counterfactual reasoning and non-naive conditioning
    • Hyderabad, India
    • Baral, C. and Hunsaker, M. 2007. Using the probabilistic logic programming language P-log for causal and counterfactual reasoning and non-naive conditioning. In Proceedings of IJCAI. Hyderabad, India.
    • (2007) Proceedings of IJCAI
    • Baral, C.1    Hunsaker, M.2
  • 5
    • 9444256641 scopus 로고    scopus 로고
    • Reasoning about actions in a probabilistic setting
    • Edmonton, Alberta, Canada
    • Baral, C., Tran, N. and Tuan, L. 2002. Reasoning about actions in a probabilistic setting. In AAAI. Edmonton, Alberta, Canada.
    • (2002) AAAI
    • Baral, C.1    Tran, N.2    Tuan, L.3
  • 6
    • 38049150636 scopus 로고    scopus 로고
    • Towards learning non-recursive LPADs by transforming them into Bayesian networks
    • Lecture Notes in Computer Science. Springer-Verlag, New York
    • Blockeel, H. and Meert, W. 2007. Towards learning non-recursive LPADs by transforming them into Bayesian networks. In Inductive Logic Programming IPL'06, Revised Selected Papers. Lecture Notes in Computer Science, vol.4455, 94-108. Springer-Verlag, New York.
    • (2007) Inductive Logic Programming IPL'06, Revised Selected Papers , vol.4455 , pp. 94-108
    • Blockeel, H.1    Meert, W.2
  • 7
    • 84990617553 scopus 로고
    • Construction of belief and decision networks
    • Breese, J. 1992. Construction of belief and decision networks. Computational Intelligence 8 (4), 624-647.
    • (1992) Computational Intelligence , vol.8 , Issue.4 , pp. 624-647
    • Breese, J.1
  • 10
    • 0001918661 scopus 로고
    • La prvision: Ses lois logiques, ses sources subjectives
    • De Finetti, B. 1937. La prvision: ses lois logiques, ses sources subjectives. Annales de Henri Poincaré 7, 1-68.
    • (1937) Annales de Henri Poincaré , vol.7 , pp. 1-68
    • De Finetti, B.1
  • 12
    • 84949994421 scopus 로고    scopus 로고
    • The well-founded semantics is the principle of inductive definition
    • J. Dix, L. Farinas del Cerro, and U. Furbach, Eds. Lecture Notes in Artificial Intelligence, Springer-Verlag NY, USA
    • Denecker, M. 1998. The well-founded semantics is the principle of inductive definition. In Logics in Artificial Intelligence , J. Dix, L. Farinas del Cerro, and U. Furbach, Eds. Lecture Notes in Artificial Intelligence, vol.1489, Springer-Verlag NY, USA, 1-16.
    • (1998) Logics in Artificial Intelligence , vol.1489 , pp. 1-16
    • Denecker, M.1
  • 14
    • 38049077927 scopus 로고    scopus 로고
    • Well-founded semantics and the algebraic theory of non-monotone inductive definitions
    • Proceedings. Lecture Notes in Artificial Intelligence, Springer
    • Denecker, M. and Vennekens, J. 2007. Well-founded semantics and the algebraic theory of non-monotone inductive definitions. In Logic Programming and Nonmonotonic Reasoning, 9th International Conference, LPNMR 2007, Proceedings. Lecture Notes in Artificial Intelligence, vol.4483, Springer, 84-96.
    • (2007) Logic Programming and Nonmonotonic Reasoning, 9th International Conference, LPNMR 2007 , vol.4483 , pp. 84-96
    • Denecker, M.1    Vennekens, J.2
  • 18
    • 77951505493 scopus 로고
    • Classical negation in logic programs and disjunctive databases
    • Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-387.
    • (1991) New Generation Computing , vol.9 , pp. 365-387
    • Gelfond, M.1    Lifschitz, V.2
  • 19
    • 0027694534 scopus 로고
    • Representing action and change by logic programs
    • Gelfond, M. and Lifschitz, V. 1993. Representing action and change by logic programs. Journal of Logic Programming 17 (2-4), 301-322.
    • (1993) Journal of Logic Programming , vol.17 , Issue.2-4 , pp. 301-322
    • Gelfond, M.1    Lifschitz, V.2
  • 21
    • 0041779094 scopus 로고    scopus 로고
    • Learning probabilistic relational models
    • S. Dzeroski and N. Lavrac, Eds. Springer-Verlag NY, USA
    • Getoor, L., Friedman, N., Koller, D. and Pfeffer, A. 2001. Learning probabilistic relational models. In Relational Data Mining, S. Dzeroski and N. Lavrac, Eds. Springer-Verlag NY, USA, 7-34.
    • (2001) In Relational Data Mining , pp. 7-34
    • Getoor, L.1    Friedman, N.2    Koller, D.3    Pfeffer, A.4
  • 23
    • 0031642569 scopus 로고    scopus 로고
    • An action language based on causal explanation: Preliminary report
    • Madison, Wisconsin, USA
    • Giunchiglia, E. and Lifschitz, V. 1998. An action language based on causal explanation: Preliminary report. In Proceedings of AAAI 98. Madison, Wisconsin, USA.
    • (1998) Proceedings of AAAI 98
    • Giunchiglia, E.1    Lifschitz, V.2
  • 40
    • 0030737325 scopus 로고    scopus 로고
    • Answering queries from context-sensitive probabilistic knowledge bases
    • Ngo, L. and Haddawy, P. 1997. Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science 171 (1-2), 147-177.
    • (1997) Theoretical Computer Science , vol.171 , Issue.1-2 , pp. 147-177
    • Ngo, L.1    Haddawy, P.2
  • 43
    • 0002378357 scopus 로고
    • Temporal reasoning in logic programming: A case for the situation calculus
    • MIT Press Cambridge, MA, USA
    • Pinto, J. and Reiter, R. 1993. Temporal reasoning in logic programming: A case for the situation calculus. In Proceedings of the International Conference on Logic Programming. 203-221. MIT Press Cambridge, MA, USA.
    • (1993) Proceedings of the International Conference on Logic Programming , pp. 203-221
    • Pinto, J.1    Reiter, R.2
  • 44
    • 0027702434 scopus 로고
    • Probabilistic Horn abduction and Bayesian networks
    • Poole, D. 1993. Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence 64 (1), 81-129.
    • (1993) Artificial Intelligence , vol.64 , Issue.1 , pp. 81-129
    • Poole, D.1
  • 45
    • 0031187203 scopus 로고    scopus 로고
    • The Independent Choice Logic for modelling multiple agents under uncertainty
    • Poole, D. 1997. The Independent Choice Logic for modelling multiple agents under uncertainty. Artificial Intelligence 94 (1-2), 7-56.
    • (1997) Artificial Intelligence , vol.94 , Issue.1-2 , pp. 7-56
    • Poole, D.1
  • 47
    • 22944492698 scopus 로고    scopus 로고
    • Learning logic programs with annotated disjunctions
    • Porto, 6-8 September, A. Srinivasan and R. King, Eds. Springer-Verlag, Heidelberg, Germany
    • Riguzzi, F. 2004. Learning logic programs with annotated disjunctions. In 14th Internation Conference on Inductive Logic Programming (ILP2004), Porto, 6-8 September 2004, A. Srinivasan and R. King, Eds. Springer-Verlag, Heidelberg, Germany, 270-287.
    • (2004) 14th Internation Conference on Inductive Logic Programming (ILP2004) , pp. 270-287
    • Riguzzi, F.1
  • 49
    • 0028493723 scopus 로고
    • An alternative approach to the semantics of disjunctive logic programs and deductive databases
    • Sakama, C. and Inoue, K. 1994. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of automated reasoning 13 (1), 145-172.
    • (1994) Journal of Automated Reasoning , vol.13 , Issue.1 , pp. 145-172
    • Sakama, C.1    Inoue, K.2
  • 53
    • 84860557868 scopus 로고    scopus 로고
    • Encoding probabilistic causal model in probabilistic action language
    • San Jose, California, USA
    • Tran, N. and Baral, C. 2004. Encoding probabilistic causal model in probabilistic action language. In AAAI. San Jose, California, USA.
    • (2004) AAAI
    • Tran, N.1    Baral, C.2
  • 55
    • 71149116148 scopus 로고
    • The well-founded semantics for general logic programs
    • Van Gelder, A., Ross, K. and Schlipf, J. 1991. The well-founded semantics for general logic programs. Journal of the ACM 38 (3), 620-650.
    • (1991) Journal of the ACM , vol.38 , Issue.3 , pp. 620-650
    • Van Gelder, A.1    Ross, K.2    Schlipf, J.3
  • 57
    • 33750046636 scopus 로고    scopus 로고
    • Representing causal information about a probabilistic process
    • Lecture Notes in Computer Science, Springer NY, USA, Proceedings
    • Vennekens, J., Denecker, M. and Bruynooghe, M. 2006. Representing causal information about a probabilistic process. In Logics in Artificial Intelligence, 10th European Conference, JELIA'06, . Lecture Notes in Computer Science, vol.4160. Springer NY, USA, Proceedings 452-464.
    • (2006) Logics in Artificial Intelligence, 10th European Conference, JELIA'06 , vol.4160 , pp. 452-464
    • Vennekens, J.1    Denecker, M.2    Bruynooghe, M.3


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