2 resultados para Parshall et al algorithm
Resumo:
Ce titre s’inscrit dans le thème de Braga de Macedo et al. (2013c): globalisation, démocratie et développement. La section 2 discute les intéractions complexes entre globalisation, gouvernance et développement d’un côté et entre réformes et élections de l’autre. La section 3 introduit la « differentialité » des pays et son rapport avec le multilatéralisme basé sur la culture d’un côté et la pression par les pairs de l’autre. La section 4 quantifie les interactions positives et négatives en distinguant les pays de l’OCDE des pays en développement. La section 5 avance que ces résultats permettront de mettre à jour les perceptions des économistes sur la crise, peut être sous la forme d’une lettre à la reine, utilisée par des économistes britanniques mais élargie aux pays lusophones.
Resumo:
Ontologies formalized by means of Description Logics (DLs) and rules in the form of Logic Programs (LPs) are two prominent formalisms in the field of Knowledge Representation and Reasoning. While DLs adhere to the OpenWorld Assumption and are suited for taxonomic reasoning, LPs implement reasoning under the Closed World Assumption, so that default knowledge can be expressed. However, for many applications it is useful to have a means that allows reasoning over an open domain and expressing rules with exceptions at the same time. Hybrid MKNF knowledge bases make such a means available by formalizing DLs and LPs in a common logic, the Logic of Minimal Knowledge and Negation as Failure (MKNF). Since rules and ontologies are used in open environments such as the Semantic Web, inconsistencies cannot always be avoided. This poses a problem due to the Principle of Explosion, which holds in classical logics. Paraconsistent Logics offer a solution to this issue by assigning meaningful models even to contradictory sets of formulas. Consequently, paraconsistent semantics for DLs and LPs have been investigated intensively. Our goal is to apply the paraconsistent approach to the combination of DLs and LPs in hybrid MKNF knowledge bases. In this thesis, a new six-valued semantics for hybrid MKNF knowledge bases is introduced, extending the three-valued approach by Knorr et al., which is based on the wellfounded semantics for logic programs. Additionally, a procedural way of computing paraconsistent well-founded models for hybrid MKNF knowledge bases by means of an alternating fixpoint construction is presented and it is proven that the algorithm is sound and complete w.r.t. the model-theoretic characterization of the semantics. Moreover, it is shown that the new semantics is faithful w.r.t. well-studied paraconsistent semantics for DLs and LPs, respectively, and maintains the efficiency of the approach it extends.