•  53
    The PCF Conjecture and Large Cardinals
    Journal of Symbolic Logic 73 (2). 2008.
    We prove that a combinatorial consequence of the negation of the PCF conjecture for intervals, involving free subsets relative to set mappings, is not implied by even the strongest known large cardinal axiom
  •  13
    Applications of the topological representation of the pcf-structure
    Archive for Mathematical Logic 47 (5): 517-527. 2008.
    We consider simplified representation theorems in pcf-theory and, in particular, we prove that if ${\aleph_{\omega}^{\aleph_{0}} > \aleph_{\omega_{1}}\cdot2^{\aleph_{0}}}$ then there are cofinally many sequences of regular cardinals such that ${\aleph_{\omega_{1}+1}}$ is represented by these sequences modulo the ideal of finite subsets, using a topological approach to the pcf-structure
  •  12
    Hybrid Probabilistic Logic Programs as Residuated Logic Programs
    with Carlos Damásio
    Studia Logica 72 (1): 113-138. 2002.
    In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (definite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the first time a framework encompassing several quite distinct logic programming semantics is described, namely Generalized Annotated Logic Programs, F…Read more
  •  8
    Logics in Artificial Intelligence: European Workshop, JELIA 2000 Malaga, Spain, September 29 - October 2, 2000 Proceedings (review)
    with Manuel Ojeda-Aciego, Inma P. De Guzman, and Gerhard Brewka
    Springer Verlag. 2000.
    This book constitutes the refereed proceedings of the European Workshop on Logics in Artificial Intelligence, JELIA 2000, held in Malaga, Spain in September/October 2000. The 24 revised full papers presented together with three invited papers were carefully reviewed and selected out of 60 submissions. The papers are organized in topical sections on knowledge representation, reasoning about actions, belief revision, theorem proving, argumentation, agents, decidability and complexity, updates, and…Read more
  •  6
    Counterfactuals are conjectures about what would have happened, had an alternative event occurred. It provides lessons for the future by virtue of contemplating alternatives; it permits thought debugging; it supports a justification why different alternatives would have been worse or not better. Typical expressions are: “If only I were taller …”, “I could have been a winner …”, “I would have passed, were it not for …”, “Even if... the same would follow”. Counterfactuals have been well studied in…Read more
  •  5
    Computational Logic — CL 2000: First International Conference London, UK, July 24–28, 2000 Proceedings
    with John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Yehoshua Sagiv, and Peter J. Stuckey
    Springer Verlag. 2000.
    These are the proceedings of the First International Conference on Compu- tional Logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. The conference was collocated with the following events: { 6th International Conference on Rules and Objects in Da…Read more
  • Counterfactual Thinking in Cooperation Dynamics
    In Matthieu Fontaine, Cristina Barés-Gómez, Francisco Salguero-Lamillar, Lorenzo Magnani & Ángel Nepomuceno-Fernández (eds.), Model-Based Reasoning in Science and Technology: Inferential Models for Logic, Language, Cognition and Computation, Springer Verlag. 2019.