2006•Unpublished venueRequires access

J - Automated Reasoning Method Based On LP(X)

Xiaobing Li, Dan Meng, Yang Xu

Abstract

In the present paper, automated reasoning based on lattice-valued propositional logic, will be focused where the clauses only contains 0- IESFs as its generalized literals. A method of automated reasoning is given, and the soundness and the completeness of this method is proved. It is hoped that this research will make forward theoretical research of automated reasoning based on lattice-valued logic.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Soundness, Automated reasoning, Completeness (order theory), Computer science, Propositional calculus, Non-monotonic logic, Deductive reasoning, Reasoning system