18 search results - page 2 / 4 » One More Decidable Class of Finitely Ground Programs |
LPKR
1997
Springer
13 years 9 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
LPNMR
2007
Springer
13 years 11 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
VMCAI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
CSL
2008
Springer
13 years 7 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
BIRTHDAY
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. We consider programs which are data independent with respect to two type variables X and Y , and can in addition use arrays indexed by X and storing values from Y . We ar...