A west ordering is a well-founded (strict partial) ordering on terms that satisfies the subterm property. In [Bofill, Godoy, Nieuwenhuis, Rubio, (BGNR-LICS99)] the completeness of an ordered paramodulation inference system w.r.t. west orderings was proved, thus dropping for the first time the monotonicity requirements on the ordering. However, the inference system still required the eager selection of negative equations. Here we improve upon [BGNR-LICS99] in two directions. On the one hand, we show that the results are compatible with constraint inheritance and the so-called basic strategy [(Bachmair, Ganzinger, Lynch, Snyder (1995IC)), (Nieuwenhuis, Rubio (1995JSC))], thus further restricting the search space. On the ...
This work presents a systematic study of the preservation of supermodularity under parametric optimi...
AbstractComplete paramodulation strategies are developed for clauses with symbolic constraints and b...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
A west ordering is a well-founded (strict partial) ordering on terms that satisfies the subterm pro...
We introduce a class of restrictions for the ordered paramodulation and superposition calculi (inspi...
We introduce a class of restrictions for the ordered paramodulation and superposition calculi (inspi...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
We introduce a class of restrictions for the ordered paramodulation and \u000Asuperposition calculi ...
Abstract For many years, all existing completeness results for Knuth-Bendix completion and ordered p...
Recently, Udwani defined a new class of set functions under monotonicity and subadditivity, called s...
AbstractWe introduce a class of restrictions for the ordered paramodulation and superposition calcul...
For non-monotonic reasoning, explicit orderingsover formulae offer an important solution to prob-lem...
Recently, Udwani defined a new class of set functions under monotonicity and subadditivity, called s...
The Monotone Response and Selection (MRS) Theorems in lattice programming provide a sufficient cond...
This work presents a systematic study of the preservation of supermodularity under parametric optimi...
AbstractComplete paramodulation strategies are developed for clauses with symbolic constraints and b...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
A west ordering is a well-founded (strict partial) ordering on terms that satisfies the subterm pro...
We introduce a class of restrictions for the ordered paramodulation and superposition calculi (inspi...
We introduce a class of restrictions for the ordered paramodulation and superposition calculi (inspi...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
An ordering on a lattice is quasisupermodular if and only if inserting it into any parametric optimi...
We introduce a class of restrictions for the ordered paramodulation and \u000Asuperposition calculi ...
Abstract For many years, all existing completeness results for Knuth-Bendix completion and ordered p...
Recently, Udwani defined a new class of set functions under monotonicity and subadditivity, called s...
AbstractWe introduce a class of restrictions for the ordered paramodulation and superposition calcul...
For non-monotonic reasoning, explicit orderingsover formulae offer an important solution to prob-lem...
Recently, Udwani defined a new class of set functions under monotonicity and subadditivity, called s...
The Monotone Response and Selection (MRS) Theorems in lattice programming provide a sufficient cond...
This work presents a systematic study of the preservation of supermodularity under parametric optimi...
AbstractComplete paramodulation strategies are developed for clauses with symbolic constraints and b...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...