1989 search results - page 121 / 398 » Set functions for functional logic programming |
107
click to vote
FOSSACS
2007
Springer
15 years 1 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
AUSAI
2004
Springer
15 years 3 months ago
2004
Springer
The PolicyUpdater1 system is a fully-implemented access control system that provides policy evaluations as well as dynamic policy updates. These functions are achieved by the use o...
AGENTS
1997
Springer
15 years 2 months ago
1997
Springer
We describe a uniform technique for representing both sensory data and the attentional state of an agent using a subset of modal logic with indexicals. The resulting representatio...
APAL
2006
14 years 10 months ago
2006
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...