×

ACUOS: a system for modular ACU generalization with subtyping and inheritance. (English) Zbl 1432.68422

Fermé, Eduardo (ed.) et al., Logics in artificial intelligence. 14th European conference, JELIA 2014, Funchal, Madeira, Portugal, September 24–26, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8761, 573-581 (2014).
Summary: Computing generalizers is relevant in a wide spectrum of automated reasoning areas where analogical reasoning and inductive inference are needed. The ACUOS system computes a complete and minimal set of semantic generalizers (also called “anti-unifiers”) of two structures in a typed language modulo a set of equational axioms. By supporting types and any (modular) combination of associativity (A), commutativity (C), and unity (U) algebraic axioms for function symbols, ACUOS allows reasoning about typed data structures, e.g. lists, trees, and (multi-)sets, and typical hierarchical/structural relations such as \(is_a\) and \(part_of\). This paper discusses the modular ACU generalization tool ACUOS and illustrates its use in a classical artificial intelligence problem.
For the entire collection see [Zbl 1296.68009].

MSC:

68T27 Logic in artificial intelligence
68P05 Data structures

Software:

ACUOS2; Maude
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Alpuente, M.; Escobar, S.; Espert, J.; Meseguer, J., A Modular Order-sorted Equational Generalization Algorithm, Information and Computation, 235, 98-136 (2014) · Zbl 1314.68169 · doi:10.1016/j.ic.2014.01.006
[2] Alpuente, M.; Escobar, S.; Meseguer, J.; Ojeda, P.; Hanus, M., A Modular Equational Generalization Algorithm, Logic-Based Program Synthesis and Transformation, 24-39 (2009), Heidelberg: Springer, Heidelberg · Zbl 1185.68219 · doi:10.1007/978-3-642-00515-2_3
[3] Alpuente, M.; Escobar, S.; Meseguer, J.; Ojeda, P., Order-Sorted Generalization, ENTCS, 246, 27-38 (2009) · Zbl 1347.68193
[4] Alpuente, M., Espert, J., Escobar, S., Meseguer, J.: ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance. Tech. rep., DSIC-UPV (2013), http://www.dsic.upv.es/users/elp/papers.html · Zbl 1432.68422
[5] Armengol, E.; Weber, R. O.; Richter, M. M., Usages of Generalization in Case-Based Reasoning, Case-Based Reasoning Research and Development, 31-45 (2007), Heidelberg: Springer, Heidelberg · doi:10.1007/978-3-540-74141-1_3
[6] Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martí-Oliet, N.; Meseguer, J.; Talcott, C., All About Maude - A High-Performance Logical Framework (2007), Heidelberg: Springer, Heidelberg · Zbl 1115.68046
[7] Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.L.: Reflection, metalevel computation, and strategies. In: All About Maude [6], pp. 419-458 · Zbl 1115.68046
[8] Gentner, D., Structure-Mapping: A Theoretical Framework for Analogy*, Cognitive Science, 7, 2, 155-170 (1983) · doi:10.1207/s15516709cog0702_3
[9] Krumnack, U.; Schwering, A.; Gust, H.; Kühnberger, K.-U.; Orgun, M. A.; Thornton, J., Restricted higher order anti unification for analogy making, AI 2007: Advances in Artificial Intelligence, 273-282 (2007), Heidelberg: Springer, Heidelberg
[10] Kutsia, T.; Levy, J.; Villaret, M., Anti-Unification for Unranked Terms and Hedges, Journal of Automated Reasoning, 520, 155-190 (2014) · Zbl 1331.68122 · doi:10.1007/s10817-013-9285-6
[11] Meseguer, J., Conditioned rewriting logic as a united model of concurrency, Theor. Comput. Sci., 96, 1, 73-155 (1992) · Zbl 0758.68043 · doi:10.1016/0304-3975(92)90182-F
[12] Muggleton, S., Inductive Logic Programming: Issues, Results and the Challenge of Learning Language in Logic, Artif. Intell., 114, 1-2, 283-296 (1999) · Zbl 0939.68574 · doi:10.1016/S0004-3702(99)00067-3
[13] Ontañón, S.; Plaza, E., Similarity measures over refinement graphs, Machine Learning, 87, 1, 57-92 (2012) · Zbl 1238.68128 · doi:10.1007/s10994-011-5274-3
[14] Plotkin, G.: A note on inductive generalization. In: Machine Intelligence, vol. 5, pp. 153-163. Edinburgh University Press (1970) · Zbl 0219.68045
[15] Pottier, L.: Generalisation de termes en theorie equationelle: Cas associatif-commutatif. Tech. Rep. INRIA 1056, Norwegian Computing Center (1989)
[16] Schmid, U.; Hofmann, M.; Bader, F.; Häberle, T.; Schneider, T.; García-Pedrajas, N.; Herrera, F.; Fyfe, C.; Benítez, J. M.; Ali, M., Incident Mining using Structural Prototypes, Trends in Applied Intelligent Systems, 327-336 (2010), Heidelberg: Springer, Heidelberg · doi:10.1007/978-3-642-13025-0_35
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.