Research into the processing of symbolic knowledge by means of connectionist networks aims at systems which combine the declarative nature of logicbased artificial intelligence with the robustness and trainability of artificial neural networks. This endeavour has been addressed quite successfully in the past for propositional knowledge representation and reasoning tasks. However, as soon as the...

This paper presents a new type of programming language (also called modeling language) which allows a modeler to combine declarative and algorithmic knowledge, that is, mathematical-logical constraints on the one hand and an instruction sequence defining an algorithm on the other hand. The approach is new in the sense that it strictly separates syntactically and sematically the declarative from...

Logic and functional programming languages have many advantages and there is a growing trend to develop languages which incorporate both these paradigms. One of the disadvantages of such languages is that the execution mechanisms are so complex that traditional debugging methods are diicult to use. Declarative debugging techniques have been successful applied to Prolog and more recently functio...

In this paper, we consider the role that domain-dependent control knowledge plays in problem solving systems. Ginsberg and Geddis (Gins-berg & Geddis 1991) have claimed that domain-dependent control information has no place in declarative systems; instead, they say, such information should be derived from declarative facts about the domain plus domain-independent principles. We dispute their co...

This paper presents a skill learning model CLARION. Different from existing models of mostly high-level skill learning that use a top-down approach (that is, turning declarative knowledge into procedural knowledge through practice), we adopt a bottom-up approach toward low-level skill learning, where procedural knowledge develops first and declarative knowledge develops later. Our model is form...

This article reports the development and validation of a test instrument to assess secondary school students’ declarative quantum optics knowledge. With that, we respond modern developments from physics education research: Numerous researchers propose optics-based introductory courses in physics, focusing on experiments with heralded photons. Our instrument’s is based standards literature, foll...

The meaning of a declarative sentence and that of an interrogative sentence differ in their aspect of mood. A semantics of mood has to account for the differences in meaning between these sentences, and it also has to explain that sentences in different moods may have a common core. The meaning of the declarative mood is to be explained not in terms of actual force (contra Dummett), but in term...

This thesis argues that tackling the increased operating systems complexity with declarative techniques significantly reduces code complexity involved in adapting to a wide range of modern hardware. Modern hardware is increasingly diverse and complex. It is likely that this trend continues further. This trend complicates the operating systems construction. Operating systems have to adapt to the...

In this paper, we consider the role that domaindependent control knowledge plays in problem solving systems. Ginsberg and Geddis (Ginsberg & Geddis 1991) h ave claimed that domaindependent control information has no place in declarative systems; instead, they say, such information should be derived from declarative facts about the domain plus domain-independent principles. We dispute their conc...

Modeling dynamic, human-centric, non-standardized and knowledgeintensive business processes with imperative process modeling approaches is very challenging. Declarative process modeling approaches are more appropriate for these processes, as they offer the run-time flexibility typically required in these cases. However, by means of a realistic healthcare process that falls in the aforementioned...