Abstract
We analyze the dynamics of problem-solving in a framework which captures two key features of that activity. The first feature is that problem-solving is a social game where a number of problem-solvers interact, rely on other agents to tackle parts of a problem, and regularly communicate the outcomes of their investigations. The second feature is that problem-solving requires a careful control over the set of hypotheses that might be needed at various stages of the investigation for the problem to be solved; more particularly, that any incorrect hypothesis be eventually refuted in the face of some evidence: all agents can expect such evidence to be brought to their knowledge whenever it holds. Our presentation uses a very general form of logic programs, viewed as sets of rules that can be activated and fire, depending on what a problem-solver is willing to explore, what a problem-solver is willing to hypothesize, and what a problem-solver knows about the problem to be solved in the form of data or background knowledge.
Our framework supports two fundamental aspects of problem-solving. The first aspect is that no matter how the work is being distributed amongst agents, exactly the same knowledge is guaranteed to be discovered eventually. The second aspect is that any group of agents (with at one end, one agent being in charge of all rules and at another end, one agent being in charge of one and only one rule) might need to sometimes put forward some hypotheses to allow for the discovery of a particular piece of knowledge in finite time.
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
Afshar, M., Dartnell, C., Luzeaux, D., Sallantin, J.: Aristotle’s square revisited to frame discovery science. Journal of Computers 2(5), 54–66 (2007)
Angluin, D., Krikis, M.: Learning from different teachers. Machine Learning 51(2), 137–163 (2003)
Chavalarias, D., Cointet, J.-P.: Bottom-up scientific field detection for dynamical and hierarchical science mapping—methodology and case study. Scientometrics 75(1) (2008)
Gold, M.E.: Language identification in the limit. Information and Control 10(5), 447–474 (1967)
Langley, P.W., Bradshaw, G.L., Simon, H.A.: Rediscovering chemistry with the BACON system. In: Michalski, R.S., Carbonell, J.G., Mitchell, T.M. (eds.) Machine Learning: An Artificial Intelligence Approach, Springer, Heidelberg (1984)
Martin, E., Sharma, A., Stephan, F.: Deduction, induction and beyond in parametric logic. In: Friend, M., Goethe, N.B., Harizanov, V.S. (eds.) Induction, Algorithmic Learning Theory, and Philosophy. Logic, Epistemology and the Unity of Science, vol. 9. Springer, Heidelberg (2007)
Soldatova, L.N., Clare, A., Sparkes, A., King, R.D.: An ontology for a robot scientist. Bioinformatics 22(14), e464–e471 (2006)
Valiant, L.L.: A theory of the learnable. Communications of the ACM 27(11), 1134–1142 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, E., Sallantin, J. (2009). A Dialectic Approach to Problem-Solving. In: Gama, J., Costa, V.S., Jorge, A.M., Brazdil, P.B. (eds) Discovery Science. DS 2009. Lecture Notes in Computer Science(), vol 5808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04747-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-04747-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04746-6
Online ISBN: 978-3-642-04747-3
eBook Packages: Computer ScienceComputer Science (R0)