Concepción Vidal

Orcid: 0000-0002-5561-6406

According to our database1, Concepción Vidal authored at least 28 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Syntactic ASP forgetting with forks.
Artif. Intell., January, 2024

2023
Linear-Time Temporal Answer Set Programming.
Theory Pract. Log. Program., 2023

2022
Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs.
Algorithms, 2022

A polynomial reduction of forks into logic programs.
Artif. Intell., 2022

2020
Temporal Answer Set Programming.
CoRR, 2020

Forgetting Auxiliary Atoms in Forks (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Explicit Negation in Linear-Dynamic Equilibrium Logic.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
Revisiting Explicit Negation in Answer Set Programming.
Theory Pract. Log. Program., 2019

Forgetting auxiliary atoms in forks.
Artif. Intell., 2019

A Complete Planner for Temporal Answer Set Programming.
Proceedings of the Progress in Artificial Intelligence, 2019

2017
Temporal logic programs with variables.
Theory Pract. Log. Program., 2017

Temporal Equilibrium Logic with past operators.
J. Appl. Non Class. Logics, 2017

Verification for ASP denotational semantics: A case study using the PVS theorem prover.
Log. J. IGPL, 2017

2015
An infinitary encoding of temporal equilibrium logic.
Theory Pract. Log. Program., 2015

A denotational semantics for equilibrium logic.
Theory Pract. Log. Program., 2015

2013
Temporal equilibrium logic: a survey.
J. Appl. Non Class. Logics, 2013

Integrating Temporal Extensions of Answer Set Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

2012
Paving the Way for Temporal Grounding.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

2011
Crossover operators for permutations equivalence between position and order-based crossover.
Log. J. IGPL, 2011

Loop Formulas for Splitable Temporal Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

2008
Genetic Algorithms in Coq: Generalization and Formalization of the crossover operator.
J. Formaliz. Reason., 2008

Strongly Equivalent Temporal Logic Programs.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

Deception, order and epistasis.
Proceedings of the 2008 International Conference on Genetic and Evolutionary Methods, 2008

2007
Certified Genetic Algorithms: Crossover Operators for Permutations.
Proceedings of the Computer Aided Systems Theory, 2007

2005
Computing Epistasis of Template Functions Through Walsh Transforms.
Comput. Artif. Intell., 2005

Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

1999
Computing epistasis through Walsh transforms.
SIGSAM Bull., 1999

Epistasis and Unitation.
Comput. Artif. Intell., 1999


  Loading...