Inference in a multivalued logic system
International Journal of Man-Machine Studies
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
RI: A logic for reasoning with inconsistency
Proceedings of the Fourth Annual Symposium on Logic in computer science
Resolution principles in possibilistic logic
International Journal of Approximate Reasoning
Automated deduction in multiple-valued logics
Automated deduction in multiple-valued logics
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Resolution-based theorem proving for many-valued logics
Journal of Symbolic Computation
Journal of Symbolic Computation
Resolution proof systems: an algebraic theory
Resolution proof systems: an algebraic theory
L-valued propositional logic Lvpl
Information Sciences: an International Journal
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
A new fuzzy resolution principle based on the antonym
Fuzzy Sets and Systems
&agr;-resolution principle based on lattice-valued propositional logic LP(X)
Information Sciences: an International Journal
Fuzzy temporal constraint logic: a valid resolution principle
Fuzzy Sets and Systems
&agr;-resolution principle based on first-order lattice-valued logic LF (X)
Information Sciences: an International Journal
Evaluating general purpose automated theorem proving systems
Artificial Intelligence
Reductions for non-clausal theorem proving
Theoretical Computer Science
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Strategies for solving the Boolean satisfiability problem using binary decision diagrams
Journal of Systems Architecture: the EUROMICRO Journal
Temporal resolution using a breadth-first search
Annals of Mathematics and Artificial Intelligence
A Framework for Automated Reasoning in Multiple-Valued Logics
Journal of Automated Reasoning
Journal of Automated Reasoning
CLIN-S - A Semantically Guided First-Order Theorem Prover
Journal of Automated Reasoning
DISCOUNT - A Distributed and Learning Equational Prover
Journal of Automated Reasoning
LINUS - A Link Instantion Prover with Unit Support
Journal of Automated Reasoning
Decidability by Resolution for Propositional Modal Logics
Journal of Automated Reasoning
T-Resolution: Refinements and Model Elimination
Journal of Automated Reasoning
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
Signed Formulas and Fuzzy Operator Logics
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Optimal Axiomatizations for Multiple-Valued Operators and Quantifiers Based on Semi-lattices
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Computational Aspects of Three-Valued Logic
Proceedings of the 8th International Conference on Automated Deduction
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
The complexity of minimal satisfiability problems
Information and Computation
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Lattice implication ordered semigroups
Information Sciences: an International Journal
On v-filters and normal v-filters of a residuated lattice with a weak vt-operator
Information Sciences: an International Journal
Information Sciences: an International Journal
Determination of α-resolution in lattice-valued first-order logic LF(X)
Information Sciences: an International Journal
α-Lock resolution method for a lattice-valued first-order logic
Engineering Applications of Artificial Intelligence
α-satisfiability and α-lock resolution for a lattice-valued logic LP(X)
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
On compactness and consistency in finite lattice-valued propositional logic
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Hi-index | 0.11 |
As one of most powerful approaches in automated reasoning, resolution principle has been introduced to non-classical logics, such as many-valued logic. However, most of the existing works are limited to the chain-type truth-value fields. Lattice-valued logic is a kind of important non-classical logic, which can be applied to describe and handle incomparability by the incomparable elements in its truth-value field. In this paper, a filter-based resolution principle for the lattice-valued propositional logic LP(X) based on lattice implication algebra is presented, where filter of the truth-value field being a lattice implication algebra is taken as the criterion for measuring the satisfiability of a lattice-valued logical formula. The notions and properties of lattice implication algebra, filter of lattice implication algebra, and the lattice-valued propositional logic LP(X) are given firstly. The definitions and structures of two kinds of lattice-valued logical formulae, i.e., the simple generalized clauses and complex generalized clauses, are presented then. Finally, the filter-based resolution principle is given and after that the soundness theorem and weak completeness theorems for the presented approach are proved.