2236 search results - page 343 / 448 » Language Independence and Language Tolerance in Logic Progra... |
125
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
136
click to vote
ETFA
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a new approach to modelling and verification of function block applications of the IEC 61499 standard. The approach uses the language of logic programming Prol...
118
click to vote
CSL
2004
Springer
15 years 9 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
135
click to vote
CL
2000
Springer
15 years 8 months ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
139
click to vote
PEPM
1993
ACM
15 years 8 months ago
1993
ACM
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...