Gutiérrez Gil, Raúl; Lucas Alba, Salvador(Springer Nature, 2020-07-06)
[EN] In the realm of term rewriting, given terms s and t, a reachability condition s>>t is called feasible if there is a substitution O such that O(s) rewrites into O(t) in zero or more steps; otherwise, it is ...
[EN] In this paper we present a setting for examining the relation between the distribution of research intensity in AI research and the
relevance for a range of work tasks (and occupations) in current
and simulated ...
Martínez-Plumed, Fernando; Hernández-Orallo, José(Institute of Electrical and Electronics Engineers (IEEE), 2020-06)
[EN] With the purpose of better analyzing the result of artificial intelligence (AI) benchmarks, we present two indicators on the side of the AI problems, difficulty and discrimination, and two indicators on the side of ...
[EN] In this paper, we propose a method that improves the classification of images. Considering saliency maps as if they were topographic maps and filtering the characteristics of the image’s background, the Bag of VisualWords ...
[EN] We address the novel question of determining which kind of machine learning model is behind the predictions when we interact with a black-box model. This may allow us to identify families of techniques whose models ...
Gutiérrez Gil, Raúl; Lucas Alba, Salvador(Universidade de Brasilia, 2019-06-28)
[EN] Given a Conditional Term Rewriting System (CTRS) R and terms s and t, we say that the reachability condition s ->* t is *feasible* if there is a substitution \sigma instantiating the variables in s and t such that ...
[EN] AI systems are usually evaluated on a range of problem instances and compared to other AI systems that use different strategies. These instances are rarely independent. Machine learning, and supervised learning in ...
Gutiérrez Gil, Raúl; Lucas Alba, Salvador(Springer Nature, 2020-07-06)
[EN] We report on the new version of mu-term, a tool for proving termination properties of variants of rewrite systems, including conditional, context-sensitive, equational, and order-sorted rewrite systems. We follow a ...
[EN] Decision procedures can be either theory-specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure for ...