Treatment of Uncertainties with Algorithms of the Paraconsistent Annotated Logic

The method presented in this work is based on the fundamental concepts of Paraconsistent Annotated Logic with annotation of 2 values (PAL2v). The PAL2v is a non-classic Logics which admits contradiction and in this paper we perform a study using mathematical interpretation in its representative lattice. This studies result in algorithms and equations give an effective treatment on signals of information that represent situations found in uncertainty knowledge database. From the obtained equations, algorithms are elaborated to be utilized in computation models of the uncertainty treatment Systems. We presented some results that were obtained of analyses done with one of the algorithms that compose the paraconsistent analyzing system of logical signals with the PAL2v Logic. The paraconsistent reasoning system built according to the PAL2v methodology notions reveals itself to be more efficient than the traditional ones, because it gets to offer an appropriate treatment to contradictory information

A meta-interpreter based on paraconsistent legal knowledge engineering

The Legal Knowledge Engineering is a new topic of investigation of Artificial Intelligence. This paper discusses some relevant problems related to this new area in a summarized way. Within the Normative Law Theory, one question that arises naturally is that of contradiction, like for example: articles conflicting with other articles inside the same code, codes conflicting with codes, codes conflicting with jurisprudence, and in general, treatments with conflicting propositions in Normative Law Theory. This paper suggests to treat directly inconsistencies in the Legal Knowledge Engineering; this engineering has as underlying logic a paraconsistent annotated deontic logic. There are three main approximations in Legal Knowledge Engineering based on: cases, rules and logic. In this paper, we consider the approximation based on logic. It is considered a paraconsistent annotated deontic logic. Based on this logic, it is established a new proposal that is called Paraconsistent Legal Knowledge Engineering. For this proposal, it it is suggested a meta-interpreter to support the deontic operators as well as inconsistency — entitled on this paper Paralog D that can be used as a base to handle with the issues discussed

Assuring safety in an air traffic control system with defeasible logic programming

Assuring safety in complex technical systems is a crucial issue in several critical applications like air traffic control or medical devices. We present a preliminary framework based on argumentation for assisting flight controllers to reach a decision related to safety constraints in an ever changing environment in which sensor data is gathered at real time.Sociedad Argentina de Informática e Investigación Operativa (SADIO

Assuring safety in an air traffic control system with defeasible logic programming

Assuring safety in complex technical systems is a crucial issue in several critical applications like air traffic control or medical devices. We present a preliminary framework based on argumentation for assisting flight controllers to reach a decision related to safety constraints in an ever changing environment in which sensor data is gathered at real time.Sociedad Argentina de Informática e Investigación Operativa (SADIO

Prosessihallinta parakonsistentilla logiikalla

In this Master’s thesis the author’s aim is to give model building tools for the temporal paraconsistent logic program called Before-After Extended Vector Annotated Logic Program with Strong Negation (bf-EVALPSN), originally created by Professor Kazumi Nakamatsu of the Prefectural University of Hyogo, Japan. The tools bridge the paraconsistent logic program language with finite state automata

Paracomplete logic Kl: natural deduction, its automation, complexity and applications

In the development of many modern software solutions where the underlying systems are complex, dynamic and heterogeneous, the significance of specification-based verification is well accepted. However, often parts of the specification may not be known. Yet reasoning based on such incomplete specifications is very desirable. Here, paracomplete logics seem to be an appropriate formal setup: opposite to Tarski’s theory of truth with its principle of bivalence, in these logics a statement and its negation may be both untrue. An immediate result is that the law of excluded middle becomes invalid. In this paper we show a way to apply an automatic proof searching procedure for the paracomplete logic Kl to reason about incomplete information systems. We provide an original account of complexity of natural deduction systems, leading us closer to the efficiency of the presented proof search algorithm. Moreover, we have turned the assumptions management into an advantage showing the applicability of the proposed technique to assume-guarantee reasoning