1716 search results - page 60 / 344 » Proving Conditional Termination |
AGP
1997
IEEE
14 years 29 days ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
SIROCCO
2008
13 years 10 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
AI
2008
Springer
13 years 8 months ago
2008
Springer
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
ESOP
2010
Springer
14 years 6 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
ICLP
1999
Springer
14 years 1 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...