Towards a logical analysis of biochemical pathways

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3229, Issue , 2004, Pages 667-679

  Doherty, Patrick ^a   Kertes, Steve ^a   Magnusson, Martin ^a   Szalas, Andrzej ^a  

^a Department of Computer and Information Science ^*  (Sweden)

Author keywords

Abduction; Biochemical pathways; Hypotheses generation; Weakest sufficient and strongest necessary conditions

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPLEX NETWORKS; FORMAL LOGIC; BIOCHEMISTRY; DATABASE SYSTEMS; GRAPH THEORY; INFORMATION ANALYSIS; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS;

ABDUCTION; ADDITIONAL REACTIONS; BIOCHEMICAL PATHWAY; GENERIC REPRESENTATION; HYPOTHESES GENERATION; HYPOTHESIS GENERATION; PHYSICAL INTERACTIONS; WEAKEST SUFFICIENT AND STRONGEST NECESSARY CONDITIONS;

BIOLOGICAL SYSTEMS; FORMAL LOGIC;

ABDUCTION; BIOCHEMICAL PATHWAYS; HYPOTHESES GENERATION; LOGICAL ANALYSIS; WEAKEST SUFFICIENT AND STRONGEST NECESSARY CONDITIONS;

EID: 22944471144     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_55     Document Type: Conference Paper

References (14)

1. Bryant, C, Muggleton, S., Oliver, S., Kell, D., Reiser, P., King, R.: Combining inductive logic programming, active learning and robotics to discover the function of genes. Linkoping Electronic Articles in Computer and Information Science 6 (2001)
2. Deville, Y., Gilbert, D., Van Helden, J., Wodak, S.: An overview of data models for the analysis of biochemical pathways. Briefings in Bioinformatics 4 (2003) 246-259
3. Doherty, P., Lukaszewicz, W., Szalas, A.: Computing circumscription revisited. Journal of Automated Reasoning 18 (1997) 297-336
4. Gabbay, D. M., Ohlbach, H. J.: Quantifier elimination in second-order predicate logic. In Nebel, B., Rich, C, Swartout, W., eds.: Principles of Knowledge Representation and Reasoning, KR 92. (1992) 425-435
5. Nonnengart, A., Szalas, A.: A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In Orlowska, E., ed.: Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, Springer Physica-Verlag (1998) 307-328
6. Doherty, P., Lukaszewicz, W., Szalas, A.: Computing strongest necessary and weakest sufficient conditions of first-order formulas. International Joint Conference on AI (IJCAI'2001) (2000) 145-151
7. Doherty, P., Kachniarz, J., Szalas, A.: Using contextually closed queries for local closedworld reasoning in rough knowledge databases. In Pal, S., Polkowski, L., Skowron, A., eds.: Rough-Neuro Computing: Techniques for Computing with Words. Cognitive Technologies, Springer-Verlag (2003) 219-250
8. Chabrier, N., Fages, F.: Symbolic model checking of biochemical networks. In: Proceedings of the First International Workshop on Computational Methods in Systems Biology CMSB'03. Volume 2602 of LNCS., Springer-Verlag (2004) 149-162
9. Chabrier-Rivier, N., Fages, F, Soliman, S.: The biochemical abstract machine biocham. In: Proceedings of the Second International Workshop on Computational Methods in Systems Biology CMSB'04. LNCS, Springer-Verlag (2004)
10. Doherty, P., Kertes, S., Magnusson, M., Szalas, A.: Towards alogical analysis of biochemical pathways (extended abstract). In: Proceedings of the European Conference on Artificial Intelligence ECAI'2004. (2004) to appear.
11. Lin, F.: On strongest necessary and weakest sufficient conditions. In Cohn, A., Giunchiglia, F., Selman, B., eds.: Principles of Knowledge Representation and Reasoning, KR'2000. (2000) 167-175
12. Doherty, P., Lukaszewicz, W., Szalas, A.: A reduction result for circumscribed semi-Horn formulas. Fundamenta Informaticae 28 (1996) 261-271
13. Doherty, P., Lukaszewicz, W., Szalas, A.: General domain circumscription and its effective reductions. Fundamenta Informaticae 36 (1998) 23-55
14. Pine, S., Hendrickson, J., Cram, D., Hammond, G: Organic Chemistry. McGraw-Hill, Inc. (1980)