896 search results - page 54 / 180 » On completeness of word reversing |
175
click to vote
AOSD
2009
ACM
15 years 10 months ago
2009
ACM
Aspect-oriented programming (AOP) eases the development of profilers, debuggers, and reverse engineering tools. Such tools frequently rely on calling context information. However,...
162
click to vote
ICANN
2009
Springer
16 years 25 days ago
2009
Springer
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...
155
click to vote
FOCS
2008
IEEE
16 years 22 days ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...
140
click to vote
APAL
2010
15 years 6 months ago
2010
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
150
click to vote
APAL
2008
15 years 6 months ago
2008
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...