314 search results - page 36 / 63 » Compactness Properties for Stable Semantics of Logic Program... |
149
click to vote
POPL
2002
ACM
15 years 9 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
AUSAI
2006
Springer
15 years 1 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...
AGP
1998
IEEE
15 years 1 months ago
1998
IEEE
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representa...
FAC
2008
14 years 9 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...