Publicacións nas que colabora con María Felicidad Aguado Martín (21)

2024

  1. Syntactic ASP forgetting with forks

    Artificial Intelligence, Vol. 326

2022

  1. A polynomial reduction of forks into logic programs

    Artificial Intelligence, Vol. 308

  2. Syntactic ASP Forgetting with Forks

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2021

  1. A logic program transformation for strongly persistent forgetting

    Electronic Proceedings in Theoretical Computer Science, EPTCS

  2. Linear-Time Temporal Answer Set Programming

    Theory and Practice of Logic Programming

2020

  1. Explicit negation in linear-dynamic equilibrium logic

    Frontiers in Artificial Intelligence and Applications

  2. Forgetting auxiliary atoms in forks

    IJCAI International Joint Conference on Artificial Intelligence

2019

  1. Forgetting auxiliary atoms in forks

    Artificial Intelligence, Vol. 275, pp. 575-601

  2. Revisiting Explicit Negation in Answer Set Programming

    Theory and Practice of Logic Programming, Vol. 19, Núm. 5-6, pp. 908-924

2017

  1. Forgetting auxiliary atoms in forks

    CEUR Workshop Proceedings

  2. Temporal Equilibrium Logic with past operators

    Journal of Applied Non-Classical Logics, Vol. 27, Núm. 3-4, pp. 161-177

  3. Temporal logic programs with variables

    Theory and Practice of Logic Programming, Vol. 17, Núm. 2, pp. 226-243

  4. Verification for ASP denotational semantics: A case study using the PVS theorem prover

    Logic Journal of the IGPL, Vol. 25, Núm. 2, pp. 195-213

2015

  1. A denotational semantics for equilibrium logic

    Theory and Practice of Logic Programming, Vol. 15, Núm. 4-5, pp. 620-634

2013

  1. Integrating temporal extensions of answer set programming

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Temporal equilibrium logic: A survey

    Journal of Applied Non-Classical Logics

2012

  1. Paving the way for temporal grounding

    Leibniz International Proceedings in Informatics, LIPIcs

2011

  1. Crossover operators for permutations equivalence between position and order-based crossover

    Logic Journal of the IGPL, Vol. 19, Núm. 2, pp. 405-414

  2. Loop formulas for splitable temporal logic programs

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2008

  1. Strongly equivalent temporal logic programs

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)