Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or r...

Abstract Since the Islamic Revolution of 1987, Iran has been affected by economic sanctions imposed by Western countries, especially the U.S. Since 2006 and with the development of the Iranian nuclear conflict, the United Nations has frequently imposed economic and financial sanctions against Iran. As a result of these international restrictions and their administration by an international or...

Marsha Garrison1 and Michele Goodwin2 have each written clever, edgy, and insightful articles on the oversight of new reproductive technologies. Both of them frame the issues around the regulation of reproduction, not assisted reproduction. “Assisted reproduction” might mean doctors, clinics, or patients. “Reproduction” clearly means mothers. Both are correct in this recognition: the regulation...

In this paper we present an underspeci ed logic, i.e. a pair consisting of a proper underspeci ed semantic representation formalism and a deductive component that directly operates on these structures. We show how the main features of this formalism can be imported into other existing underspeci ed semantic representation formalisms. We also show that deduction rules may be imported there along...

Input: set of items S = {1, ..., n} with size (0 ≤ si ≤ 1) ∈ Q. Question: Can we partition S into two parts S′ and S − S′ such that ∑ i∈S Si = ∑ j∈S−S′ Sj? Let I be an instance of partition. Scale all Si’s such that ∑ Si = 2 and let this instance I ′ be the input to Bin Packing. If all items of I ′ fit into 2 bins, since their total sum is 2, both bins must be full and therefore I is a yes inst...

Given a string x and a decision problem L, there is an omniscient prover who sends a string π ∈ {0, 1} to a polytime deterministic algorithm called a verifier V , and V (x, π) runs in polynomial time and returns 1 if x is a YES-instance and 0 if x is a NO-instance. The verifier must satisfy the properties of soundness and completeness: in particular, if x is a YES-instance of L, then there exis...