499 search results - page 55 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
132
click to vote
VL
1993
IEEE
15 years 8 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...
146
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
129
click to vote
EUROCOLT
1999
Springer
15 years 8 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
139
click to vote
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
15 years 10 months ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
150
click to vote
PPDP
2004
Springer
15 years 9 months ago
2004
Springer
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...