1458 search results - page 70 / 292 » Extended Term Rewriting Systems |
ATAL
2008
Springer
14 years 12 months ago
2008
Springer
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...
101
click to vote
ESSLLI
2009
Springer
14 years 7 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
117
click to vote
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
INEX
2004
Springer
15 years 3 months ago
2004
Springer
This paper discusses our participation in INEX using the TIJAH XML-IR system. We have enriched the TIJAH system, which follows a standard layered database architecture, with severa...
MIDDLEWARE
2001
Springer
15 years 2 months ago
2001
Springer
Although it has long been realised that ACID transactions by themselves are not adequate for structuring long-lived applications and much research work has been done on developing...