004 Datenverarbeitung; Informatik
Refine
Year of publication
Document Type
- Conference Proceeding (54) (remove)
Keywords
- Cloud Computing (3)
- middleware (3)
- Constraint Solving (2)
- Deduction (2)
- Forschungsprojekte (2)
- Future SOC Lab (2)
- Hochschuldidaktik (2)
- In-Memory Technologie (2)
- Informatik (2)
- Informatikdidaktik (2)
A deterministic cycle scheduling of partitions at the operating system level is supposed for a multiprocessor system. In this paper, we propose a tool for generating such schedules. We use constraint based programming and develop methods and concepts for a combined interactive and automatic partition scheduling system. This paper is also devoted to basic methods and techniques for modeling and solving this partition scheduling problem. Initial application of our partition scheduling tool has proved successful and demonstrated the suitability of the methods used.
We propose a paraconsistent declarative semantics of possibly inconsistent generalized logic programs which allows for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any specific connective, such as negation(-as-failure), nor on any specific syntax of rules). For consistent generalized logic programs this semantics coincides with the stable generated models introduced in [HW97], and for normal logic programs it yields the stable models in the sense of [GL88].