Logic Programming

URI permanente para esta colección:

https://hdl.handle.net/11705/PROLE/2018/LP
Artículos en la categoría Logic Programming publicados en las Actas de las XVIII Jornadas de Programación y Lenguajes (PROLE 2018).
Notificar un error en esta colección

Examinar

Envíos recientes

Mostrando 1 - 3 de 3
  • Miniatura
    Resumen
    Constraint Answer Set Programming without Grounding
    Arias, Joaquín; Carro, Manuel; Marple, Kyle; Salazar, Elmer; Gupta, Gopal. Actas de las XVIII Jornadas de Programación y Lenguajes (PROLE 2018), 2018-09-17.
    Extending ASP with constraints (CASP) enhances its expressiveness and performance. This extension is not straightforward as the grounding phase, present in most ASP systems, removes variables and the links among them, and also causes a combinatorial explosion in the size of the program. This has led CASP systems to devise several methods to overcome this issue: restricting the constraint domains (e.g., discrete instead of dense), where constraints can appear, or the type (or number) of models that can be returned. In this paper we propose to incorporate constraints into s(ASP), a goal-directed, top-down execution model which implements ASP while retaining logical variables both during execution and in the answer sets. The resulting model, s(CASP), can constrain variables that (as in CLP) are kept during the execution and in the answer sets. s(CASP) inherits and generalizes the execution model of s(ASP) while parameterizing the constraint solver. We describe this novel execution model and show, through several examples, the enhanced expressiveness of s(CASP) w.r.t. ASP, CLP, and other ASP systems with constraints. We also report improved performance w.r.t. other very mature, highly optimized ASP systems in some benchmarks.
  • Miniatura
    Artículo
    An Online Tool for Unfolding Symbolic Fuzzy Logic Programs (Demostración)
    Moreno, Ginés; Riaza Valverde, José Antonio. Actas de las XVIII Jornadas de Programación y Lenguajes (PROLE 2018), 2018-09-17.
    In many declarative frameworks, unfolding is a very well-known semantics-preserving transformation technique based on the application of computational steps on the bodies of program rules for improving efficiency. In this paper we describe an online tool which allows us to unfold a symbolic extension of a modern fuzzy logic language where program rules can embed concrete and/or symbolic fuzzy connectives and truth degrees on their bodies. The system offers a comfortable interaction with users for unfolding symbolic programs and it also provides useful options to navigate along the sequence of unfolded programs. Finally, the symbolic unfolding transformation is connected with some fuzzy tuning techniques that we previously implemented on the same tool.
  • Miniatura
    Resumen
    An Efficient Proximity-based Unification Algorithm
    Julián Iranzo, Pascual; Sáenz Pérez, Fernando. Actas de las XVIII Jornadas de Programación y Lenguajes (PROLE 2018), 2018-09-17.
    Unification is a central concept in deductive systems based on the resolution principle. Recently, we introduced a new weak unification algorithm based on proximity relations (i.e., reflexive, symmetric, fuzzy binary relations). Proximity relations are able to manage vague or imprecise information and, in combination with the unification algorithm, allow certain forms of approximate reasoning in a logic programming framework. In this paper, we present a reformulation of the weak unification algorithm and an elaborated method to implement it efficiently. [This work has been accepted for its presentation at the 27th IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2018)]