4257 search results - page 99 / 852 » The Logical Modularity of Programs |
116
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
107
Voted
SIGSOFT
2006
ACM
16 years 3 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
136
Voted
CCS
2003
ACM
15 years 7 months ago
2003
ACM
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
112
Voted
DATE
2010
IEEE
15 years 7 months ago
2010
IEEE
Modern FPGAs have been designed with advanced integrated circuit techniques that allow high speed and low power performance, joined to reconfiguration capabilities. This makes new...
136
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...