Representing causal information about a probabilistic process

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4160 LNAI, Issue , 2006, Pages 452-464

  Vennekens, Joost ^a   Denecker, Marc ^a   Bruynooghe, Maurice ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; LOGIC PROGRAMMING; PROBABILISTIC LOGICS; SEMANTICS;

PROBABILISTIC PROCESS; TEMPORAL ASPECTS;

DATA PROCESSING;

EID: 33750046636     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11853886_37     Document Type: Conference Paper

References (12)

1. M. Denecker and E. Ternovska. A logic of non-monotone inductive definitions and its modularity properties. In Proc. 7th International Conference on Logic Programming and Non-monotonitc Reasoning (LPNMR), pages 47-60 volume 2923 of LNCS, 2004.
2. M. Denecker, D. Theseider-Dupré, and K. Van Belleghem. An inductive definition approach to ramifications. Linköping Electronic Articles in Computer and Information Science, 3(7):1-43, 1998.
3. J. Halpern and M. Tuttle. Knowledge, probability, and adversaries. Journal of the ACM, 40:917-960, 1993.
4. N. McCain. Causality in Commonsense Reasoning about Actions. PhD thesis, University of Texas at Austin, 1997.
5. N. McCain and H. Turner. Causal theories of action and change. In Proc. 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference (AAAI/IAAI), pages 460-465, 1996.
6. J. Pearl. Causality: Models, Reasoning, and Inference. Cambridge University Press, 2000.
7. D. Poole. The Independent Choice Logic for modelling multiple agents under uncertainty. Artificial Intelligence, 94(1-2):7-56, 1997.
8. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 3/4:401-424, 1991.
9. C. Sakama and K. Inoue. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning, 13(1):145-172, 1994.
10. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The Well-Founded Semantics for General Logic Programs. Journal of the ACM, 38(3):620-650, 1991.
11. J. Vennekens, M. Denecker, and M. Bruynooghe. On the equivalence of Logic Programs with Annotated Disjunctions and CP-logic. Technical report, K.U. Leuven, 2006.
12. J. Vennekens, S. Verbaeten, and M. Bruynooghe. Logic programs with annotated disjunctions. In Logic Programming, 20th International Conference, ICLP 2004, Proceedings, pages 431-445, volume 3132 of LNCS. Springer, 2004.