- Front Matter
- 10.1016/s1571-0661(05)80743-1
Preface: Volume 82, Issue 5
- Apr 01, 2003
- Electronic Notes in Theoretical Computer Science
- Uwe Assmann + 4 more +4
Preface: Volume 82, Issue 5
Preface: Volume 59, Issue 4
Preface: Volume 82, Issue 5
Preface: Volume 82, Issue 5
Preface: Volume 50, Issue 4
Preface: Volume 50, Issue 4
Preface: Volume 89, Issue 2
Preface: Volume 89, Issue 2
Topological Cones: Foundations for a Domain Theoretical Semantics Combining Probability and Nondeterminism
Topological Cones: Foundations for a Domain Theoretical Semantics Combining Probability and Nondeterminism
Preface: Volume 81
Preface: Volume 81
The Dual Complexity Space as the Dual of a Normed Cone
The Dual Complexity Space as the Dual of a Normed Cone
The correspondence between partial metrics and semivaluations
The correspondence between partial metrics and semivaluations
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking
Machine-checked Proof of the Church-Rosser Theorem for the Lambda Calculus Using the Barendregt Variable Convention in Constructive Type Theory
In this article we continue the work started in [Ernesto Copello, Álvaro Tasistro, Nora Szasz, Ana Bove, and Maribel Fernández. Alpha-structural induction and recursion for the λ-calculus in constructive type theory. Electronic Notes in Theoretical Computer Science, 323:109–124, 2016], deriving in Constructive Type Theory new induction principles for the λ-calculus, using (the historical) first order syntax with only one sort of names for both bound and free variables, and with α-conversion based upon name swapping. The principles provide a flexible framework for mimicking pen-and-paper proofs within the rigorous formal setting of a proof assistant. We here report on one successful application, namely a complete proof of the Church-Rosser Theorem. The whole development has been machine-checked using the system Agda [Ulf Norell. Towards a Practical Programming Language Based on Dependent Type Theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, September 2007].
Read moreRETRACTED: Semantic Domains for Combining Probability and Non-Determinism
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Preface: Volume 52, Issue 2
Preface: Volume 52, Issue 2
Institutions for logic programming
Institutions for logic programming
Probabilistic logic programming with conditional constraints
We introduce a new approach to probabilistic logic programming in which probabilities are defined over a set of possible worlds. More precisely, classical program clauses are extended by a subinterval of [0,1] that describes a range for the conditional probability of the head of a clause given its body. We then analyze the complexity of selected probabilistic logic programming tasks. It turns out that probabilistic logic programming is computationally more complex than classical logic programming, More precisely, the tractability of special cases of classical logic programming generally does not carry over to the corresponding special cases of probabilistic logic programming. Moreover, we also draw a precise picture of the complexity of deciding and computing tight logical consequences in probabilistic reasoning with conditional constraints in general. We then present linear optimization techniques for deciding satisfiability and computing tight logical consequencesof probabilistic logic programs. These techniques are efficient in the special case in which we have little relevant purely probabilistic knowledge. We finally show that probabilistic logic programming under certain syntactic and semantic restrictions is closely related to van Emden's quantitative deduction, and thus has computational properties similar to calssical logic programming. Based on this result, we present an efficient approximation technique for probabilistic logic programming.
Read moreEuropean Journal of Geography (Year 2023): Reviewer Appreciation & Publication Recap
As we begin a new year full of potential and opportunity, we wish each of you much joy and success. As we embark on this journey, we also celebrate a significant milestone -the fifteenth anniversary of the European Journal of Geography. Over the past decade and a half, our journal has become a beacon of excellence in the field of geography and the social sciences. This journey has been characterised by unwavering commitment and tireless dedication, a collective endeavour led by the dedicated members of our editorial team and the European Association of Geographers (EUROGEO). Their diligence and passion have been instrumental in making our journal the respected publication it is today. Looking back on our shared history, we are proud to have published over 310 articles dealing with key topics in geography, planning and development. These scholarly contributions have not only explored and analysed important topics, but have also introduced new ideas (Koutsopoulos, 2022; Manetos et al., 2022 ), methods (Cramer-Greenbaum, 2023; Krevs et al., 2023; Morawski & Wolff-Seidel, 2023) and data (Hojati & Mokarram, 2016) that will inspire future generations of geographers to transcend conventional disciplinary boundaries. The richness of our content encompasses numerous facets and includes the fields of geography education (
Read moreThe Pebble Game and Logics of Programs
The Pebble Game and Logics of Programs