7988 search results - page 92 / 1598 » A Useful Undecidable Theory |
FROCOS
2009
Springer
14 years 3 months ago
2009
Springer
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
COCO
2007
Springer
14 years 3 months ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
ECIS
2001
13 years 10 months ago
2001
Giddens' structuration theory (ST) offers an account of social life in terms of social practices developing and changing over time and space, which makes no attempt to direct...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
CP
2004
Springer
14 years 2 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...