A learning framework that combines the two frameworks of explanatory and descriptive In ­ ductive Logic Programming (ILP) is presented. The induced hypotheses in this framework are pairs of the form (T, IC) where T is a defi­ nite clausal theory and IC is a set of integrity constraints. The two components allow us to combine complementary information from the same data by applying both explanat...

In this article we give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture on Borel functions from an analytic subset of a Polish space into a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to prove that several prominent results in recursion t...

Objective: to analyze the perception of nurses about the systematization of nursing care in the perspective of professional autonomy. Methods: a descriptive and exploratory research, carried out with 24 nurses at five inpatient clinics of a large-scale public teaching hospital, through a structured questionnaire evaluated by experts. Data were analyzed using descriptive statistics. Results: nur...

This is a quantitative exploratory, descriptive study performed with the objective to identify and analyze the performance of the average time of nursing care delivered to patients of the Inpatient Units of the University Hospital at University of São Paulo (UH-USP), from 2001 to 2005. The average nursing care time delivered to patients of the referred units was identified by applying of a math...

State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state complexity of regular languages and their operations. In particular, we compare the state complexity results on regular languages with those on nite languages.

In this paper we present logical characterizations of two preorders, within the framework of Hennessy-Milner Logics. The two preorders (loosely termed bisimulation-based efficiency preorders) are on processes represented as labelled transition systems. The characterizations are particularly interesting as they explore preorders lying between strong and weak bisimilarity, guided by a principle o...

A new distance function dist (A,B) for fuzzy sets A and B is introduced. It is based on the descriptive complexity, i.e., the number of bits (on average) that are needed to describe an element in the symmetric difference of the two sets. The distance gives the amount of additional information needed to describe any one of the two sets given the other. We prove its mathematical properties and pe...

Syntactic constraints in Koskenniemi's Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turns out that although the constraints in Voutilainen's (1994) FSIG description of English make use of several extensions to regular expressions, the description as a whole reduces to a finite combination of union, compleme...