764 search results - page 74 / 153 » On the Expressibility of Stable Logic Programming |
248
Voted
POPL
2006
ACM
16 years 4 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
153
Voted
ILP
2007
Springer
15 years 10 months ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
152
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
143
Voted
ESOP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
241
Voted
POPL
2005
ACM
16 years 4 months ago
2005
ACM
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...