268 search results - page 35 / 54 » Equivalence for the G3'-stable models semantics |
GRID
2003
Springer
14 years 22 days ago
2003
Springer
With the advent of web services standards and a serviceoriented Grid architecture, it is foreseeable that competing as well as complimenting computational services will proliferat...
FM
2001
Springer
14 years 3 hour ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
JELIA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynami...
AC
2000
Springer
13 years 12 months ago
2000
Springer
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
DLT
2006
13 years 9 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...