This article investigates best-price clauses as a strategic device to facilitate collusion in a dynamic duopoly game. Best-price clauses guarantee rebates on the purchase price if a customer finds a better price after his purchase. Two different price clauses are distinguished: "most favored customer" and "meet or release." I examine the collusive potential of both clauses in a finite-horizon d...

In this paper, we introduce ordered clauses as defined a sequence of literals, and investigate the properties of generalizations for ordered clauses. Furthermore, we show that the subsumption problem for ordered clauses is NP-complete, as similar as the subsumption problem for ordinal clauses. Hence, the definition that a clause is a set of literals is inessential for the intractability of subs...

We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies a variety of deduction modes. These include different strategies such as set of support, as well as explicit case analysis, e.g., splitting. From a practical perspective, labelled clauses offer advantages in the case...

In this chapter, we examine the typology of relative clauses. We will define relative clauses as follows: (1) A relative clause (RC) is a subordinate clause which delimits the reference of an NP by specifying the role of the referent of that NP in the situation described by the RC. Since the NP whose reference is being delimited is in the matrix clause, we will call it NP mat , and we will call...

Given a family of Horn clauses, what is the minimal number of Horn clauses implying all other clauses in the family? What is the maximal number of Horn clauses from the family without having resolvents of a certain kind? We consider various problems of this type, and give some sharp bounds. We also consider the probability that a random family of a given size implies all other clauses in the fa...

Clause-elimination techniques that simplify formulas by removing redundant clauses play an important role in modern SAT solving. Among the types of redundant clauses, blocked clauses are particularly popular. For checking whether a clause C is blocked in a formula F , one only needs to consider the so-called resolution neighborhood of C, i.e., the set of clauses that can be resolved with C. Bec...

Abstract This work investigates the syntax of nominal modification involving linker a in Siwkolan Amis, one dialects an Austronesian language spoken Taiwan. Based on two observed types NP-ellipsis patterns and formal licensing condition, I argue that Amis displays modification. Modifiers direct are functional heads projecting extended projections NP, whereas those indirect modifier phrases base...