2909 search results - page 13 / 582 » Consistency of the theory of contexts |
RTA
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
AAAI
1994
14 years 5 days ago
1994
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
CONCUR
2008
Springer
14 years 19 days ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
BIOCOMP
2008
14 years 9 days ago
2008
A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequences. In terms of the theory of symbolic dynamics, neither of the Dyck shift nor the Motzki...
CPAIOR
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...