764 search results - page 31 / 153 » On the Expressibility of Stable Logic Programming |
179
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
164
click to vote
VL
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
154
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents a compiler from expressive, relational specifications to logic programs. Specifically, the compiler translates the Imperative Alloy specification language to...
178
click to vote
AI
2004
Springer
15 years 6 months ago
2004
Springer
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
155
click to vote
ERSHOV
2001
Springer
15 years 11 months ago
2001
Springer
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on r...