Results 1  10
of
11
Preference modelling
 State of the Art in Multiple Criteria Decision Analysis
, 2005
"... This paper provides the reader with a presentation of preference modelling fundamental notions as well as some recent results in this field. Preference modelling is an inevitable step in a variety of fields: economy, sociology, psychology, mathematical programming, even medicine, archaeology, and ob ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
This paper provides the reader with a presentation of preference modelling fundamental notions as well as some recent results in this field. Preference modelling is an inevitable step in a variety of fields: economy, sociology, psychology, mathematical programming, even medicine, archaeology, and obviously decision analysis. Our notation and some basic definitions, such as those of binary relation, properties and ordered sets, are presented at the beginning of the paper. We start by discussing different reasons for constructing a model or preference. We then go through a number of issues that influence the construction of preference models. Different formalisations besides classical logic such as fuzzy sets and nonclassical logics become necessary. We then present different types of preference structures reflecting the behavior of a decisionmaker: classical, extended and valued ones. It is relevant to have a numerical representation of preferences: functional representations, value functions. The concepts of thresholds and minimal representation are also introduced in this section. In section 7, we briefly explore the concept of deontic logic (logic of preference) and other formalisms associated with &quot;compact representation of preferences &quot; introduced for special purposes. We end the paper with some concluding remarks.
Knowledge Representation as Domains
, 1994
"... This is a continuing attempt in a series of papers [KM 93, Mur 93, Mur 94] to show how computerrepresented knowledge can be arranged as elements of an effectively represented semantic domain in the sense of [GS 90]. We present a direct deductive description of the domain, which was defined sema ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This is a continuing attempt in a series of papers [KM 93, Mur 93, Mur 94] to show how computerrepresented knowledge can be arranged as elements of an effectively represented semantic domain in the sense of [GS 90]. We present a direct deductive description of the domain, which was defined semantically in [KM 93], via the Scott's notion of information system. Also, the internal structure of the continuous ampliative operations coordinated with the domain's effective basis is established. Though we always remain in the paradigm of the toleration of contradictory information described in [Bel 75, Bel 76], the approach in question could be extended to include domains for consistency knowledge bases. Key Words: semantic domain, effective basis, continuous operation, epistemic state, information system, deduction. 1 Introduction The presented approach grounds the notion of approximation for computerrepresented knowledge in the same way as it was done in the domain theory 1 fo...
Decision Support System for Assessing Companies Reliabilities
"... Abstract: In most information systems the management of databases is not considered to include neither explicit nor hidden inconsistencies. In real life situation information often come from different contradicting sources. Thus different sources can provide inconsistent data while deductive reasoni ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: In most information systems the management of databases is not considered to include neither explicit nor hidden inconsistencies. In real life situation information often come from different contradicting sources. Thus different sources can provide inconsistent data while deductive reasoning may result in hidden inconsistencies. In this paper we propose use of an automated decision support system facilitating assessment of company’s reliability based on manyvalued logic. Key–Words: manyvalued logic, lattices, reliability 1
Computer Science Journal of Moldova, vol.19, no.2(56), 2011 A New Foundation For Knowledge Systems
"... We propose mathematical foundations for knowledge systems based on the notion of effectively presented domain. The paper aims to give a schematic model for computer’s behavior in changing information environment. In this paper, we focus on computational resources rather than on computer’s particular ..."
Abstract
 Add to MetaCart
We propose mathematical foundations for knowledge systems based on the notion of effectively presented domain. The paper aims to give a schematic model for computer’s behavior in changing information environment. In this paper, we focus on computational resources rather than on computer’s particular actions.
unknown title
"... A first order, fourvalued, weakly paraconsistent logic and its relation with rough sets semantics ..."
Abstract
 Add to MetaCart
A first order, fourvalued, weakly paraconsistent logic and its relation with rough sets semantics
Logic of Information Knowledge
"... We share with some philosophers the view that a state of knowledge, being a part of the real world, can bring contradiction into it. Such an ontological reading of knowledge is very important when one deals with information knowledge, which arises as the content of the computer's memory whe ..."
Abstract
 Add to MetaCart
We share with some philosophers the view that a state of knowledge, being a part of the real world, can bring contradiction into it. Such an ontological reading of knowledge is very important when one deals with information knowledge, which arises as the content of the computer's memory when the computer is placed into changeable information environment ("information flow"), and "must" be able to tolerate any information (not excluding contradictions) from the computer 's users. Continuing research begun in [KM 93], we consider in length one kind of Scottcontinuous operations introduced there. Each such operation [A!B ], where A and B are formulas in a propositional language, called a rule, moves the computer to a "minimal" state of knowledge, in which B is true, if in a current state A is true. Note that the notion of rule is used here in an informationtransforming sense, rather than in the ordinary truthsound sense. We distinguish between global and local rules and s...
Some Knowledge Transformers: Infons and Constraints
, 1995
"... this paper is twofold. First, it is to present a general scheme within which information is supposed to turn into the computerrepresented knowledge and, second, to define two natural kinds of transfomers of this knowledge which this scheme thrusts us into considering. ..."
Abstract
 Add to MetaCart
this paper is twofold. First, it is to present a general scheme within which information is supposed to turn into the computerrepresented knowledge and, second, to define two natural kinds of transfomers of this knowledge which this scheme thrusts us into considering.
A Perspective Of New Foundations For Knowledge Maintenance Systems: Research Program
"... We propose to provide new mathematical foundations for the design of knowledgebased systems. The underlying idea is that the knowledge which the computer ("artificial agent") operates with is considered as a kind of abstract data type. In this context, a relation of approximation aris ..."
Abstract
 Add to MetaCart
We propose to provide new mathematical foundations for the design of knowledgebased systems. The underlying idea is that the knowledge which the computer ("artificial agent") operates with is considered as a kind of abstract data type. In this context, a relation of approximation arises in a natural way when one imagines the computer as operating in a changing information environment ("information flow"). This notion of approximation can be studied using the techniques that have been developed for domain theory in the context of denotational semantics of programming languages. y Acknowledgements: The text below was first submitted as a proposal to the National Science Foundation in October 1994; then it was extended and partially changed. The first version was thoroughly edited by Martin Davis to whom the author is gratefully thankful. Any current mistakes, however, are my own. I am also cordially appreciative to Will Klump for correcting my English at different stages of my...