The paper discusses a new class of formal languages called standard Klanguages (SK-languages) as a powerful tool for building contracts concluded by computer intelligent agents and representing contents of arbitrary e-negotiations. The definition of SK-languages is a part of a mathematical model describing a system consisting of such 10 operations on structured meanings (SMs) of natural language texts (NL-texts) that, using primitive conceptual items as "blocks", it is possible to build SMs of, probably, arbitrary NL-texts. This means that a class of languages is determined being convenient for building semantic descriptions of arbitrary goods, services, and contracts. The principal advantages of SK-languages in comparison with first-order logic, Discourse Representation Theory, Theory of Conceptual Graphs, and Episodic Logic concern representing complicated goals and destinations of things, definitions of concepts, compound definitions of sets, and meanings of discourses with the references to the meaning of a phrase or larger part of discourse. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Fomichov, V. A. (2005). Standard K-languages as a powerful and flexible tool for building contracts and representing contents of arbitrary E-negotiations. In Lecture Notes in Computer Science (Vol. 3590, pp. 138–147). Springer Verlag. https://doi.org/10.1007/11545163_14
Mendeley helps you to discover research relevant for your work.