2273 search results - page 112 / 455 » On the Expressiveness and Complexity of ATL |
117
click to vote
ACL2
2006
ACM
15 years 4 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
AGP
2003
IEEE
15 years 3 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
CSL
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
PADO
2001
Springer
15 years 2 months ago
2001
Springer
Complex data dependencies can often be expressed concisely by defining a variable in terms of part of its own value. Such a circular reference can be naturally expressed in a lazy...
LPKR
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. This paper presents an extension of disjunctive datalog (Datalog∨ ) by nested rules. Nested rules are (disjunctive) rules where elements of the head may be also rules. ...