3693 search results - page 434 / 739 » Splitting a Logic Program |
181
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
179
click to vote
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
346
click to vote
DIMACS
1996
15 years 8 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
183
click to vote
SAS
2009
Springer
16 years 1 months ago
2009
Springer
There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transfo...
167
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...