Universitat Politècnica de Catalunya-ko ikertzaileekin lankidetzan egindako argitalpenak (10)

2013

  1. Invariant-free clausal temporal resolution

    Journal of Automated Reasoning, Vol. 50, Núm. 1, pp. 1-49

2009

  1. Dual Systems of Tableaux and Sequents for PLTL

    Journal of Logic and Algebraic Programming, Vol. 78, Núm. 8, pp. 701-722

2008

  1. A functorial framework for constraint normal logic programming

    Applied Categorical Structures, Vol. 16, Núm. 3, pp. 421-450

2007

  1. 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

  1. 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

  1. Constructive negation by bottom-up computation of literal answers

    Proceedings of the ACM Symposium on Applied Computing

1999

  1. 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

  1. The structure of logarithmic advice complexity classes

    Theoretical Computer Science, Vol. 207, Núm. 1, pp. 217-244

1995

  1. 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

  1. A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity

    Mathematical Systems Theory, Vol. 27, Núm. 4, pp. 347-356