1998
DOI: 10.1016/s0169-023x(98)00047-0
|View full text |Cite
|
Sign up to set email alerts
|

Modal Change Logic (MCL): Specifying the reasoning of knowledge-based systems

Abstract: Abstract.We investigate the formal specification of the reasoning process of knowledge-based systems in this paper. We analyze the corresponding parts of the KADS specification languages KARL and (ML) 2 and deduce some general requirements. The essence of these languages is that they integrate a declarative specification of inferences with control information. The languages differ in the way they achieve this integration and each of them has shortcomings. We propose a unifying semantical framework that integra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

1998
1998
2001
2001

Publication Types

Select...
5
2

Relationship

4
3

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 20 publications
0
12
0
Order By: Relevance
“…This phenomenon is known as the reusability-usability trade-off [85]. Recently, research has been conducted to overcome this dichotomy by introducing adapters that gradually adapt task-neutral PSMs to task-specific ones [58] and by semi-automatically constructing the mappings between task-neutral PSMs and domain knowledge [19].…”
Section: Types Of Psm Librariesmentioning
confidence: 99%
See 1 more Smart Citation
“…This phenomenon is known as the reusability-usability trade-off [85]. Recently, research has been conducted to overcome this dichotomy by introducing adapters that gradually adapt task-neutral PSMs to task-specific ones [58] and by semi-automatically constructing the mappings between task-neutral PSMs and domain knowledge [19].…”
Section: Types Of Psm Librariesmentioning
confidence: 99%
“…a certain PSM needs a causal domain model) or to task knowledge (a certain PSM generates locally optimal solutions). To our knowledge, there does not exist a library organised following this principle, but work is currently being performed to shed more light on the role of assumptions in libraries for knowledge engineering ( [17], [18], [56], [58]). …”
Section: Organisation Of Librariesmentioning
confidence: 99%
“…The combination of parallel updates and conditional choice make DDL very close to the more recently proposed language MLPM [8], with the parallel updates corresponding to MLPM's ! operator, and the conditional choice corresponding to MLPM's operator.…”
Section: The First-order Casementioning
confidence: 85%
“…However, whereas in DL, transitions can only be defined in terms of assignments to variables, PDDL and DDL define transitions in terms of truth-assignments to propositions (PDDL) or predicates (DDL). In this respect, DDL and PDDL are closely related to the more recent proposals for the language MLPM [8], which allows the explicit definition of transitions by assigning values to truth of predicates, and of MLCM [47], which also allows for the assignment of function values. We now turn to the discussion of PDDL and DDL, respectively.…”
Section: Dynamic Database Logicmentioning
confidence: 99%
See 1 more Smart Citation