995 resultados para 3-valued paraconsistent logic


Relevância:

40.00% 40.00%

Publicador:

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.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In the paper Busaniche and Cignoli (2009) we presented a quasivariety of commutative residuated lattices, called NPc-lattices, that serves as an algebraic semantics for paraconsistent Nelson's logic. In the present paper we show that NPc-lattices form a subvariety of the variety of commutative residuated lattices, we study congruences of NPc-lattices and some subvarieties of NPc-lattices.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Content Addressable Memory (CAM) is a special type of Complementary Metal-Oxide-Semiconductor (CMOS) storage element that allows for a parallel search operation on a memory stack in addition to the read and write operations yielded by a conventional SRAM storage array. In practice, it is often desirable to be able to store a “don’t care” state for faster searching operation. However, commercially available CAM chips are forced to accomplish this functionality by having to include two binary memory storage elements per CAM cell,which is a waste of precious area and power resources. This research presents a novel CAM circuit that achieves the “don’t care” functionality with a single ternary memory storage element. Using the recent development of multiple-voltage-threshold (MVT) CMOS transistors, the functionality of the proposed circuit is validated and characteristics for performance, power consumption, noise immunity, and silicon area are presented. This workpresents the following contributions to the field of CAM and ternary-valued logic:• We present a novel Simple Ternary Inverter (STI) transistor geometry scheme for achieving ternary-valued functionality in existing SOI-CMOS 0.18µm processes.• We present a novel Ternary Content Addressable Memory based on Three-Valued Logic (3CAM) as a single-storage-element CAM cell with “don’t care” functionality.• We explore the application of macro partitioning schemes to our proposed 3CAM array to observe the benefits and tradeoffs of architecture design in the context of power, delay, and area.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

A Hennessy-Milner property, relating modal equivalence and bisimulations, is defined for many-valued modal logics that combine a local semantics based on a complete MTL-chain (a linearly ordered commutative integral residuated lattice) with crisp Kripke frames. A necessary and sufficient algebraic condition is then provided for the class of image-finite models of these logics to admit the Hennessy-Milner property. Complete characterizations are obtained in the case of many-valued modal logics based on BL-chains (divisible MTL-chains) that are finite or have universe [0,1], including crisp Lukasiewicz, Gödel, and product modal logics.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A saddle shaped tetracluster porphyrin species containing four [Ru(3)O(OAc)(6)(py)(2)](+) clusters coordinated to the N-pyridyl atoms of 5,10,15,20-tetra(3-pyridyl)porphyrin, H(2)(3-TCPyP), has been investigated in comparison with the planar tetra(4-pyridyl) porphyrin analogue H(2)(4-TCPyP). The steric effects from the bulky peripheral complexes play a critical role in the H(2)(3-TCPyP) species, determining a non-planar configuration around the porphyrin centre and precluding any significant pi-electronic coupling, in contrast with the less hindered H(2)(4-TCPyP) species. Both systems exhibit a photoelectrochemical response in the presence of nanocrystalline TiO(2) films, involving the porphyrin excitation around 450 nm. However, only in the H(2)(4-TCPyP) case do the cluster moieties also contribute to the photoinduced electron injection process at 670 nm, reflecting the relevance of the electronic coupling between the porphyrin centre and the peripheral complexes.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A large number of initiatives in cities in Brazil - including slum clearance and upgrading - have been undertaken over the years in an effort to ameliorate the problems arising from informal occupation; unfortunately, however, little is known about the related performance outcomes. Careful appraisal of the results of such initiatives is thus called for, covering evaluations of dwellers` perceptions of the upgraded environments. Among the available evaluation methods, post-occupancy evaluation (POE) is commonly employed, although it fails adequately to reflect prevailing subjective concepts of quality. The present paper contains the partial findings of a research exercise aimed at developing an original method, using fuzzy logic, for urban environmental quality evaluation in informally occupied areas on the basis of combining quantitative indicators and dweller perception. It combines POE with fuzzy logic in order to develop tools that can better model the uncertain information that emerges from that kind of study. This paper aims to introduce an uncertainty measure used in order to identify the strengths and weaknesses of slum upgrading projects. The results show that it is possible to quantify certainty degrees in the findings and to define if additional information is needed.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks. (c) 2007 Elsevier Inc. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Necessary and sufficient conditions are given for the edge-disjoint decomposition of a complete tripartite graph K-r,K-s,K-t into exactly alpha 3-cycles and beta 4-cycles. (C) 1999 Elsevier Science B.V. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Relevância:

30.00% 30.00%

Publicador:

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this paper necessary and sufficient conditions are given for the metamorphosis of a lambda-fold K-3,K-3-design of order n into a lambda-fold 6-cycle system of order n, by retaining one 6-cycle subgraph from each copy of K-3,K-3, and then rearranging the set of all the remaining edges, three from each K-3,K-3, into further 6-cycles so that the result is a lambda-fold 6-cycle system.