3 resultados para 3-valued paraconsistent logic

em Aston University Research Archive


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Using the magnetization enumerator method, we evaluate the practical and theoretical limitations of symmetric channels with real outputs. Results are presented for several regular Gallager code constructions.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Processes of European integration and growing consumer scrutiny of public services have served to place the spotlight on the traditional French model of public/private interaction in the urban services domain. This article discusses recent debates within France of the institutionalised approach to local public/private partnership, and presents case study evidence from three urban agglomerations of a possible divergence from this approach. Drawing on the work of French academic, Dominique Lorrain, whose historical institutionalist accounts of the French model are perhaps the most comprehensive and best known, the article develops two hypotheses of institutional change, one from the historical institutionalist perspective of institutional stability and persistence, and the other from an explicitly sociological perspective, which emphasises the legitimating benefits of following appropriate rules of conduct. It argues that further studying the French model as an institution offers valuable empirical insight into processes of institutional change and persistence. © 2004 Taylor & Francis Ltd.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

As the Semantic Web is an open, complex and constantly evolving medium, it is the norm, but not exception that information at different sites is incomplete or inconsistent. This poses challenges for the engineering and development of agent systems on the Semantic Web, since autonomous software agents need to understand, process and aggregate this information. Ontology language OWL provides core language constructs to semantically markup resources on the Semantic Web, on which software agents interact and cooperate to accomplish complex tasks. However, as OWL was designed on top of (a subset of) classic predicate logic, it lacks the ability to reason about inconsistent or incomplete information. Belief-augmented Frames (BAF) is a frame-based logic system that associates with each frame a supporting and a refuting belief value. In this paper, we propose a new ontology language Belief-augmented OWL (BOWL) by integrating OWL DL and BAF to incorporate the notion of confidence. BOWL is paraconsistent, hence it can perform useful reasoning services in the presence of inconsistencies and incompleteness. We define the abstract syntax and semantics of BOWL by extending those of OWL. We have proposed reasoning algorithms for various reasoning tasks in the BOWL framework and we have implemented the algorithms using the constraint logic programming framework. One example in the sensor fusion domain is presented to demonstrate the application of BOWL.