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 ...
Decision lists and decision trees are two models of computation for boolean functions. Blum has sho...
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
AbstractThe founding idea of linear logic is the duality between A and A⊥, with values in ⊥. This id...
AbstractNotational definitions are pervasive in mathematical practic and are therefore supported in ...
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is t...
AbstractIn this paper we formalise CSP solving as an inference process. Based on the notion of Compu...
When proving theorems by explicit induction the used induction orderings are synthesized from the re...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
Necessary and sufficient conditions for metric regularity of (several joint) probabilistic constrain...
AbstractLight linear logic [1] is a refinement of the propositions-as-types paradigm to polynomial-t...
AbstractThis article describes how the use of a higher-order syntax representation of contexts [due ...
AbstractMotivated by a model for syntactic control of interference, we introduce a general categoric...
AbstractIt is shown that top-down tree transducers are as powerful as sharing-free tree-to-graph-to-...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
AbstractWe make an initial step towards a categorical semantics of guarded induction. While ordinary...
Decision lists and decision trees are two models of computation for boolean functions. Blum has sho...
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
AbstractThe founding idea of linear logic is the duality between A and A⊥, with values in ⊥. This id...
AbstractNotational definitions are pervasive in mathematical practic and are therefore supported in ...
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is t...
AbstractIn this paper we formalise CSP solving as an inference process. Based on the notion of Compu...
When proving theorems by explicit induction the used induction orderings are synthesized from the re...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
Necessary and sufficient conditions for metric regularity of (several joint) probabilistic constrain...
AbstractLight linear logic [1] is a refinement of the propositions-as-types paradigm to polynomial-t...
AbstractThis article describes how the use of a higher-order syntax representation of contexts [due ...
AbstractMotivated by a model for syntactic control of interference, we introduce a general categoric...
AbstractIt is shown that top-down tree transducers are as powerful as sharing-free tree-to-graph-to-...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
AbstractWe make an initial step towards a categorical semantics of guarded induction. While ordinary...
Decision lists and decision trees are two models of computation for boolean functions. Blum has sho...
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
AbstractThe founding idea of linear logic is the duality between A and A⊥, with values in ⊥. This id...