Abstract
We propose a multi-agent genetic algorithm to accomplish belief revision. The algorithm implements a new evolutionary strategy resulting from a combination of Darwinian and Lamarckian approaches. Besides encompassing the Darwinian operators of selection, mutation and crossover, it comprises a Lamarckian operator that mutates the genes in a chromosome that code for the believed assumptions. These self mutations are performed as a consequence of the chromosome phenotype’s experience obtained while solving a belief revision problem. They are directed by a belief revision procedure which relies on tracing the logical derivations leading to inconsistency of belief, so as to remove the latter’s support on the gene coded assumptions, by mutating the genes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T.M. Mitchell. Machine Learning. McGraw Hill, 1997.
Erick Cantú-Paz. A survey of parallel genetic algorithms.
C.V. Damásio, L.M. Pereira, and M. Schroeder. REVISE: Logic programming and diagnosis. In Proceedings of Logic-Programming and Non-Monotonic Reasoning, LPNMR’97, volume 1265 of LNAI, Germany, 1997. Springer-Verlag.
J.J. Alferes, L.M. Pereira, and T.C. Przymusinski. “Classical” negation in non-monotonic reasoning and logic programming. Journal of Automated Reasoning, 20:107–142, 1998.
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.
L.M. Pereira, C.V. Damásio, and J.J. Alferes. Diagnosis and debugging as contradiction removal. In L.M. Pereira and A. Nerode, editors, Proceedings of the 2nd International Workshop on Logic Programming and Non-monotonic Reasoning, pages 316–330. MIT Press, 1993.
E. Lamma, L.M. Pereira, and F. Riguzzi. Multi-agent logic aided lamarckian learning. Technical Report DEIS-LIA-00-004, Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna (Italy), 2000. LIA Series no. 44.
F. Brglez, P. Pownall, and R. Hum. Accelerated ATPG and fault grading via testability analysis. In Proceedings of IEEE Int. Symposium on Circuits and Systems, pages 695–698, 1985. The ISCAS85 benchmark netlist are available via ftp://www.mcnc.mcnc.org..
W.E. Hart and R.K. Belew. Optimization with genetic algorithms hybrids that use local search. In R.K. Belew and M. Mitchell, editors, Adaptive Individuals in Evolving Populations. Addison Wesley, 1996.
D.H. Ackely and M.L. Littman. A case for lamarckian evolution. In C.G. Langton, editor, Artificial Life III. Addison Wesley, 1994.
Y. Li, K.C. Tan, and M. Gong. Model reduction in control systems by means of global structure evolution and local parameter learning. In D. Dasgupta and Z. Michalewicz, editors, Evolutionary Algorithms in Engineering Applications. Springer Verlag, 1996.
J.J. Grefenstette. Lamarckian learning in multi-agent environments. In Proc. 4th Intl. Conference on Genetic Algorithms. Morgan Kauffman, 1991.
M. Potter and K. de Jong. A cooperative coevolutionary approach to function optimization, 1994.
Mitchell A. Potter, Kenneth A. De Jong, and John J. Grefenstette. A coevolutionary approach to learning sequential decision rules. In Larry Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 366–372, San Francisco, CA, 1995. Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamma, E., MonizPereira, L., Riguzzi, F. (2001). Belief Revision by Lamarckian Evolution. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_42
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive