Results 1 - 10 of 1,694

Process algebra for synchronous communication

by J. A. Bergstra, J. W. Klop - Inform. and Control , 1984
"... Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite ..."
Abstract - Cited by 426 (68 self) - Add to MetaCart
Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite

Lazy Satisfiability Modulo Theories

by Roberto Sebastiani - JOURNAL ON SATISFIABILITY, BOOLEAN MODELING AND COMPUTATION 3 (2007) 141€“224 , 2007
"... Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some decidable first-order theory T (SMT (T)). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized as increasingl ..."
Abstract - Cited by 189 (50 self) - Add to MetaCart
Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some decidable first-order theory T (SMT (T)). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized

Cryptographic Limitations on Learning Boolean Formulae and Finite Automata

by Michael Kearns, Leslie Valiant - PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING , 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract - Cited by 347 (14 self) - Add to MetaCart
-depth threshold circuits would have dramatic consequences for cryptography and number theory: in particular, such an algorithm could be used to break the RSA cryptosystem, factor Blum integers (composite numbers equivalent to 3 modulo 4), and detect quadratic residues. The results hold even if the learning

Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T)

by Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli - JOURNAL OF THE ACM , 2006
"... We first introduce Abstract DPLL, a rule-based formulation of the Davis-Putnam-Logemann-Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally reason about them in a simple way. Its properties, such ..."
Abstract - Cited by 255 (29 self) - Add to MetaCart
, such as soundness, completeness or termination, immediately carry over to the modern DPLL implementations with features such as backjumping or clause learning. We then extend the framework to Satisfiability Modulo background Theories (SMT) and use it to model several variants of the so-called lazy approach for SMT

A new approach to abstract syntax with variable binding

by Murdoch J. Gabbay, Andrew M. Pitts - Formal Aspects of Computing , 2002
"... Abstract. The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports notions of ‘name-abstraction ’ and ‘fresh name ’ that provide a new way to represent, compute with, and reason about the syntax of formal systems involving variable-binding op ..."
Abstract - Cited by 287 (63 self) - Add to MetaCart
-binding operations. Inductively defined FM-sets involving the name-abstraction set former (together with Cartesian product and disjoint union) can correctly encode syntax modulo renaming of bound variables. In this way, the standard theory of algebraic data types can be extended to encompass signatures involving

Theorem Proving Modulo

by Gilles Dowek, Thérèse Hardin, Claude Kirchner - Journal of Automated Reasoning
"... Abstract. Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of much wider interest because it permits to separate computations and deductions in a clean way. The first ..."
Abstract - Cited by 111 (18 self) - Add to MetaCart
-order logic can be presented as a theory modulo. Applying the Extended Narrowing and Resolution method to this presentation of higher-order logic subsumes full higher-order resolution.

On exact tachyon potential in open string field theory

by A. A. Gerasimov, S. L. Shatashvili
"... In these notes we revisit the tachyon lagrangian in the open string field theory using background independent approach of Witten from 1992. We claim that the tree level lagrangian (up to second order in derivatives and modulo some class of field redefinitions) is given by L = e −T (∂T) 2 + (1 + T)e ..."
Abstract - Cited by 200 (6 self) - Add to MetaCart
In these notes we revisit the tachyon lagrangian in the open string field theory using background independent approach of Witten from 1992. We claim that the tree level lagrangian (up to second order in derivatives and modulo some class of field redefinitions) is given by L = e −T (∂T) 2 + (1 + T

Arithmetic as a theory modulo

by Gilles Dowek, Benjamin Werner - Proceedings of RTA’05 , 2005
"... Abstract. We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the structure of cut free proofs is the key to many results about predicate logic with no axioms: analyticity and no ..."
Abstract - Cited by 29 (3 self) - Add to MetaCart
: there still is no notion of cut general enough to be applied to any axiomatic theory. Deduction modulo [2, 3] is one attempt, among others, towards this aim.

Avatar Categorization

by Daniel Kromand
"... The paper examines the various modes of designing video game avatars. The purpose is to establish an operational model for categorizing the avatars ’ design. Within a theoretical framework raised by Marie-Laure Ryan and Murray Smith I will establish two continua, which, merged together, lead to twin ..."
Abstract - Add to MetaCart
to twin axes that can be used to describe certain archetypes in avatar design. This paper examines typical avatar design and provides theory for different design models. Author Keywords Avatar theory, avatar categorization, game design, possible worlds

NTRU: A Ring-Based Public Key Cryptosystem

by Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman - Lecture Notes in Computer Science , 1998
"... . We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory requirements. NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability the ..."
Abstract - Cited by 205 (4 self) - Add to MetaCart
theory. The security of the NTRU cryptosystem comes from the interaction of the polynomial mixing system with the independence of reduction modulo two relatively prime integers p and q. Contents 0. Introduction 1. Description of the NTRU algorithm 1.1. Notation 1.2. Key Creation 1.3. Encryption 1
Results 1 - 10 of 1,694