A framework for automated reasoning in multiple-valued logics
From MaRDI portal
Publication:1272603
DOI10.1023/A:1005784309139zbMath0913.03023OpenAlexW1551340995MaRDI QIDQ1272603
Neil V. Murray, James J. Lu, Erik Rosenthal
Publication date: 23 March 1999
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1005784309139
automated reasoningannotated logicsmulti-valued logicsigned resolutionfuzzy operator logicsfuzzy resolutionsigned formulas
Fuzzy logic; logic of vagueness (03B52) Mechanization of proofs and logical operations (03B35) Logic programming (68N17) Many-valued logic (03B50)
Related Items
Automated theorem proving by resolution in non-classical logics ⋮ Binary resolution over Boolean lattices ⋮ \( \alpha \)-paramodulation method for a lattice-valued logic \(L_nF(X)\) with equality ⋮ Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) ⋮ A first polynomial non-clausal class in many-valued logic ⋮ Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\) ⋮ Fuzzy logic from the viewpoint of machine intelligence ⋮ \(\mho\)-resolution and hybrid knowledge bases ⋮ Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs ⋮ On the refutational completeness of signed binary resolution and hyperresolution
