ParaLog e: a paraconsistent evidential logic programming language

@article{vila1997ParaLogEA,
  title={ParaLog e: a paraconsistent evidential logic programming language},
  author={Br{\'a}ulio Coelho {\'A}vila and Jair Minoro Abe and Jos{\'e} Pacheco de Almeida Prado},
  journal={Proceedings 17th International Conference of the Chilean Computer Science Society},
  year={1997},
  pages={2-8}
}
  • B. C. ÁvilaJ. AbeJ. Prado
  • Published 12 November 1997
  • Computer Science
  • Proceedings 17th International Conference of the Chilean Computer Science Society
Inconsistency is a natural phenomenon arising from the description of the real world. This phenomenon may be encountered in several situations. Nevertheless, human beings are capable of reasoning adequately. The automation of such reasoning requires the development of formal theories. ParaLog (Paraconsistent Logic) was proposed by N.C.A. da Costa et al. (1995) to provide tools to reason about inconsistencies. This paper describes an extension of the ParaLog logic programming language, called… 
View on IEEE
doi.ieeecomputersociety.org
19 Citations
Highly Influential Citations
1
Background Citations
2
Methods Citations
4

Tables from this paper

19 Citations

A Paraconsistent Higher Order Logic

This work presents a concise description of a paraconsistent higher order logic with countably infinite indeterminacy, where each basic formula can get its own indeterminate truth value.

Paraconsistent Knowledge Bases and Many-Valued Logic

This work presents a paraconsistent many-valued logic with a simple and new semantics for the logical operators, and compares its approach with work based on bilattices.

Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems

This paper shows how the family of corresponding paraconsistent consequence relations can be axiomatised by means of quantified Boolean formulas, furnishing an axiomatic specification of paracons consistent reasoning within the framework of signed systems.

A META-INTERPRETER BASED ON PARACONSISTENT LEGAL KNOWLEDGE ENGINEERING

A meta-interpreter to support the deontic operators as well as inconsistency is suggested — entitled on this paper Paralog D that can be used as a base to handle with the issues discussed.

Paraconsistent Logics: Preamble

  • J. Abe
  • Philosophy
    Paraconsistent Intelligent-Based Systems
  • 2015
In this introductory chapter it is introduced some aspects of paraconsistent logics, such as its brief historical developments, some main systems and mention some applications, namely theParaconsistent annotated logics.

Cognitive Agents and Paraconsistent Logic

This work defines architecture of cognitive and independent agents for the automatic treatment of Brazilian handwritten bank checks with the concept of autonomous agents to organize the application knowledge and brings several benefits to the approach.

Inconsistencies, exceptions and frame systems [knowledge representation]

  • B. C. ÁvilaF. Hembecker
  • Computer Science
    SCCC 2001. 21st International Conference of the Chilean Computer Science Society
  • 2001
The inheritance reasoner has provided a more adequate treatment to exceptions and inconsistent information of Frame Systems with multiple inheritance.

A paraconsistent system of autonomous agents for Brazilian bank check treatment

This paper focuses on the second layer of autonomous agents for the automatic treatment of handwritten Brazilian bank checks, on task distribution problems and on communication between agents.

Expert System based on Support Certainty Degree Annotated Paraconsistent Logic

The paper presents support certainty degree annotated paraconsistent logic reasoning method, which can be applied in the expert system, enabling the knowledge database of contradictions to reason and get the certainty degree of the conclusions.

Decision tree-based paraconsistent learning

In most situations where high rates of inconsistent examples were found, the decision tree-based machine learning technique presented better results when compared to the C4.5 algorithm.

References

SHOWING 1-10 OF 13 REFERENCES

Automatic Theorem Proving in Paraconsistent Logics: Theory and Implementation

This paper develops a linear resolution style proof procedure for mechanical reasoning in paraconsistent logics, a family of logics introduced by da Costa that found use in reasoning about logic programs that contained inconsistent and/or erroneous information.

Paraconsistent logics as a formalism for reasoning about inconsistent knowledge bases

Paraconsistent Logic Programming

Quantitative Deduction and its Fixpoint Theory

On the theory of inconsistent formal systems

  • N. Costa
  • Philosophy
    Notre Dame J. Formal Log.
  • 1974
Introduction This is an expository work,* in which we shall treat some questions related to the theory of inconsistent formal systems. The exposition will be neither rigorous nor complete. For…

Foundations of Logic Programming

Relating Dempster-Shafer Theory to Stable Semantics

On the Semantics of Quantitative Logic Programs

ProgrumaCCo e m LCdgicn e a Linguagem Prolog, Edit.ora Edgard Blucher Lt.da

  • SZo Paulo,
  • 1987

ParaNet: A Paraconsistent hfulti-Agent System, First World Congress on Paraconsistency, Universit.eit

  • Gent., Ghent.,
  • 1997