Abstract
Adaptation is a step of case-based reasoning that aims at modifying a source case (representing a problem-solving episode) in order to solve a new problem, called the target case. An approach to adaptation consists in applying a belief revision operator that modifies minimally the source case so that it becomes consistent with the target case. Another approach consists in using domain-dependent adaptation rules. These two approaches can be combined: a revision operator parametrized by the adaptation rules is introduced and the corresponding revision-based adaptation uses the rules to modify the source case. This paper presents an algorithm for revision-based and rule-based adaptation based on tableaux repairs in propositional logic: when the conjunction of source and target cases is inconsistent, the tableaux method leads to a set of branches, each of them ending with clashes, and then, these clashes are repaired (thus modifying the source case), with the help of the adaptation rules. This algorithm has been implemented in the Revisor/PLAK tool and some implementation issues are presented.
This research was partially funded by the project Kolflow of the French National Agency for Research (ANR), program ANR CONTINT ( http://kolflow.univ-nantes.fr ).
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
Riesbeck, C.K., Schank, R.C.: Inside Case-Based Reasoning. Lawrence Erlbaum Associates, Inc., Hillsdale (1989)
Aamodt, A., Plaza, E.: Case-based Reasoning: Foundational Issues, Methodological Variations, and System Approaches. AI Communications 7(1), 39–59 (1994)
Minor, M., Bergmann, R., Görg, S., Walter, K.: Towards Case-Based Adaptation of Workflows. In: Bichindaritz, I., Montani, S. (eds.) ICCBR 2010. LNCS, vol. 6176, pp. 421–435. Springer, Heidelberg (2010)
Manzano, S., Ontañón, S., Plaza, E.: Amalgam-Based Reuse for Multiagent Case-Based Reasoning. In: Ram, A., Wiratunga, N. (eds.) ICCBR 2011. LNCS, vol. 6880, pp. 122–136. Springer, Heidelberg (2011)
Coman, A., Muñoz-Avila, H.: Diverse plan generation by plan adaptation and by first-principles planning: A comparative study. In: Díaz-Agudo, B., Watson, I. (eds.) ICCBR 2012. LNCS, vol. 7466, pp. 32–46. Springer, Heidelberg (2012)
Rubin, J., Watson, I.: Opponent type adaptation for case-based strategies in adversarial games. In: Díaz-Agudo, B., Watson, I. (eds.) ICCBR 2012. LNCS, vol. 7466, pp. 357–368. Springer, Heidelberg (2012)
Lieber, J.: Application of the Revision Theory to Adaptation in Case-Based Reasoning: The Conservative Adaptation. In: Weber, R.O., Richter, M.M. (eds.) ICCBR 2007. LNCS (LNAI), vol. 4626, pp. 239–253. Springer, Heidelberg (2007)
Cojan, J., Lieber, J.: Applying belief revision to case-based reasoning. In: Prade, H., Richard, G. (eds.) Computational Approaches to Analogical Reasoning: Current Trends. SCI, vol. 548, pp. 133–162. Springer, Heidelberg (2014)
Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the Logic of Theory Change: partial meet functions for contraction and revision. Journal of Symbolic Logic 50, 510–530 (1985)
Cojan, J., Lieber, J.: An Algorithm for Adapting Cases Represented in an Expressive Description Logic. In: Bichindaritz, I., Montani, S. (eds.) ICCBR 2010. LNCS, vol. 6176, pp. 51–65. Springer, Heidelberg (2010)
Schwind, C.: From Inconsistency to Consistency: Knowledge Base Revision by Tableaux Opening. In: Kuri-Morales, A., Simari, G.R. (eds.) IBERAMIA 2010. LNCS, vol. 6433, pp. 120–132. Springer, Heidelberg (2010)
Melis, E., Lieber, J., Napoli, A.: Reformulation in Case-Based Reasoning. In: Smyth, B., Cunningham, P. (eds.) EWCBR 1998. LNCS (LNAI), vol. 1488, pp. 172–183. Springer, Heidelberg (1998)
Personeni, G., Hermann, A., Lieber, J.: Adapting propositional cases based on tableaux repairs using adaptation knowledge – extended report (2014), http://hal.archives-ouvertes.fr/docs/01/01/17/51/PDF/report_on_revisor_plak.pdf
Marquis, P., Sadaoui, S.: A new algorithm for computing theory prime implicates compilations. In: AAAI/IAAI, vol. 1, pp. 504–509 (1996)
Katsuno, H., Mendelzon, A.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52(3), 263–294 (1991)
Pearl, J.: Heuristics – Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Co., Reading (1984)
Eiter, T., Gottlob, G.: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Artificial Intelligence 57, 227–270 (1992)
Gent, I., Petrie, K., Puget, J.-F.: Symmetry in constraint programming. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook for Constraint Programming, ch. 10, pp. 329–376. Elsevier (2006)
Peppas, P.: Belief Revision. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, ch. 8, pp. 317–359. Elsevier (2008)
Konieczny, S., Pino Pérez, R.: Merging information under constraints: a logical framework. Journal of Logic and Computation 12(5), 773–808 (2002)
Cojan, J., Lieber, J.: Belief Merging-Based Case Combination. In: McGinty, L., Wilson, D.C. (eds.) ICCBR 2009. LNCS, vol. 5650, pp. 105–119. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Personeni, G., Hermann, A., Lieber, J. (2014). Adapting Propositional Cases Based on Tableaux Repairs Using Adaptation Knowledge. In: Lamontagne, L., Plaza, E. (eds) Case-Based Reasoning Research and Development. ICCBR 2014. Lecture Notes in Computer Science(), vol 8765. Springer, Cham. https://doi.org/10.1007/978-3-319-11209-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-11209-1_28
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11208-4
Online ISBN: 978-3-319-11209-1
eBook Packages: Computer ScienceComputer Science (R0)