764 search results - page 61 / 153 » On the Expressibility of Stable Logic Programming |
185
Voted
ICLP
2011
Springer
14 years 7 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
124
Voted
CSL
2008
Springer
15 years 5 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...
235
Voted
POPL
2006
ACM
16 years 4 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
96
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
145
Voted
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...