A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry
2015
Logical Methods in Computer Science
Preserved Fulltext
Other Versions
An algorithm for unification modulo one-sided distributivity is an early result by Tid\'en and Arnborg. ...
Next we present a new polynomial algorithm that solves the decision problem for unification modulo one-sided distributivity. ...
problem for unification modulo one-sided distributivity. (3) We developed the first algorithm that solves the asymmetric unification problem for unification modulo one-sided distributivity. ...
doi:10.2168/lmcs-11(2:11)2015
fatcat:tcjmrfmvnzghbbbzsgqpsnidla
Algorithmic correspondence and canonicity for distributive modal logic
2012
Annals of Pure and Applied Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We define the algorithm ALBA for the language of the same distributive modal logic (DML) for which a Sahlqvist theorem was proved by Gehrke, Nagahashi, and Venema. ...
As their name suggests, evidence is given to the effect that inductive inequalities are the distributive counterpart of the inductive formulas of Goranko and Vakarelov in the classical setting. ...
the second author was supported by the VENI grant 639.031.726 of the Netherlands Organization for Scientific Research (NWO).We would also like thank the anonymous reviewer for a very thorough reading and ...
doi:10.1016/j.apal.2011.10.004
fatcat:kbfh6iqoy5hvrifa6w47uau2ue
On the Importance of Asymmetry and Monotonicity Constraints in Maximal Correlation Analysis
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1901.03590v1 fatcat:6u4gs2f64babxhhxrtrhkbcvua
natural variant of the maximal correlation coefficient as well as a modified conditional expectation algorithm to compute it. ...
Specifically, the maximal correlation coefficient equals one too easily whereas the correlation ratio equals zero too easily. ...
Assume that the response Y is distributed uniformly over the interval [− 10, 10] and that X = X = Y Y > 9 X = N 1 otherwise (17) where N 1 ∼ Unif([−1, 1]) and is independent of Y . 8 Note that this ...
arXiv:1901.03590v2
fatcat:udjtjqxh4nc7jaf5inzzmom3eq
Alice and Bob Meet Equational Theories
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Dedicated to José Meseguer on his 65th Birthday. Abstract. Cryptographic protocols are the backbone of secure communication over open networks and their correctness is therefore crucial. ...
Our translation supports specification modulo equational theories, which enables the faithful representation of algebraic properties of a large class of cryptographic operators. ...
Using Maude's [11] unification capabilities, Maude-NPA then reasons modulo equational theories. ...
doi:10.1007/978-3-319-23165-5_7
fatcat:yxlew5xsxjaf7fcjw3hhi57ai4
Formalization and Parsing of Typed Unification-Based ID/LP Grammars
[article]
1995
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper defines unification based ID/LP grammars based on typed feature structures as nonterminals and proposes a variant of Earley's algorithm to decide whether a given input sentence is a member of ...
A solution to the problem of the nonlocal flow of information in unification ID/LP grammars as discussed in Seiffert (1991) is incorporated into the algorithm. ...
The actual parsing algorithm is a variant of bottom{ up ltering (Blache and Morin 1990) . ...
arXiv:cmp-lg/9502020v1
fatcat:cktt6dsbrvhupgxzg2qqgtym4m
A typed foundation for directional logic programming
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The benefits of directionality include freedom from explicit sequential control, the ability to reason about algorithmic properties of programs (such as termination, complexity and deadlock-freedom) and ...
It seems that the asymmetry between inputs and outputs present in functional programming does not fit well with linear logic. ...
Acknowledgements I am indebted to Dick Kieburtz and Boris Agapiev for introducing me to the fascinating world of linear logic. ...
doi:10.1007/3-540-56454-3_15
fatcat:acojkdpbnbhszdv4saw45m3jjm
Nominal logic programming
2008
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This article investigates logic programming based on nominal logic. ...
Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence ...
His support for me and this work has been unyielding. My other committee members, Robert Constable and Geri Gay, have also been very supportive. ...
doi:10.1145/1387673.1387675
fatcat:longqgnr75aktkwdy56eeyu4ne
Transformational program development in a particular problem domain
1986
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The transformational development of non-trivial algorithms in a particular problem domain has important impacts: On the one hand, the systematic derivation of complex algorithms helps in understanding ...
On the other hand, analyzing efficient algorithms from a particular problem domain allows to acquire knowledge for formal program development in general and for solving related problems in particular. ...
Acknowledgment This paper was inspired by work done in the Munich CIP group and by discussions with members of IFIP Working Group 2.1 over the last couple of years. Particular ...
doi:10.1016/0167-6423(86)90008-0
fatcat:t5c5csf3f5fuve6wvy4mhmyvfq
THE NEXT-TO-MINIMAL SUPERSYMMETRIC EXTENSION OF THE STANDARD MODEL REVIEWED
2010
International Journal of Modern Physics A
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2009 pre-print arXiv:0906.0777v1 fatcat:kby6kwmnn5hvlgaspr7xf4mldaOther Versions
After an introduction to the model, the Higgs sector and the neutralino sector are discussed in detail. Theoretical, experimental, and cosmological constraints are studied. ...
Emphasis is placed on aspects which are different from the minimal supersymmetric extension. ...
Zerwas for carefully studying this review and especially for his critical remarks and fruitful suggestions. ...
doi:10.1142/s0217751x10049827
fatcat:5eemxkskafbibnsddtxsoecik4
SLDNFA: An abductive procedure for abductive logic programs
1998
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The formalization of SLDNFA presented here is an update of an older version and does not rely on skolemization of abductive atoms. ...
D We present SLDNFA, an extension of SLDNF resolution for abductive reasoning on abductive logic programs. ...
It follows directly from the correctness of the unification algorithm that the equality reduction algorithm terminates and that the algorithm reports failure iff E has no solved form and ~ ~. ~ B(E). ...
doi:10.1016/s0743-1066(97)00074-5
fatcat:vctmh2th5fhodad7lj5nrc5qda
A Survey on String Constraint Solving
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2002.02376v6 fatcat:nbqihxzv2rekxe4rkzruuw6kwaOther Versions
This paper reports a comprehensive survey on string constraint solving by exploring the large number of approaches that have been proposed over the last decades to solve string constraints. ...
String solving approaches have become popular over the last years given the massive use of strings in different application domains like formal analysis, automated testing, database query processing, and ...
In particular, a number of proposals based on the satisfiability modulo theory (SMT) [30] paradigm emerged. ...
arXiv:2002.02376v8
fatcat:why6oeufmrbozbl22jlf7yivea
Algorithmic Bayesian persuasion
2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
As our main technical tool to prove this theorem, we study the algorithmics of a natural and abstract question on vector spaces, which we term dispersion testing: Given two distributions A and B supported ...
When the payoffs of various actions follow a joint distribution (the common prior), the sender's problem is nontrivial, and its complexity depends on the representation of the prior. ...
The lemma follows from Theorems 4.4 and 2.3, modulo bounds on the volume of the feasible set and a circumscribing ellipsoid. ...
doi:10.1145/2897518.2897583
dblp:conf/stoc/DughmiX16
fatcat:3r3nppvuprdp5kh6onvhegmy2e
Applying Secure Multi-Party Computation In Practice
2017
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We will first give a brief overview of the current state of the art, bring out several shortcomings and address them. ...
The main contribution of this work is an end-to-end process description of deploying secure multi-party computation for the first large-scale registry-based statistical study on linked databases. ...
This size unification idea is given as Algorithm 4. The mask-and-mix phase uses two shared binary vectors b and c to keep track of fake rows. ...
doi:10.5281/zenodo.1116316
fatcat:jhzsyrgt2beptj6jdb6axtvzfy
Diachronic Semantics
2015
Annual Review of Linguistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This article reviews developments and results from grammaticalization, typology, and formal semantics/pragmatics that can be brought to bear on addressing the problem of semantic change. ...
semantics/pragmatics and language change. ...
(modulo R)] and the speakeroriented R-principle [Say no more than you must! (modulo Q)]. ...
doi:10.1146/annurev-linguist-030514-125100
fatcat:wd7qmgx6zreyla77qcwqdypo3m
The DNA Storage Channel: Capacity and Error Probability
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For a constant coverage depth M/N and molecule length scaling Θ(log M), lower (achievability) and upper (converse) bounds on the capacity of the channel, as well as a lower (achievability) bound on the ...
Both the lower and upper bounds on the capacity generalize a bound which was previously known to hold only for the binary symmetric sequencing channel, and only under certain restrictions on the molecule ...
Let P (unif) X be the uniform distribution over X , and let β (unif) cr (α, W ) := 2 CID(P (unif) X , W ) . ( 36 ) Then, for all β > β (unif) cr (α, W ) the capacity of the DNA channel with modulo-additive ...
arXiv:2109.12549v2
fatcat:4isv5yn32fbqhjdl6uohfjgfja
« Previous
Showing results 1 — 15 out of 237 results