Disjunctive Closures for Knowledge Compilation

Each new line corresponds to a transition : the left-end of the memory is modified, depending on the top(i.e. leftmost symbol) of the stack and on the input-letter. Such an automaton

In particular, the expressive power of fragments of monadic second-order logic and various fixed- point logics has already been investigated in some of the earliest papers in finite

More recently, based on an analysis of independent person pronouns, Veerman-Leichsenring (2000b: 336) suggests that Ixcatec was first in contact with Mazatec and

We consider four representation languages: NPDDL, which is a grounded, nondeterministic version of PDDL, a language typically used for specifying actions (by a do- main

The distinctions among these calculi arise from issues such as the process constructions considered (i.e., the language of processes), the methods used for giving meaning to

We present a toy programming language supporting higher-order functions, extensible records and polymorphic variants, as well as a sufficient condition (that can be tested in

We then give our results: in Section 4 we prove positive results about polynomial-time transla- tions between the languages, then in Section 5 we study the complexity of

Abstract The paper deals with the class REC of recognizable picture languages, UREC its unambiguous variant and co-REC the complement class of REC.. The aim of this paper is