Sciweavers

439 search results - page 3 / 88
» Instantiation-Based Automated Reasoning: From Theory to Prac...
Sort
View
CADE
2007
Springer
14 years 6 months ago
MaLARea: a Metasystem for Automated Reasoning in Large Theories
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...
Josef Urban
IACR
2011
125views more  IACR 2011»
12 years 5 months ago
On Constructing Homomorphic Encryption Schemes from Coding Theory
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
Frederik Armknecht, Daniel Augot, Ludovic Perret, ...
ICLP
1993
Springer
13 years 9 months ago
Control Generation for Logic Programs
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
Stefan Lüttringhaus-Kappel
LPNMR
2005
Springer
13 years 11 months ago
Some Logical Properties of Nonmonotonic Causal Theories
The formalism of nonmonotonic causal theories (Giunchiglia, Lee, Lifschitz, McCain, Turner, 2004) provides a general-purpose formalism for nonmonotonic reasoning and knowledge repr...
Marek J. Sergot, Robert Craven
CSL
1990
Springer
13 years 9 months ago
On the Reduction Theory for Average Case Complexity
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
Andreas Blass, Yuri Gurevich