scientific article; zbMATH DE number 2209897
This paper continues a series of articles by these authors describing signed logics, their relations to annotated logics and proof procedures for them. The signed logics were proposed by \textit{J. J. Lu} [J. Log. Comput. 6, 755--778 (1996; Zbl 0874.68062)] as alternative to the annotated logics of M. Kifer and V. S. Subrahmanian [see, e.g., \textit{A. Nerode, J. B. Remmel} and \textit{V. S. Subrahmanian}, Theor. Comput. Sci. 171, 111--146 (1997; Zbl 0874.68276) and references therein]. The signed logics generalise annotated logics in the sense that they do not require any particular ordering on a set of truth values. But at the same time signed logics do not allow for variables and functions over signs and this is why they deal with finitely interpreted logics and do not cover infinitely interpreted logics with annotation variables and functions. In the present paper the authors make even further restriction and consider only annotated logics based on distributive (ordinary) lattices. Further they give sound and complete proof procedure for signed logics and annotated logics with constant annotations. The proof procedure is based on the \(\mho\)-rule, which was introduced by \textit{S. M. Leach, J. J. Lu, N. V. Murray} and \textit{E. Rosenthal} [J. Franklin Inst. 338, 583--600 (2001; Zbl 0983.68062)] and in fact substitutes two rules (annotated resolution and reduction) out of four sound and complete inference rules for lattice-based annotated logics, introduced by \textit{M. Kifer} and \textit{E. L. Lozinskii} [in: Logic in computer science, Proc. 4th Annual Symp., Pacific Grove/CA (USA) 1989, 253--262 (1989; Zbl 0717.03005)]. A separate section is devoted to the relation of \(\mho\)-resolution to alternative inference systems, including annotated hyper-resolution and annotated hyper-tableaux.
- Logic programming with signs and annotations
- Inference for annotated logics over distributive lattices
- Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness
- -resolution: An inference rule for regular multiple-valued logics
- On Theorem Proving in Annotated Logics
- Sound and complete SLD-resolution for bilattice-based annotated logic programs
- A first polynomial non-clausal class in many-valued logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692880)