| [1] |
A. Burrieza and M. Ojeda-Aciego.
A multimodal logic approach to order of magnitude qualitative
reasoning with comparability and negligibility relations.
Fundamenta Informaticae, 2005.
To appear. [ bib ] |
| [2] |
J. Medina, E. MČrida-Casermeiro, and M. Ojeda-Aciego.
A neural implementation of multi-adjoint logic programs via
sf-homogeneous programs.
Mathware & Soft Computing, 2005.
To appear. [ bib ] |
| [3] |
David Pearce and AgustĚn Valverde.
A first order nonmonotonic extension of constructive logic.
Studia Logica, 80:323-348, 2005. [ bib ] |
| [4] |
Javier MartĚnez, Gloria GutiČrrez, Inmaculada P. de Guzm·n, and
Pablo Cordero.
Generalizations of lattices via non-deterministic operators.
Discrete Mathematics, 295(1-3):107-141, 2005. [ bib ] |
| [5] |
J. Medina, E. MČrida-Casermeiro, and M. Ojeda-Aciego.
Interval-valued neural multi-adjoint logic programs.
In Proc. Intl. Conf. on the Interplay between Natural and
Artificial Computation, pages 521-530. Lect. Notes in Computer Science
3561, 2005. [ bib ] |
| [6] |
David Pearce and AgustĚn Valverde.
Towards a first order equilibrium logic for nonmonotonic reasoning.
In JosČ J™lio Alferes and Joao Alexandre Leite, editors,
Logics in Artificial Intelligence, 9th European Conference, JELIA 2004,
Lisbon, Portugal, September 27-30, 2004, Proceedings, volume 3229 of
Lecture Notes in Computer Science, pages 147-160. Springer, 2004. [ bib ] |
| [7] |
David Pearce and AgustĚn Valverde.
Synonymus theories in answer set programming and equilibrium logic.
In Ramon LŰpez de M·ntaras and Lorenza Saitta, editors,
Proceedings of the 16th Eureopean Conference on Artificial Intelligence,
ECAI'2004, including Prestigious Applicants of Intelligent Systems, PAIS
2004, Valencia, Spain, August 22-27, 2004, pages 388-392. IOS Press, 2004. [ bib ] |
| [8] |
AgustĚn Valverde.
tabeql: A tableau based suite for equilibrium logic.
In JosČ J™lio Alferes and Joao Alexandre Leite, editors,
Logics in Artificial Intelligence, 9th European Conference, JELIA 2004,
Lisbon, Portugal, September 27-30, 2004, Proceedings, volume 3229 of
Lecture Notes in Computer Science, pages 734-737. Springer, 2004. [ bib ] |
| [9] |
David Pearce and AgustĚn Valverde.
Uniform equivalence for equilibrium logic and logic programs.
In Vladimir Lifschitz and Ilkka Niemel”, editors, Logic
Programming and Nonmonotonic Reasoning, 7th International Conference, LPNMR
2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings, volume 2923
of Lecture Notes in Computer Science, pages 194-206. Springer, 2004. [ bib ] |
| [10] |
J. Medina, E. MČrida-Casermeiro, and M. Ojeda-Aciego.
Decomposing ordinal sums in neural multi-adjoint logic programs.
In Ibero-American Conference on Artificial Intelligence, pages
717-726. Lect. Notes in Artificial Intelligence 3315, 2004. [ bib ] |
| [11] |
M. Ojeda-Aciego and A. Valverde.
tascpl: TAS solver for Classical Propositional Logic.
In Logics in Artificial Intelligence, JELIA'04, pages 731-735.
Lect. Notes in Artificial Intelligence 3229, 2004. [ bib ] |
| [12] |
C.V. Dam·sio, J. Medina, and M. Ojeda-Aciego.
Sorted multi-adjoint logic programs: termination results and
applications.
In Logics in Artificial Intelligence, JELIA'04, pages 260-273.
Lect. Notes in Artificial Intelligence 3229, 2004. [ bib ] |
| [13] |
C.V. Dam·sio, J. Medina, and M. Ojeda-Aciego.
A tabulation proof procedure for residuated logic programming.
In European Conference on Artificial Intelligence, volume 110
of Frontiers in Artificial Intelligence and Applications, pages
808-812, 2004. [ bib ] |
| [14] |
D. Pearce and A. Valverde.
Synomymous theories in answer set programming and equilibrium logic.
In European Conference on Artificial Intelligence, volume 110
of Frontiers in Artificial Intelligence and Applications, pages
388-392, 2004. [ bib ] |
| [15] |
P. Cordero, G. GutiČrrez, J. MartĚnez, and I. P. de Guzm·n.
A new algebraic tool for automatic theorem provers.
Annals of Mathematics and Artificial Intelligence,
42(4):369-398, 2004. [ bib ] |
| [16] |
J. Medina, E. MČrida-Casermeiro, and M. Ojeda-Aciego.
A neural implementation of multi-adjoint logic programming.
Journal of Applied Logic, 2/3:301-324, 2004. [ bib ] |
| [17] |
J. Medina, M. Ojeda-Aciego, and P. Vojt·s.
Similarity-based unification: a multi-adjoint approach.
Fuzzy Sets and Systems, 146(1):43-62, 2004. [ bib ] |
| [18] |
A. Burrieza and M. Ojeda-Aciego.
A multimodal logic approach to order of magnitude qualitative
reasoning.
In Spanish Conference on Artificial Intelligence, pages 66-75.
Lect. Notes in Artificial Intelligence 3040, 2003. [ bib ] |
| [19] |
J. Medina, M. Ojeda-Aciego, and P. Vojt·s.
Towards biresiduated multi-adjoint logic programming.
In Spanish Conference on Artificial Intelligence, pages
608-617. Lect. Notes in Artificial Intelligence 3040, 2003. [ bib ] |
| [20] |
A. Mora, M. Enciso, P. Cordero, and I. P.de Guzm·n.
The functional dependence implication problem: optimality and
minimality. An efficient preprocessing transformation based on the
substitution paradigm.
Lect. Notes in Artificial Intelligence, 3040:136-146, 2004. [ bib ] |
| [21] |
P. Eklund, M.A. Gal·n, J. Medina, M. Ojeda-Aciego, and A. Valverde.
Similarities between powersets of terms.
Fuzzy Sets and Systems, 144(1):213-225, 2004. [ bib ] |
| [22] |
D. Pearce and A. Valverde.
Uniform equivalence for equilibrium logic and logic programs.
Lect. Notes in Artificial Intelligence, 2923:194-206, 2004. [ bib ] |
| [23] |
J. MartĚnez, P. Cordero, G. GutiČrrez, and I. P.de Guzm·n.
Restricted ideals and the groupability property. tools for temporal
reasoning.
Kybernetika, 39(5):521-546, 2003. [ bib ] |
| [24] |
A. Burrieza and I.P. de Guzm·n.
A functional approach for temporal x modal logics.
Acta Informatica, 39(2):71-96, 2003. [ bib ] |
| [25] |
J. Medina, E. MČrida-Casermeiro, and M. Ojeda-Aciego.
A neural approach to extended logic programs.
Lect. Notes in Computer Science, 2686:654-661, 2003. [ bib ] |
| [26] |
P. Cordero, M. Enciso, and I.P. de Guzm·n.
From the posets of literals to a temporal negative normal form.
Reports on Mathematical Logic, 36:3-54, 2002. [ bib ] |
| [27] |
P. Cordero, M. Enciso, and I.P. de Guzm·n.
Bases for closed sets of implicants and implicates in temporal logic.
Acta Informatica, 38:693-705, 2002. [ bib ] |
| [28] |
G. GutiČrrez, I. P. de Guzm·n, J. MartĚnez, M. Ojeda-Aciego, and
A. Valverde.
Satisfiability testing for Boolean formulas using Δ-trees.
Studia Logica, 72:33-60, 2002. [ bib ] |
| [29] |
A. Burrieza and I. P. de Guzm·n.
A temporal x modal approach to the definability of properties of
functions.
Lect. Notes in Computer Science 2309, 2309:239-254, 2002. [ bib ] |
| [30] |
J. MartĚnez, G. GutiČrrez, I. P. de Guzm·n, and P. Cordero.
Ideals and filters in multisemilattices and lattices.
WSEAS Transactions on Mathematics, 1:125-130, 2002. [ bib ] |
| [31] |
P. Eklund, M.A. Gal·n, J. Medina, M. Ojeda-Aciego, and A. Valverde.
Set functors, L-fuzzy set categories and generalized terms.
Computers and Mathematics with Applications, 43:693-705, 2002. [ bib ] |
| [32] |
S. Krajci, R. Lencses, J. Medina, M. Ojeda-Aciego, A. Valverde, and
P. Vojt·s.
Non-commutativity and expressive deductive logic databases.
Lect. Notes in Artificial Intelligence, 2424:149-160, 2002. [ bib ] |
| [33] |
S. Krajci, R. Lencses, J. Medina, M. Ojeda-Aciego, and P. Vojt·s.
A similarity-based unification model for flexible querying.
Lect. Notes in Artificial Intelligence, 2522:263-273, 2002. [ bib ] |
| [34] |
P. Cordero, M. Enciso, I.P. de Guzm·n, and A. Mora.
Slfd logic: Elimination of data redundancy in knowledge
representation.
Lect. Notes in Artificial Intelligence, 2527:141-150, 2002. [ bib ] |
| [35] |
J. Medina, E. MČrida-Casermeiro, and M. Ojeda-Aciego.
A neural approach to abductive multi-adjoint reasoning.
Lect. Notes in Computer Science, 2443, 2002.
213-222. [ bib ] |
| [36] |
I.P. de Guzm·n, M. Ojeda-Aciego, and A. Valverde.
Restricted Δ-trees in multiple-valued logics.
Lect. Notes in Computer Science, 2443:223-232, 2002. [ bib ] |
| [37] |
I.P. de Guzm·n, M. Ojeda-Aciego, and A. Valverde.
Restricted Δ-trees and reduction theorems in multiple-valued
logics.
Lect. Notes in Artificial Intelligence, 2527:161-171, 2002. [ bib ] |
| [38] |
G. Aguilera, I. P. de Guzm·n, M. Ojeda-Aciego, and A. Valverde.
Reductions for non-clausal theorem proving.
Theoretical Computer Science, 266(1/2):81-112, 2001. [ bib ] |
| [39] |
J. Medina, M. Ojeda-Aciego, and P. Vojt·s.
A procedural semantics for multi-adjoint logic programming.
Lect. Notes in Artificial Intelligence, 2258:290-297, 2001. [ bib ] |
| [40] |
J. Medina, M. Ojeda-Aciego, and P. Vojt·s.
A multi-adjoint logic approach to abductive reasoning.
Lect. Notes in Artificial Intelligence, 2237:269-283, 2001. [ bib ] |
| [41] |
J. Medina, M. Ojeda-Aciego, and P. Vojt·s.
Multi-adjoint logic programming with continuous semantics.
Lect. Notes in Artificial Intelligence, 2173:351-364, 2001. [ bib ] |
| [42] |
P. Cordero, M. Enciso, and I. P. de Guzm·n.
A temporal negative normal form which preserves implicants and
implicates.
Journal of Applied Non-Classical Logics, 10, 2000. [ bib ] |
| [43] |
G. GutiČrrez, I. P. de Guzm·n, J. MartĚ nez, , M. Ojeda-Aciego, and
A. Valverde.
Reduction theorems for Boolean formulas using Δ-trees.
Lect. Notes in Artificial Intelligence, 1919:179-192, 2000. [ bib ] |
| [44] |
David Pearce, Inma P. de Guzm·n, and A. Valverde.
A tableau calculus for equilibrium entailment.
Lect. Notes in Artificial Intelligence, 2000. [ bib ] |
| [45] |
David Pearce, Inma P. de Guzm·n, and A. Valverde.
Computing equilibrium models using signed formulas.
Lect. Notes in Artificial Intelligence, 1861:688-702, 2000. [ bib ] |
| [46] |
I. P. de Guzm·n, M. Ojeda-Aciego, and A. Valverde.
Implicates and reduction techniques for temporal logics.
Annals of Mathematics and Artificial Intelligence, 27:2-23,
1999. [ bib ] |
| [47] |
I. P. de Guzm·n, M. Ojeda-Aciego, and A. Valverde.
Reducing signed propositional formulas.
Soft Computing, 2(4):157-166, 1999. [ bib ] |
| [48] |
P. Cordero, M. Enciso, and I. P. de Guzm·n.
Structure theorems for closed sets of implicates/implicants in
temporal logic.
Lect. Notes in Artificial Intelligence, 1695, 1999. [ bib ] |
| [49] |
I. P. de Guzm·n, M. Ojeda-Aciego, and A. Valverde.
Implicates and reduction techniques for temporal logics.
In Proc. of JELIA'98, pages 309-323. Lect. Notes in Artif.
Intelligence 1489, 1998. [ bib ] |
| [50] |
G. Aguilera, I. P. de Guzm·n, and M. Ojeda-Aciego.
A new reduction-based theorem prover for 3-valued logic.
Mathware & Soft Computing, 4(2):99-127, 1997. [ bib ] |
| [51] |
I. P. de Guzm·n and C. Rossi.
LNint: a temporal logic that combines points and intervals and the
absolute and relative approaches.
Journal of the IGPL, 3(5):745-764, 1995. [ bib ] |
| [52] |
I. P. de Guzm·n, M. Ojeda, and A. Valverde.
A formal identification between tuples and lists with an application
to list-arithmetic categories.
Acta Informatica, 32:61-78, 1995. [ bib ] |
| [53] |
G. Aguilera, I. P. de Guzm·n, and M. Ojeda-Aciego.
Increasing the efficiency of automated theorem proving.
Journal of Applied Non-Classical Logics, 5(1):9-29, 1995. [ bib ] |
| [54] |
G. Aguilera, I. P. de Guzm·n, and M. Ojeda-Aciego.
TAS-D++ syntactic trees transformations for automated theorem
proving.
Lect. Notes in Artificial Intelligence, 838:198-216, 1994. [ bib ] |
| [55] |
A. Burrieza and I. P. de Guzm·n.
A new algebraic semantic approach and some adequate connectives for
computation with temporal logic over discrete time.
Journal of Applied Non-Classical Logics, 2, 1992. [ bib ] |
This file has been generated by bibtex2html 1.75