Skip to main content

RAZONAMIENTO, SATISFACCION Y OPTIMIZACION

TIN2015-71799-C2-1-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2015
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

Resultados totales (Incluyendo duplicados): 18
Encontrada(s) 1 página(s)

Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Community Structure in Industrial SAT Instances

  • Ansótegui Gil, Carlos José
  • Bonet, Maria Luisa
  • Giráldez-Cru, Jesús
  • Levy, Jordi
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. It is believed that most of these successful techniques exploit the underlying structure of industrial instances. Recently, there have been some attempts to analyze the structure of industrial SAT instances in terms of complex networks, with the aim of explaining the success of SAT solving techniques, and possibly improving them. In this paper, we study the community structure, or modularity, of industrial SAT instances. In a graph with clear community structure, or high modularity, we can find a partition of its nodes into communities such that most edges connect variables of the same community. Representing SAT instances as graphs, we show that most application benchmarks are characterized by a high modularity. On the contrary, random SAT instances are closer to the classical Erdös-Rényi random graph model, where no structure can be observed. We also analyze how this structure evolves by the effects of the execution of a CDCL SAT solver, and observe that new clauses learned by the solver during the search contribute to destroy the original structure of the formula. Motivated by this observation, we finally present an application that exploits the community structure to detect relevant learned clauses, and we show that detecting these clauses results in an improvement on the performance of the SAT solver. Empirically, we observe that this improves the performance of several SAT solvers on industrial SAT formulas, especially on satisfiable instances., This work is partially supported by the EU H2020 Research and Innovation Programme under the LOGISTAR project (Grant Agreement No. 769142), MINECO-FEDER projects RASO (TIN2015-71799-C2-1-P) and TASSAT3 (TIN2016-76573-C2-2-P), the Spanish Ministerio de Econom´ıa y Competitividad under the EXASOCO project (ref. PGC2018-101216- B-I00), including European Regional Development Funds (ERDF). The third author is also supported by a MICINN Juan de la Cierva fellowship (ref. FJCI-2017-32420).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Generating SAT instances with community structure

  • Giráldez-Crú, Jesús
  • Levy, Jordi
Nowadays, modern SAT solvers are able to efficiently solve many industrial, or real-world, SAT instances. However, the process of development and testing of new SAT solving techniques is conditioned to the finite and reduced number of known industrial benchmarks. Therefore, new models of random SAT instances generation that capture realistically the features of real-world problems can be beneficial to the SAT community. In many works, the structure of industrial instances has been analyzed representing them as graphs and studying some of their properties, like modularity. In this work, we use the notion of modularity to define a new model of generation of random SAT instances with community structure, called Community Attachment. For high values of modularity (i.e., clear community structure), we realistically model pseudo-industrial random SAT formulas. This model also generates SAT instances very similar to classical random formulas using a low value of modularity. We also prove that the phase transition point, if exists, is independent on the modularity. We evaluate the adequacy of this model to real industrial SAT problems in terms of SAT solvers performance, and show that modern solvers do actually exploit this community structure. Finally, we use this generator to observe the connections between the modularity of the instance and some components of the solver, such as the variable branching heuristics or the clause learning mechanism., This work is partially supported by the MINECO/FEDER project RASO (TIN2015-71799-C2-1-P) and the CSIC project 201450E045, Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Expanding FL e w with a Boolean connective

  • Ertola-Biraben, Rodolfo C.
  • Esteva, Francesc
  • Godo, Lluis
We expand FL e w with a unary connective whose algebraic counterpart is the operation that gives the greatest complemented element below a given argument. We prove that the expanded logic is conservative and has the Finite Model Property. We also prove that the corresponding expansion of the class of residuated lattices is an equational class. © 2016, Springer-Verlag Berlin Heidelberg., The authors are thankful to annonymous reviewer for his/her comments that have helped to improve the final layout of this paper. The authors have been funded by the EU H2020-MSCA-RISE-2015 Project 689176–SYSMICS. Esteva and Godo have been also funded by the FEDER/MINECO Spanish project TIN2015-71799-C2-1-P, Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

On the existence of free models in fuzzy universal Horn classes

  • Costa, Vicent
  • Dellunde, Pilar
This paper is a contribution to the study of the universal Horn fragment of predicate fuzzy logics, focusing on some relevant notions in logic programming. We introduce the notion of term structure associated to a set of formulas in the fuzzy context and we show the existence of free models in fuzzy universal Horn classes. We prove that every equality-free consistent universal Horn fuzzy theory has a Herbrand model. © 2016 Elsevier B.V., This project has received funding from the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No 689176 (SYSMICS project). Pilar Dellunde is also partially supported by the project RASO TIN2015-71799-C2-1-P (MINECO/FEDER) and the grant 2014SGR-118 from the Generalitat de Catalunya., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Towards a probability theory for product logic: States, integral representation and reasoning

  • Flaminio, Tommaso
  • Godo, Lluis
  • Ugolini, Sara
The aim of this paper is to extend probability theory from the classical to the product t-norm fuzzy logic setting. More precisely, we axiomatize a generalized notion of finitely additive probability for product logic formulas, called state, and show that every state is the Lebesgue integral with respect to a unique regular Borel probability measure. Furthermore, the relation between states and measures is shown to be one–one. In addition, we study geometrical properties of the convex set of states and show that extremal states, i.e., the extremal points of the state space, are the same as the truth-value assignments of the logic. Finally, we axiomatize a two-tiered modal logic for probabilistic reasoning on product logic events and prove soundness and completeness with respect to probabilistic spaces, where the algebra is a free product algebra and the measure is a state in the above sense. © 2017 Elsevier Inc., The authors acknowledge partial support by the SYSMICS project ( EU H2020-MSCA-RISE-2015 Project 689176). Also, Flaminio and Godo acknowledge partial support by the FEDER/MINECO project TIN2015-71799-C2-1-P, Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

On the relation between modal and multi-modal logics over Lukasiewicz logic

  • Esteva, Francesc
  • Godo, Lluis
  • Rodriguez, Ricardo O.
Trabajo presentado en eI IEEE International Conference on Fuzzy Systems (FUZZ 2017), 9-12 July 2017., In a previous paper, it was shown that the (minimal) modal logic MŁ n c with fuzzy accessibility relations over the finite-valued Łukasiewicz logic Ł n and a corresponding multi-modal logic mMŁ n c (with a modality □ a for each value a in the n-valued Ł n -chain) had the same expressive power when the language is extended with truth-constants. In this paper we partially extend these results when replacing the underlying logic Ł n by the infinite-valued Łukasiewicz logic (with rational truth constants in the language). We prove that the (standard) tautologies of the modal logic MŁ n c (resp. mMŁ c ) are in fact the common tautologies of all the logics MŁ n c (resp. all the logics mMŁn) when letting n vary over N. This fact opens the door to show an alternative proof of the finite model property for these logics and hence their decidability., They acknowledge partial support by the H2020-MSCA-RISE-2015 project SYSMICS, the Spanish MINECO project RASO (TIN2015-71799-C2-1-P) and the Argentinean project PIP CONICET 11220150100412CO., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Corrigendum to “Towards a probability theory for product logic: States, integral representation and reasoning” [Int. J. Approx. Reason. 93 (2018) 199–218]

  • Flaminio, Tommaso
  • Godo, Lluis
  • Ugolini, Sara
The aim of this short note is to report on a counter-example by Stefano Aguzzoli (private communication) showing that a claim made in a recent paper of ours [2, Proposition 5.2], stating that the class of states of a free product algebra is closed, is in fact not true. That claim was used in turn in the proof of one of the main results of the same paper [2, Theorem 5.4]. However, we also provide in this note an alternative proof for that result, so that it keeps holding true., The authors acknowledge partial support by the SYSMICS project (EU H2020-MSCA-RISE-2015 Project 689176). Also, Flaminio acknowledges partial support by the Spanish Ramon y Cajal research program RYC-2016-19799; Flaminio and Godo acknowledge partial support by the FEDER/MINECO project TIN2015-71799-C2-1-P., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

On the relation between possibilistic logic and modal logics of belief and knowledge

  • Banerjee, Mohua
  • Dubois, Didier
  • Godo, Lluis
  • Prade, Henri
Possibilistic logic and modal logic are knowledge representation frameworks sharing some common features, such as the duality between possibility and necessity, and the decomposability of necessity for conjunctions, as well as some obvious differences since possibility theory is graded. At the semantic level, possibilistic logic relies on possibility distributions and modal logic on accessibility relations. In the last 30 years, there have been a series of attempts for bridging the two frameworks in one way or another. In this paper, we compare the relational semantics of epistemic logics (such as KD45 and S5) with simpler possibilistic semantics of a fragment of such logics that only uses modal formulas of depth 1. This minimal epistemic logic handles both all-or-nothing beliefs and explicitly ignored facts. We also contrast epistemic logic with the S5-based rough set logic. Finally, this paper presents extensions of generalized possibilistic logic with objective and non-nested multimodal formulas, in the style of modal logics KD45 and S5., Godo is supported by the MINECO/FEDER project RASO [TIN2015-71799-C2-1-P]., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A new upper bound for the maximum weight clique problem

  • Li, Chu Min
  • Liu, Yanli
  • Jiang, Hua
  • Manyà, Felip
  • Li, Yu
The maximum weight clique problem (MWCP) for a vertex-weighted graph is to find a complete subgraph in which the sum of vertex weights is maximum. The main goal of this paper is to develop an efficient branch-and-bound algorithm to solve the MWCP. As a crucial aspect of branch-and-bound MWCP algorithms is the incorporation of a tight upper bound, we first define a new upper bound for the MWCP, called UBWC, that is based on a novel notion called weight cover. The idea of a weight cover is to compute a set of independent sets of the graph and define a weight function for each independent set so that the weight of each vertex of the graph is covered by such weight functions. We then propose a new branch-and-bound MWCP algorithm called WC-MWC that uses UBWC to reduce the number of branches of the search space that must be traversed by incrementally constructing a weight cover for the graph. Finally, we present experimental results that show that UBWC reduces the search space much more than previous upper bounds, and the new algorithm WC-MWC outperforms some of the best performing exact and heuristic MWCP algorithms on both small/medium graphs and real-world massive graphs., Work supported by the National Natural Science Foundation of China (grants 61272014, 61370183, 61472147 and 61370184), the platforms Matrics of University of Picardie Jules Verne and HPC of Jianghan Univeristy, the Spanish Ministry of Economy and Competitiveness–FEDER (grant TIN2015-71799-C2-1-P)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A branching heuristic for SAT solvers based on complete implication graphs

  • Xiao, Fan
  • Li, Chu Min
  • Luo, Mao
  • Manyà, Felip
  • Lü, Zhipeng
  • Li, Yu
The performance of modern conflict-driven clause learning (CDCL) SAT solvers strongly depends on branching heuristics. State-of-the-art branching heuristics, such as variable state independent decaying sum (VSIDS) and learning rate branching (LRB), are computed and maintained by aggregating the occurrences of the variables in conflicts. However, these heuristics are not sufficiently accurate at the beginning of the search because they are based on very few conflicts. We propose the distance branching heuristic, which, given a conflict, constructs a complete implication graph and increments the score of a variable considering the longest distance between the variable and the conflict rather than the simple presence of the variable in the graph. We implemented the proposed distance branching heuristic in Maple_LCM and Glucose-3.0, two of the best CDCL SAT solvers, and used the resulting solvers to solve instances from the application and crafted tracks of the 2014 and 2016 SAT competitions and the main track of the 2017 SAT competition. The empirical results demonstrate that using the proposed distance branching heuristic in the initialization phase of Maple_LCM and Glucose-3.0 solvers improves performance. The Maple_LCM solver with the proposed distance branching heuristic in the initialization phase won the main track of the 2017 SAT competition., This work was partially supported by National Natural Science Foundation of China (Grant Nos. 61370183, 61370184, 61472147), Matrics Platform of the Université de Picardie Jules Verne, and MINECO-FEDER Project RASO (Grant No. TIN2015-71799-C2-1-P), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Maximality in finite-valued Lukasiewicz logics defined by order filters

  • Coniglio, Marcelo E.
  • Esteva, Francesc
  • Gispert, Joan
  • Godo, Lluis
In this paper we consider the logics L-n i obtained from the (n+1)-valued Łukasiewicz logics Ł- n+1 by taking the order filter generated by i/n as the set of designated elements. In particular, the conditions of maximality and strong maximality among them are analyzed. We present a very general theorem that provides sufficient conditions for maximality between logics. As a consequence of this theorem, it is shown that L-n i is maximal w.r.t. CPL whenever n is prime. Concerning strong maximality (i.e. maximality w.r.t. rules instead of only axioms), we provide algebraic arguments in order to show that the logics L-n i are not strongly maximal w.r.t. CPL, even for n prime. Indeed, in such case, we show that there is just one extension between L-n i and CPL obtained by adding to L-n i a kind of graded explosion rule. Finally, using these results, we show that the logics L-n i with n prime and i/n < 1/2 are ideal paraconsistent logics., The authors also acknowledge partial support by the H2020 MSCA-RISE-2015 project SYSMICS. M.E. Coniglio was also financially supported by an individual research grant from CNPq, Brazil (308524/2014-4). F. Esteva and L. Godo also acknowledge partial support by the Spanish MINECO/FEDER project RASO (TIN2015- 71799-C2-1-P). J. Gispert also acknowledges partial support by the Spanish MINECO/FEDER projects (MTM2016-74892 and MDM-2014-044) and grant 2017-SGR-95 of Generalitat de Catalunya, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

New complexity results for Lukasiewicz logic

  • Bofill, Miquel
  • Manyà, Felip
  • Vidal, Amanda
  • Villaret, Mateu
One aspect that has been poorly studied in multiple-valued logics, and in particular in Łukasiewicz logic, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. With the ultimate goal of finding challenging benchmarks for Łukasiewicz satisfiability solvers, we start by defining a natural and intuitive class of clausal forms (simple Ł-clausal forms) and studying their complexity. Since we prove that the satisfiability problem of simple Ł-clausal forms can be solved in linear time, we then define two new classes of clausal forms (Ł-clausal forms and restricted Ł-clausal forms) that truly exploit the non-lattice operations of Łukasiewicz logic and whose satisfiability problems are NP-complete when clauses have at least three literals, and admit linear-time algorithms when clauses have at most two literals. We also define an efficient satisfiability preserving translation of Łukasiewicz logic formulas into Ł-clausal forms. Finally, we describe a random generator of Ł-clausal forms and report on an empirical investigation in which we identify an easy-hard-easy pattern and a phase transition phenomenon for Ł-clausal forms., This work was supported by Project LOGISTAR from the EU H2020 Research and Innovation Programme under Grant Agreement No. 769142, MINECO-FEDER Projects RASO (TIN2015-71799-C2-1-P) and LoCos (TIN2015-66293-R), and the UdG Project MPCUdG2016/055. Vidal acknowledges the support from the Project GA17-04630S of the Czech Science Foundation (GAČR)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Practical reasoning using values: an argumentative approach based on a hierarchy of values

  • Teze, Juan Carlos L.
  • Perello-Moragues, Antoni
  • Godo, Lluis
  • Noriega, Pablo
Values are at the heart of human decision-making. They are used to decide whether something or some state of affairs is good or not, and they are also used to address the moral dilemma of the right thing to do under given circumstances. Both uses are present in several everyday situations, from the design of a public policy to the negotiation of employee benefit packages. Both uses of values are specially relevant when one intends to design or validate that artificial intelligent systems behave in a morally correct way. In real life, the choice of policy components or the agreed upon benefit package are processes that involve argumentation. Likewise, the design and deployment of value-driven artificial entities may be well served by embedding practical reasoning capabilities in these entities or using argumentation for their design and certification processes. In this paper, we propose a formal framework to support the choice of actions of a value-driven agent and arrange them into plans that reflect the agent’s preferences. The framework is based on defeasible argumentation. It presumes that agent values are partially ordered in a hierarchy that is used to resolve conflicts between incommensurable values., Teze acknowledges partial support by CONICET, Universidad Nacional del Sur (UNS), and Universidad Nacional de Entre Ríos (UNER), Argentina. Perelló-Moragues is supported with an AGAUR industrial doctoral grant sponsored by FCC AQUALIA, IIIA-CSIC, and UAB. Godo, Perelló-Moragues and Noriega acknowledge the AppPhil project (funded by Caixa Bank, RecerCaixa 2017) and the Spanish FEDER/ MINECO project CIMBVAL (TIN2017-89758-R). Godo’s work is also supported by the Spanish FEDER/ MINECO project RASO (TIN2015-71799-C2-1-P)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Syntactic characterizations of classes of first-order structures in mathematical fuzzy logic

  • Badia, Guillermo
  • Costa, Vicent
  • Dellunde, Pilar
  • Noguera, Carles
This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal–existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Loś–Tarski and the Chang–Loś–Suszko preservation theorems follow., Open access funding provided by Austrian Science Fund (FWF). The authors are indebted to two anonymous referees and to the editor for their critical and interesting remarks that have helped improving the presentation the paper. Costa, Dellunde, and Noguera received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Curie Grant Agreement No. 689176 (SYSMICS project). Badia is supported by the Project I 1923-N25 (New perspectives on residuated posets) of the Austrian Science Fund (FWF). Costa is also supported by the Grant for the recruitment of early-stage research staff (FI-2017) from the Generalitat de Catalunya. Dellunde is also partially supported by the Project RASO TIN2015-71799-C2-1-P, CIMBVAL TIN2017-89758-R, and the Grant 2017SGR-172 from the Generalitat de Catalunya. The research leading to these results has received funding from AppPhil-RecerCaixa. Finally, Noguera is also supported by the Project GA17-04630S of the Czech Science Foundation (GAČR), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

T-generable indistinguishability operators and their use for feature selection and classification

  • Armengol, Eva
  • Boixader, Dionis
  • García-Cerdaña, Àngel
  • Recasens, Jordi
T-generable indistinguishability operators are operators E that can be expressed in the form , where T is a t-norm and is the fuzzy relation generated by the fuzzy subset μ. In this paper we analyse their relation with powers with respect to the t-norm T and with quasi-arithmetic means. For non-strict continuous Archimedean t-norms they are completely characterised as generable by crisp equivalence relations. These fuzzy relations are used to define a method, called JADE, useful for feature selection and classification tasks. JADE is based on minimising the distance between two indistinguishability measures: the one given by weighting the attribute-values describing the domain objects and the other one given by the correct classification taken as an equivalence relation. The preliminary experiments we carried out with JADE are promising concerning the accuracy in solving classification tasks. We also report some issues of the method that could be improved in the future., This research is partially funded by the projects RASO (TIN2015-71799-C2-1-P) and RPREF (CSIC Intramural 201650E044) and the grants 2014-SGR-118 and 2014-SGR-788 from the Generalitat de Catalunya., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Three characterizations of strict coherence on infinite-valued events

  • Flaminio, Tommaso
This article builds on a recent paper coauthored by the present author, H. Hosni and F. Montagna. It is meant to contribute to the logical foundations of probability theory on many-valued events and, specifically, to a deeper understanding of the notion of strict coherence. In particular, we will make use of geometrical, measure-theoretical and logical methods to provide three characterizations of strict coherence on formulas of infinite-valued Lukasiewicz logic., The author acknowledges partial support by the Spanish Ramón y Cajal research program RYC-2016-19799; the Spanish FEDER/MINECO project TIN2015- 71799-C2-1-P and the SYSMICS project (EU H2020-MSCA-RISE-2015, Project 689176), Peer reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Community Structure in Industrial SAT Instances

  • Ansótegui Gil, Carlos José
  • Bonet, Maria Luisa
  • Giráldez-Cru, Jesús
  • Levy, Jordi
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. It is believed that most of these successful techniques exploit the underlying structure of industrial instances. Recently, there have been some attempts to analyze the structure of industrial SAT instances in terms of complex networks, with the aim of explaining the success of SAT solving techniques, and possibly improving them. In this paper, we study the community structure, or modularity, of industrial SAT instances. In a graph with clear community structure, or high modularity, we can find a partition of its nodes into communities such that most edges connect variables of the same community. Representing SAT instances as graphs, we show that most application benchmarks are characterized by a high modularity. On the contrary, random SAT instances are closer to the classical Erdös-Rényi random graph model, where no structure can be observed. We also analyze how this structure evolves by the effects of the execution of a CDCL SAT solver, and observe that new clauses learned by the solver during the search contribute to destroy the original structure of the formula. Motivated by this observation, we finally present an application that exploits the community structure to detect relevant learned clauses, and we show that detecting these clauses results in an improvement on the performance of the SAT solver. Empirically, we observe that this improves the performance of several SAT solvers on industrial SAT formulas, especially on satisfiable instances., This work is partially supported by the EU H2020 Research and Innovation Programme under the LOGISTAR project (Grant Agreement No. 769142), MINECO-FEDER projects RASO (TIN2015-71799-C2-1-P) and TASSAT3 (TIN2016-76573-C2-2-P), the Spanish Ministerio de Econom´ıa y Competitividad under the EXASOCO project (ref. PGC2018-101216- B-I00), including European Regional Development Funds (ERDF). The third author is also supported by a MICINN Juan de la Cierva fellowship (ref. FJCI-2017-32420).
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Syntactic characterizations of classes of first-order structures in mathematical fuzzy logic

  • Badia, Guillermo
  • Costa, Vicent|||0000-0001-6352-7238
  • Dellunde i Clavé, Pilar|||0000-0002-8198-5475
  • Noguera, Carles
This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś-Tarski and the Chang-Łoś-Suszko preservation theorems follow.