1097 search results - page 122 / 220 » Revision Programming = Logic Programming Integrity Constra... |
143
click to vote
SLP
1994
15 years 4 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
225
Voted
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
119
Voted
CPAIOR
2006
Springer
15 years 7 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
248
Voted
POPL
2005
ACM
16 years 3 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
145
click to vote
LOGCOM
2010
14 years 10 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...