Logic programming for Boolean networks

Authors:
Katsumi Inoue
Affiliations:
National Institute of Informatics, Tokyo, Japan
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 18
Cited 4

Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
The relationship between stable, supported, default and autoepistemic semantics for general logic programs

Theoretical Computer Science
Stable and extension class theory for logic programs and default logics

Journal of Automated Reasoning
A three-valued semantics for deductive databases and logic programs

Journal of Computer and System Sciences
Extending and implementing the stable model semantics

Artificial Intelligence
Simulations between Programs as Cellular Automata

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Solving the Satisfiability Problem through Boolean Networks

AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Classification of random boolean networks

ICAL 2003 Proceedings of the eighth international conference on Artificial life
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
Logic programs with monotone abstract constraint atoms*

Theory and Practice of Logic Programming
From minimal signed circuits to the dynamics of Boolean regulatory networks

Bioinformatics
Synchronous versus asynchronous modeling of gene regulatory networks

Bioinformatics
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Hyperequivalence of logic programs with respect to supported models

Annals of Mathematics and Artificial Intelligence
Modeling Protein Interaction Networks with Answer Set Programming

BIBM '09 Proceedings of the 2009 IEEE International Conference on Bioinformatics and Biomedicine
Determining a singleton attractor of an AND/OR Boolean network in O (1.587n) time

Information Processing Letters
A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Analyzing pathways using ASP-based approaches

ANB'10 Proceedings of the 4th international conference on Algebraic and Numeric Biology

DNF hypotheses in explanatory induction

ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Oscillating behavior of logic programs

Correct Reasoning
Completing causal networks by meta-level abduction

Machine Learning
Learning from interpretation transition

Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Boolean network is a mathematical model of biological systems, and has attracted much attention as a qualitative tool for analyzing the regulatory system. The stable states and dynamics of Boolean networks are characterized by their attractors, whose properties have been analyzed computationally, yet not much work has been done from the viewpoint of logical inference systems. In this paper, we show direct translations of Boolean networks into logic programs, and propose new methods to compute their trajectories and attractors based on inference on such logic programs. In particular, point attractors of both synchronous and asynchronous Boolean networks are characterized as supported models of logic programs so that SAT techniques can be applied to compute them. Investigation of these relationships suggests us to view Boolean networks as logic programs and vice versa.