Expressividade e complexidade em lógicas preferenciais, híbridas e de grau limitado

Detalhes bibliográficos
Ano de defesa: 2012
Autor(a) principal: Ferreira, Francicleber Martins
Orientador(a): Não Informado pela instituição
Banca de defesa: Não Informado pela instituição
Tipo de documento: Tese
Tipo de acesso: Acesso aberto
Idioma: por
Instituição de defesa: Não Informado pela instituição
Programa de Pós-Graduação: Não Informado pela instituição
Departamento: Não Informado pela instituição
País: Não Informado pela instituição
Palavras-chave em Português:
Link de acesso: http://www.repositorio.ufc.br/handle/riufc/18677
Resumo: We investigate the model theory of Preferential Logics, Hybrid Logic and fragments of Second-Order Logic with respect to finite models. The semantics of these logics differ from the semantics of classical logics either by using relations between models or by restricting the cardinality of the models considered. This work has three main parts. In the first part of this work we study the model theory of preferential logics. Preferential logics arise in the context of nonmonotonic reasoning in Artificial Intelligence. The main characteristic of those logics is the existence of a relation between models. It allows the definition of a nonmonotonic consequence relation by considering the minimal models of a set of sentences. Using the approach of Abstract Model Theory we generalize some expressiveness results to classes of preferential logics. We show that whenever a class of minimal models of a finite set of sentences is axiomatizable, without considering the preference relation, then it is finitely axiomatizable. We also show that when such class of minimal models implicitly defines a symbol, then the finite axiomatization can be put in a very specic form, namely, the initial set of sentences plus a explicit definition for the symbol. In the second part of this work, we investigate the finite model theory of Hybrid Logic. Hybrid Logics are extensions of modal logics with hybrid terms which refer to single states in a Kripke model. We study the complexity of the model- and frame-checking problems for Hybrid Logic. We show that for each graph problem in the Polynomial Hierarchy and each natural number n there is a formula which expresses this problem for graphs of cardinality n. We also show that the size of such formulas is bounded by a polynomial in n. We show that one can disregard the global modalities if one consider only connected graphs with loops. We define fragments which correspond to each degree of the Polynomial Hierarchy. This leads to an alternative proof of the NP-hardness of the model-checking problem for an specic fragment of Full Hybrid Logic. In the last part of this work, we explore the descriptive complexity of the logic obtained by restricting second-order quantication to relations of bounded degree. Based on previous work from Schwentick et al. and Grandjean and Olive, we introduce the Bounded-Degree Second-Order Logic and show that it captures the class ALIN of classes of unary structures accepted by a alternating random access machine in linear time and bounded number of alternations. We also extend this logic with the transitive closure operator on high-order relations on bounded-degree relations. We show that the Bounded-Degree Second-Order Logic with Transitive Closure Operator captures linear number of registers in a nondeterministic random access machine provided that registers store values bounded by a linear function in the cardinality of the input structure.