1020 search results - page 111 / 204 » Tight Semantics for Logic Programs |
ICLP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
ISTA
2003
15 years 1 months ago
2003
: A new approach of building enterprise distributed applications for layer of business rules as standard part of architecture is proposed in this paper. The approach uses symbolic ...
108
click to vote
ESOP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
114
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
ECBS
1997
IEEE
15 years 4 months ago
1997
IEEE
We present a new approach to an interactive design and analysis environment for visual languages. The main components, i.e., editor, animator, and interpreter, are introduced. The...