90 search results - page 13 / 18 » Discovering Classes of Strongly Equivalent Logic Programs |
POPL
2005
ACM
14 years 7 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
PREMI
2007
Springer
14 years 1 months ago
2007
Springer
Humans effortlessly classify and recognize complex patterns even if their attributes are imprecise and often inconsistent. It is not clear how the brain processes uncertain visual ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
ENTCS
2007
13 years 7 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...