1020 search results - page 87 / 204 » Tight Semantics for Logic Programs |
119
Voted
ENTCS
2002
15 years 2 months ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
99
Voted
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...
128
click to vote
AUSAI
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
134
Voted
FOSSACS
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
119
Voted
ICPADS
1996
IEEE
15 years 6 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...