238 search results - page 42 / 48 » On the Modularity of Theories |
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we study how argumentation can be used as a basis for negotiation between autonomous agents, where negotiation strategies of the different parties are represented a...
AOSD
2012
ACM
12 years 3 months ago
2012
ACM
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...