On the Injectivity of the Parikh Matrix Mapping
In this paper we investigate the injectivity of the Parikh matrix mapping. This research is done mainly on the binary alphabet. We identify a family of binary words, refered to as ``palindromic amiable'', such that two such words are palindromic amiable ...
Relaxed Update and Partition Network Games
In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite duration. We consider the cases (1) ...
Optimal Unification and Learning Algorithms for Categorial Grammars
In this paper continuing [1], we present a more general approach to restricted optimal unification, introduced and applied to learning algorithms for categorial grammars in [2] and further developed in [7,8,4,5]. We introduce a procedure of finding ...
Processing Indefinite Deductive Databases under the Possible Model Semantics
The relationship between possible and supported models of unstratified indefinite deductive databases is studied, when disjunction is interpreted inclusively. Possible and supported models are shown to coincide under a suitable definition of ...
A New Bayesian Tree Learning Method with Reduced Time and Space Complexity
Bayesian networks have many practical applications due to their capability to represent joint probability distribution in many variables in a compact way. There exist efficient reasoning methods for Bayesian networks. Many algorithms for learning ...
PathLog: a Query Language for Schemaless Databases of Partially Labeled Objects
In the paper we deal with the problem of modeling and querying information in schemaless databases of partially labeled objects (PLO-DB). Partially labeled objects are used for modeling data within repositories integrating both structured and ...
