700 search results - page 92 / 140 » On Termination of Constraint Logic Programs |
114
click to vote
PLANX
2007
15 years 16 days ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
85
Voted
DAC
2003
ACM
16 years 3 days ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
104
click to vote
AGP
1999
IEEE
15 years 3 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
EMSOFT
2008
Springer
15 years 27 days ago
2008
Springer
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE
Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language)can re...