4257 search results - page 67 / 852 » The Logical Modularity of Programs |
JAIR
2008
14 years 12 months ago
2008
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
198
Voted
ECOOP
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. The expression families problem can be defined as the problem of achieving reusability and composability across the components involved in a family of related datatypes a...
SAC
2002
ACM
14 years 11 months ago
2002
ACM
Event-based systems are developed and used as a coordination model to integrate components in loosely coupled systems. Research and product development focused so far on efficienc...
115
click to vote
LPNMR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...
105
click to vote
ESOP
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. During the last two decades, monads have become an indispensable tool for structuring functional programs with computational effects. In this setting, the mathematical n...