Oscillating behavior of logic programs

Authors:
Katsumi Inoue;Chiaki Sakama
Affiliations:
National Institute of Informatics, Chiyoda-ku, Tokyo, Japan;Department of Computer and Communication Sciences, Wakayama University, Sakaedani, Wakayama, Japan
Venue:
Correct Reasoning
Year:
2012

Citing 17
Cited 1

Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Semantic domains

Handbook of theoretical computer science (vol. B)
Autoepistemic logic

Journal of the ACM (JACM)
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
The relationship between stable, supported, default and autoepistemic semantics for general logic programs

Theoretical Computer Science
Preferred extensions are partial stable models

Journal of Logic Programming
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
Stable models and non-determinism in logic programs with negation

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Stable Classes and Operator Pairs for Disjunctive Programs

LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Simulations between Programs as Cellular Automata

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Logic programs with monotone abstract constraint atoms*

Theory and Practice of Logic Programming
Synchronous versus asynchronous modeling of gene regulatory networks

Bioinformatics
A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Singleton and 2-periodic attractors of sign-definite Boolean networks

Information Processing Letters
Logic programming for Boolean networks

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Learning from interpretation transition

Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine oscillation behavior of normal logic programs. Both the Gelfond-Lifschitz operator and the TP operator are used to update Herbrand interpretations, and any interpretation finally reaches in an oscillator. It has been shown that the supported model semantics of normal logic programs can characterize point attractors of Boolean networks. We here newly define supported classes of normal logic programs to investigate periodic oscillation induced by the TP operator, and apply them to characterize cycle attractors of Boolean networks. We also relate stable classes and supported classes of normal logic programs.