Mixed Theories

Radev, Slavian. "Mixed Theories." Serdica Journal of Computing 1.1 (2007): 101-114. <http://eudml.org/doc/11411>.

@article{Radev2007,
abstract = {In the present paper we investigate the life cycles of formalized theories that appear in decision making instruments and science. In few words mixed theories are build in the following steps: Initially a small collection of facts is the kernel of the theory. To express these facts we make a special formalized language. When the collection grows we add some inference rules and thus some axioms to compress the knowledge. The next step is to generalize these rules to all expressions in the formalized language. For these rules we introduce some conclusion procedure. In such a way we make small theories for restricted fields of the knowledge. The most important procedure is the mixing of these partial knowledge systems. In that step we glue the theories together and eliminate the contradictions. The last operation is the most complicated one and some simplifying procedures are proposed.},
author = {Radev, Slavian},
journal = {Serdica Journal of Computing},
keywords = {Formal Theories; Expert Systems; Logical Inference; Argumentation Systems},
language = {eng},
number = {1},
pages = {101-114},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Mixed Theories},
url = {http://eudml.org/doc/11411},
volume = {1},
year = {2007},
}

TY - JOUR
AU - Radev, Slavian
TI - Mixed Theories
JO - Serdica Journal of Computing
PY - 2007
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 1
IS - 1
SP - 101
EP - 114
AB - In the present paper we investigate the life cycles of formalized theories that appear in decision making instruments and science. In few words mixed theories are build in the following steps: Initially a small collection of facts is the kernel of the theory. To express these facts we make a special formalized language. When the collection grows we add some inference rules and thus some axioms to compress the knowledge. The next step is to generalize these rules to all expressions in the formalized language. For these rules we introduce some conclusion procedure. In such a way we make small theories for restricted fields of the knowledge. The most important procedure is the mixing of these partial knowledge systems. In that step we glue the theories together and eliminate the contradictions. The last operation is the most complicated one and some simplifying procedures are proposed.
LA - eng
KW - Formal Theories; Expert Systems; Logical Inference; Argumentation Systems
UR - http://eudml.org/doc/11411
ER -