Inference for annotated logics over distributive lattices

DOI10.1007/3-540-48050-1_32MaRDI QIDQ3046854zbMATH OpenFDO

Authors James J. Lu, Neil V. Murray, H. Radjavi, Erik Rosenthal, P. Rosenthal

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2366/23660285.htm

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 2209897
• -resolution: An inference rule for regular multiple-valued logics
• Annotated hyperresolution for non-Horn regular multiple-valued logics
• On Theorem Proving in Annotated Logics
• Sound and complete SLD-resolution for bilattice-based annotated logic programs

Cited in

(8)

• Composite distributive lattices as annotation domains for mediators
• Approximate Inference for Logic Programs with Annotated Disjunctions
• -resolution: An inference rule for regular multiple-valued logics
• On Theorem Proving in Annotated Logics
• Composite distributive lattices as annotation domains for mediators
• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
• scientific article; zbMATH DE number 2209897 (Why is no real title available?)
• Binary resolution over Boolean lattices

This page was built for publication: Inference for annotated logics over distributive lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046854)