5499 search results - page 60 / 1100 » Generalized Rewrite Theories |
POPL
1994
ACM
13 years 11 months ago
1994
ACM
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
LICS
1990
IEEE
13 years 11 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
CAV
2009
Springer
14 years 2 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....