Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleOn logical fiberings and automated deduction in many-valued logics using Gr\"obner bases.
Author(s) Jochen Pfalzgraf
TypeArticle in Journal
AbstractThe concept of logical fiberings is briefly summarized. Based on experiences with concrete examples an algorithmic approach is developed which leads to a represention of a many-valued logic as a logical fibering. The Stone isomorphism for expressing classical logical operations by corresponding polynomials can be extended to m-valued logics. On the basis of this, a classical deduction problem can be treated symbolically as a corresponding ideal membership problem using computer algebra support with the method of Gröbner bases. A logical fibering representation in this context provides a parallelization of the original problem and leads to (fiberwise) simpler polynomials and thus to a reduction of complexity.
ISSN1578-7303
URL https://eudml.org/doc/41048
LanguageEnglish
JournalRACSAM, Rev. R. Acad. Cienc. Exactas F
Volume98
Number1-2
Pages213--227
PublisherReal Academia de Ciencias, Madrid
Year2004
Edition0
Translation No
Refereed No
Webmaster