LoRea (Logic and Reasoning) - GIU 21/044
![Foto de LoRea (Logic and Reasoning) - GIU 21/044](/img/grupo.png)
![Foto de Universitat Politècnica de Catalunya](/img/noimage_org.png)
Universitat Politècnica de Catalunya
Barcelona, EspañaPublications in collaboration with researchers from Universitat Politècnica de Catalunya (10)
2013
-
Invariant-free clausal temporal resolution
Journal of Automated Reasoning, Vol. 50, Núm. 1, pp. 1-49
2009
-
Dual Systems of Tableaux and Sequents for PLTL
Journal of Logic and Algebraic Programming, Vol. 78, Núm. 8, pp. 701-722
2008
-
A functorial framework for constraint normal logic programming
Applied Categorical Structures, Vol. 16, Núm. 3, pp. 421-450
2007
-
A cut-free and invariant-free sequent calculus for PLTL
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2006
-
A functrial framework for constraint normal logic programming
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2004
-
Constructive negation by bottom-up computation of literal answers
Proceedings of the ACM Symposium on Applied Computing
1999
-
Algebraic framework for the definition of compositional semantics of normal logic programs
Journal of Logic Programming, Vol. 40, Núm. 1, pp. 89-123
1998
-
The structure of logarithmic advice complexity classes
Theoretical Computer Science, Vol. 207, Núm. 1, pp. 217-244
1995
-
Learnability of kolmogorov-easy circuit expressions via queries
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1994
-
A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
Mathematical Systems Theory, Vol. 27, Núm. 4, pp. 347-356